./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.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 65cc93bea37c503291576929a444106bffa9d5b7b84b8d294ee7e7120b60ffa5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:44:19,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:44:19,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:44:19,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:44:19,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:44:19,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:44:19,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:44:19,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:44:19,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:44:19,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:44:19,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:44:19,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:44:19,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:44:19,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:44:19,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:44:19,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:44:19,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:44:19,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:44:19,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:44:19,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:44:19,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:44:19,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:44:19,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:44:19,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:44:19,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:44:19,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:44:19,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:44:19,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:44:19,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:44:19,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:44:19,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:44:19,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:44:19,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:44:19,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:44:19,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:44:19,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:44:19,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:44:19,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:44:19,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:44:19,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:44:19,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:44:19,323 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:44:19,349 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:44:19,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:44:19,350 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:44:19,350 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:44:19,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:44:19,351 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:44:19,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:44:19,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:44:19,352 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:44:19,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:44:19,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:44:19,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:44:19,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:44:19,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:44:19,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:44:19,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:44:19,354 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:44:19,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:44:19,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:44:19,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:44:19,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:44:19,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:44:19,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:44:19,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:44:19,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:44:19,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:44:19,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:44:19,355 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:44:19,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:44:19,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:44:19,356 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 -> 65cc93bea37c503291576929a444106bffa9d5b7b84b8d294ee7e7120b60ffa5 [2022-02-20 21:44:19,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:44:19,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:44:19,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:44:19,583 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:44:19,584 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:44:19,585 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i [2022-02-20 21:44:19,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27438c7e9/22a67e9c58dd418ab72b327dbdfea008/FLAG10a532308 [2022-02-20 21:44:20,194 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:44:20,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i [2022-02-20 21:44:20,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27438c7e9/22a67e9c58dd418ab72b327dbdfea008/FLAG10a532308 [2022-02-20 21:44:20,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27438c7e9/22a67e9c58dd418ab72b327dbdfea008 [2022-02-20 21:44:20,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:44:20,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:44:20,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:44:20,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:44:20,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:44:20,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:44:20" (1/1) ... [2022-02-20 21:44:20,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3207162c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:20, skipping insertion in model container [2022-02-20 21:44:20,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:44:20" (1/1) ... [2022-02-20 21:44:20,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:44:20,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:44:21,242 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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i[138616,138629] [2022-02-20 21:44:21,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:44:21,339 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:44:21,504 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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i[138616,138629] [2022-02-20 21:44:21,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:44:21,559 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:44:21,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21 WrapperNode [2022-02-20 21:44:21,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:44:21,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:44:21,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:44:21,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:44:21,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21" (1/1) ... [2022-02-20 21:44:21,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21" (1/1) ... [2022-02-20 21:44:21,681 INFO L137 Inliner]: procedures = 161, calls = 836, calls flagged for inlining = 53, calls inlined = 28, statements flattened = 1124 [2022-02-20 21:44:21,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:44:21,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:44:21,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:44:21,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:44:21,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21" (1/1) ... [2022-02-20 21:44:21,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21" (1/1) ... [2022-02-20 21:44:21,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21" (1/1) ... [2022-02-20 21:44:21,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21" (1/1) ... [2022-02-20 21:44:21,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21" (1/1) ... [2022-02-20 21:44:21,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21" (1/1) ... [2022-02-20 21:44:21,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21" (1/1) ... [2022-02-20 21:44:21,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:44:21,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:44:21,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:44:21,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:44:21,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21" (1/1) ... [2022-02-20 21:44:21,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:44:21,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:44:21,826 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 21:44:21,837 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 21:44:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2022-02-20 21:44:21,866 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2022-02-20 21:44:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure pf_getgeo [2022-02-20 21:44:21,866 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_getgeo [2022-02-20 21:44:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2022-02-20 21:44:21,866 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2022-02-20 21:44:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2022-02-20 21:44:21,867 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2022-02-20 21:44:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2022-02-20 21:44:21,867 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2022-02-20 21:44:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:44:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pf_mutex [2022-02-20 21:44:21,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pf_mutex [2022-02-20 21:44:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure pf_reset [2022-02-20 21:44:21,867 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_reset [2022-02-20 21:44:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:44:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2022-02-20 21:44:21,868 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2022-02-20 21:44:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure pf_wait [2022-02-20 21:44:21,868 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_wait [2022-02-20 21:44:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2022-02-20 21:44:21,868 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2022-02-20 21:44:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:44:21,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:44:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pf_mutex [2022-02-20 21:44:21,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pf_mutex [2022-02-20 21:44:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure pf_check_events [2022-02-20 21:44:21,869 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_check_events [2022-02-20 21:44:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-02-20 21:44:21,869 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-02-20 21:44:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:44:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-02-20 21:44:21,869 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-02-20 21:44:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:44:21,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:44:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-02-20 21:44:21,870 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-02-20 21:44:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure pf_req_sense [2022-02-20 21:44:21,870 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_req_sense [2022-02-20 21:44:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure pf_completion [2022-02-20 21:44:21,870 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_completion [2022-02-20 21:44:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:44:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-02-20 21:44:21,871 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-02-20 21:44:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:44:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-02-20 21:44:21,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-02-20 21:44:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:44:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:44:21,871 INFO L130 BoogieDeclarations]: Found specification of procedure pf_atapi [2022-02-20 21:44:21,887 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_atapi [2022-02-20 21:44:21,887 INFO L130 BoogieDeclarations]: Found specification of procedure pf_command [2022-02-20 21:44:21,887 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_command [2022-02-20 21:44:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure pf_probe [2022-02-20 21:44:21,888 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_probe [2022-02-20 21:44:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:44:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure pf_identify [2022-02-20 21:44:21,888 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_identify [2022-02-20 21:44:21,889 INFO L130 BoogieDeclarations]: Found specification of procedure pf_sleep [2022-02-20 21:44:21,890 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_sleep [2022-02-20 21:44:21,890 INFO L130 BoogieDeclarations]: Found specification of procedure pf_mode_sense [2022-02-20 21:44:21,890 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_mode_sense [2022-02-20 21:44:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2022-02-20 21:44:21,891 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2022-02-20 21:44:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:44:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:44:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2022-02-20 21:44:21,891 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2022-02-20 21:44:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2022-02-20 21:44:21,891 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2022-02-20 21:44:21,891 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2022-02-20 21:44:21,892 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2022-02-20 21:44:21,892 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-02-20 21:44:21,892 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-02-20 21:44:21,892 INFO L130 BoogieDeclarations]: Found specification of procedure get_capacity [2022-02-20 21:44:21,892 INFO L138 BoogieDeclarations]: Found implementation of procedure get_capacity [2022-02-20 21:44:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure pf_lock [2022-02-20 21:44:21,893 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_lock [2022-02-20 21:44:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:44:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure xl [2022-02-20 21:44:21,893 INFO L138 BoogieDeclarations]: Found implementation of procedure xl [2022-02-20 21:44:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:44:21,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:44:21,893 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2022-02-20 21:44:21,893 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2022-02-20 21:44:21,894 INFO L130 BoogieDeclarations]: Found specification of procedure pf_ioctl [2022-02-20 21:44:21,894 INFO L138 BoogieDeclarations]: Found implementation of procedure pf_ioctl [2022-02-20 21:44:22,387 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:44:22,407 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:44:25,192 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:44:25,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:44:25,202 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:44:25,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:44:25 BoogieIcfgContainer [2022-02-20 21:44:25,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:44:25,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:44:25,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:44:25,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:44:25,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:44:20" (1/3) ... [2022-02-20 21:44:25,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddf966b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:44:25, skipping insertion in model container [2022-02-20 21:44:25,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:44:21" (2/3) ... [2022-02-20 21:44:25,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddf966b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:44:25, skipping insertion in model container [2022-02-20 21:44:25,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:44:25" (3/3) ... [2022-02-20 21:44:25,210 INFO L111 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pf.ko-main.cil.out.i [2022-02-20 21:44:25,213 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:44:25,213 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:44:25,243 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:44:25,247 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 21:44:25,247 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:44:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 524 states, 375 states have (on average 1.3706666666666667) internal successors, (514), 389 states have internal predecessors, (514), 112 states have call successors, (112), 37 states have call predecessors, (112), 37 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-02-20 21:44:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 21:44:25,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:44:25,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:44:25,274 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:44:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:44:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1009188828, now seen corresponding path program 1 times [2022-02-20 21:44:25,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:44:25,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795392025] [2022-02-20 21:44:25,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:44:25,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:44:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:25,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {527#true} is VALID [2022-02-20 21:44:25,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {527#true} is VALID [2022-02-20 21:44:25,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {529#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:44:25,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {529#(= ~ldv_state_variable_1~0 0)} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {529#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:44:25,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {529#(= ~ldv_state_variable_1~0 0)} assume main_#t~switch306#1; {529#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:44:25,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(= ~ldv_state_variable_1~0 0)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet307#1 && main_#t~nondet307#1 <= 2147483647;main_~tmp___0~15#1 := main_#t~nondet307#1;havoc main_#t~nondet307#1;main_#t~switch308#1 := 0 == main_~tmp___0~15#1; {528#false} is VALID [2022-02-20 21:44:25,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {528#false} assume !main_#t~switch308#1;main_#t~switch308#1 := main_#t~switch308#1 || 1 == main_~tmp___0~15#1; {528#false} is VALID [2022-02-20 21:44:25,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#false} assume !main_#t~switch308#1;main_#t~switch308#1 := main_#t~switch308#1 || 2 == main_~tmp___0~15#1; {528#false} is VALID [2022-02-20 21:44:25,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#false} assume !main_#t~switch308#1;main_#t~switch308#1 := main_#t~switch308#1 || 3 == main_~tmp___0~15#1; {528#false} is VALID [2022-02-20 21:44:25,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {528#false} assume main_#t~switch308#1; {528#false} is VALID [2022-02-20 21:44:25,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {528#false} assume 2 == ~ldv_state_variable_1~0;assume { :begin_inline_pf_release } true;pf_release_#in~disk#1.base, pf_release_#in~disk#1.offset, pf_release_#in~mode#1 := ~pf_fops_group2~0.base, ~pf_fops_group2~0.offset, ~ldvarg1~0;havoc pf_release_#res#1;havoc pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset, pf_release_#t~mem111#1, pf_release_#t~mem112#1, pf_release_#t~mem113#1, pf_release_#t~mem114#1, pf_release_#t~short115#1, pf_release_~disk#1.base, pf_release_~disk#1.offset, pf_release_~mode#1, pf_release_~pf~4#1.base, pf_release_~pf~4#1.offset;pf_release_~disk#1.base, pf_release_~disk#1.offset := pf_release_#in~disk#1.base, pf_release_#in~disk#1.offset;pf_release_~mode#1 := pf_release_#in~mode#1;havoc pf_release_~pf~4#1.base, pf_release_~pf~4#1.offset;call pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset := read~$Pointer$(pf_release_~disk#1.base, 1275 + pf_release_~disk#1.offset, 8);pf_release_~pf~4#1.base, pf_release_~pf~4#1.offset := pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset;havoc pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset;assume { :begin_inline_ldv_mutex_lock_12 } true;ldv_mutex_lock_12_#in~ldv_func_arg1#1.base, ldv_mutex_lock_12_#in~ldv_func_arg1#1.offset := ~#pf_mutex~0.base, ~#pf_mutex~0.offset;havoc ldv_mutex_lock_12_~ldv_func_arg1#1.base, ldv_mutex_lock_12_~ldv_func_arg1#1.offset;ldv_mutex_lock_12_~ldv_func_arg1#1.base, ldv_mutex_lock_12_~ldv_func_arg1#1.offset := ldv_mutex_lock_12_#in~ldv_func_arg1#1.base, ldv_mutex_lock_12_#in~ldv_func_arg1#1.offset; {528#false} is VALID [2022-02-20 21:44:25,568 INFO L272 TraceCheckUtils]: 11: Hoare triple {528#false} call ldv_mutex_lock_pf_mutex(ldv_mutex_lock_12_~ldv_func_arg1#1.base, ldv_mutex_lock_12_~ldv_func_arg1#1.offset); {528#false} is VALID [2022-02-20 21:44:25,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {528#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {528#false} is VALID [2022-02-20 21:44:25,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#false} assume !(1 == ~ldv_mutex_pf_mutex~0); {528#false} is VALID [2022-02-20 21:44:25,568 INFO L272 TraceCheckUtils]: 14: Hoare triple {528#false} call ldv_error(); {528#false} is VALID [2022-02-20 21:44:25,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-02-20 21:44:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:44:25,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:44:25,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795392025] [2022-02-20 21:44:25,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795392025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:44:25,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:44:25,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:44:25,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336266765] [2022-02-20 21:44:25,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:44:25,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 21:44:25,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:44:25,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:25,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:44:25,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:44:25,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:44:25,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:44:25,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:44:25,619 INFO L87 Difference]: Start difference. First operand has 524 states, 375 states have (on average 1.3706666666666667) internal successors, (514), 389 states have internal predecessors, (514), 112 states have call successors, (112), 37 states have call predecessors, (112), 37 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:29,731 INFO L93 Difference]: Finished difference Result 1439 states and 2086 transitions. [2022-02-20 21:44:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:44:29,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 21:44:29,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:44:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2086 transitions. [2022-02-20 21:44:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2086 transitions. [2022-02-20 21:44:29,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 2086 transitions. [2022-02-20 21:44:31,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2086 edges. 2086 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:44:31,735 INFO L225 Difference]: With dead ends: 1439 [2022-02-20 21:44:31,736 INFO L226 Difference]: Without dead ends: 910 [2022-02-20 21:44:31,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:44:31,765 INFO L933 BasicCegarLoop]: 1007 mSDtfsCounter, 542 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:44:31,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [542 Valid, 1684 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:44:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2022-02-20 21:44:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 896. [2022-02-20 21:44:31,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:44:31,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 910 states. Second operand has 896 states, 644 states have (on average 1.3338509316770186) internal successors, (859), 657 states have internal predecessors, (859), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2022-02-20 21:44:31,949 INFO L74 IsIncluded]: Start isIncluded. First operand 910 states. Second operand has 896 states, 644 states have (on average 1.3338509316770186) internal successors, (859), 657 states have internal predecessors, (859), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2022-02-20 21:44:31,953 INFO L87 Difference]: Start difference. First operand 910 states. Second operand has 896 states, 644 states have (on average 1.3338509316770186) internal successors, (859), 657 states have internal predecessors, (859), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2022-02-20 21:44:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:32,087 INFO L93 Difference]: Finished difference Result 910 states and 1243 transitions. [2022-02-20 21:44:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1243 transitions. [2022-02-20 21:44:32,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:44:32,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:44:32,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 896 states, 644 states have (on average 1.3338509316770186) internal successors, (859), 657 states have internal predecessors, (859), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) Second operand 910 states. [2022-02-20 21:44:32,129 INFO L87 Difference]: Start difference. First operand has 896 states, 644 states have (on average 1.3338509316770186) internal successors, (859), 657 states have internal predecessors, (859), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) Second operand 910 states. [2022-02-20 21:44:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:32,206 INFO L93 Difference]: Finished difference Result 910 states and 1243 transitions. [2022-02-20 21:44:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1243 transitions. [2022-02-20 21:44:32,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:44:32,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:44:32,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:44:32,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:44:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 644 states have (on average 1.3338509316770186) internal successors, (859), 657 states have internal predecessors, (859), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2022-02-20 21:44:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1227 transitions. [2022-02-20 21:44:32,329 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1227 transitions. Word has length 16 [2022-02-20 21:44:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:44:32,329 INFO L470 AbstractCegarLoop]: Abstraction has 896 states and 1227 transitions. [2022-02-20 21:44:32,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1227 transitions. [2022-02-20 21:44:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 21:44:32,333 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:44:32,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:44:32,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:44:32,333 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:44:32,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:44:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash -395988183, now seen corresponding path program 1 times [2022-02-20 21:44:32,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:44:32,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700696956] [2022-02-20 21:44:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:44:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:44:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:32,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {5684#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {5686#(= ~disable~0 0)} is VALID [2022-02-20 21:44:32,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {5686#(= ~disable~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {5686#(= ~disable~0 0)} is VALID [2022-02-20 21:44:32,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {5686#(= ~disable~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {5686#(= ~disable~0 0)} is VALID [2022-02-20 21:44:32,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {5686#(= ~disable~0 0)} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {5686#(= ~disable~0 0)} is VALID [2022-02-20 21:44:32,470 INFO L290 TraceCheckUtils]: 4: Hoare triple {5686#(= ~disable~0 0)} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {5686#(= ~disable~0 0)} is VALID [2022-02-20 21:44:32,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {5686#(= ~disable~0 0)} assume main_#t~switch306#1; {5686#(= ~disable~0 0)} is VALID [2022-02-20 21:44:32,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {5686#(= ~disable~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {5686#(= ~disable~0 0)} is VALID [2022-02-20 21:44:32,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {5686#(= ~disable~0 0)} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {5686#(= ~disable~0 0)} is VALID [2022-02-20 21:44:32,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {5686#(= ~disable~0 0)} assume main_#t~switch318#1; {5686#(= ~disable~0 0)} is VALID [2022-02-20 21:44:32,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {5686#(= ~disable~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {5686#(= ~disable~0 0)} is VALID [2022-02-20 21:44:32,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {5686#(= ~disable~0 0)} assume 0 != ~disable~0;pf_init_#res#1 := -22; {5685#false} is VALID [2022-02-20 21:44:32,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {5685#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {5685#false} is VALID [2022-02-20 21:44:32,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {5685#false} assume 0 == ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1; {5685#false} is VALID [2022-02-20 21:44:32,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {5685#false} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {5685#false} is VALID [2022-02-20 21:44:32,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {5685#false} assume { :begin_inline_ldv_check_final_state } true; {5685#false} is VALID [2022-02-20 21:44:32,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {5685#false} assume !(1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0); {5685#false} is VALID [2022-02-20 21:44:32,475 INFO L272 TraceCheckUtils]: 16: Hoare triple {5685#false} call ldv_error(); {5685#false} is VALID [2022-02-20 21:44:32,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {5685#false} assume !false; {5685#false} is VALID [2022-02-20 21:44:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:44:32,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:44:32,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700696956] [2022-02-20 21:44:32,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700696956] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:44:32,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:44:32,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 21:44:32,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858025832] [2022-02-20 21:44:32,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:44:32,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 21:44:32,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:44:32,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:32,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:44:32,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:44:32,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:44:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:44:32,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:44:32,503 INFO L87 Difference]: Start difference. First operand 896 states and 1227 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:35,107 INFO L93 Difference]: Finished difference Result 1789 states and 2451 transitions. [2022-02-20 21:44:35,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:44:35,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 21:44:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:44:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1403 transitions. [2022-02-20 21:44:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1403 transitions. [2022-02-20 21:44:35,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1403 transitions. [2022-02-20 21:44:36,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1403 edges. 1403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:44:36,460 INFO L225 Difference]: With dead ends: 1789 [2022-02-20 21:44:36,460 INFO L226 Difference]: Without dead ends: 896 [2022-02-20 21:44:36,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:44:36,481 INFO L933 BasicCegarLoop]: 701 mSDtfsCounter, 692 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:44:36,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 701 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:44:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-02-20 21:44:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2022-02-20 21:44:36,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:44:36,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 896 states. Second operand has 896 states, 644 states have (on average 1.3307453416149069) internal successors, (857), 657 states have internal predecessors, (857), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2022-02-20 21:44:36,542 INFO L74 IsIncluded]: Start isIncluded. First operand 896 states. Second operand has 896 states, 644 states have (on average 1.3307453416149069) internal successors, (857), 657 states have internal predecessors, (857), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2022-02-20 21:44:36,577 INFO L87 Difference]: Start difference. First operand 896 states. Second operand has 896 states, 644 states have (on average 1.3307453416149069) internal successors, (857), 657 states have internal predecessors, (857), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2022-02-20 21:44:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:36,639 INFO L93 Difference]: Finished difference Result 896 states and 1225 transitions. [2022-02-20 21:44:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1225 transitions. [2022-02-20 21:44:36,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:44:36,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:44:36,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 896 states, 644 states have (on average 1.3307453416149069) internal successors, (857), 657 states have internal predecessors, (857), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) Second operand 896 states. [2022-02-20 21:44:36,659 INFO L87 Difference]: Start difference. First operand has 896 states, 644 states have (on average 1.3307453416149069) internal successors, (857), 657 states have internal predecessors, (857), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) Second operand 896 states. [2022-02-20 21:44:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:36,727 INFO L93 Difference]: Finished difference Result 896 states and 1225 transitions. [2022-02-20 21:44:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1225 transitions. [2022-02-20 21:44:36,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:44:36,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:44:36,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:44:36,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:44:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 644 states have (on average 1.3307453416149069) internal successors, (857), 657 states have internal predecessors, (857), 187 states have call successors, (187), 65 states have call predecessors, (187), 64 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2022-02-20 21:44:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1225 transitions. [2022-02-20 21:44:36,796 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1225 transitions. Word has length 18 [2022-02-20 21:44:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:44:36,797 INFO L470 AbstractCegarLoop]: Abstraction has 896 states and 1225 transitions. [2022-02-20 21:44:36,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1225 transitions. [2022-02-20 21:44:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 21:44:36,801 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:44:36,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:44:36,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:44:36,801 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:44:36,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:44:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1972979261, now seen corresponding path program 1 times [2022-02-20 21:44:36,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:44:36,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62686325] [2022-02-20 21:44:36,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:44:36,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:44:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:36,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 21:44:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:36,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {11305#true} ~arg0 := #in~arg0;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {11305#true} is VALID [2022-02-20 21:44:36,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {11305#true} assume true; {11305#true} is VALID [2022-02-20 21:44:36,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11305#true} {11306#false} #1358#return; {11306#false} is VALID [2022-02-20 21:44:36,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {11305#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {11305#true} is VALID [2022-02-20 21:44:36,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {11305#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {11305#true} is VALID [2022-02-20 21:44:36,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {11305#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {11307#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:44:36,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {11307#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {11307#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:44:36,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {11307#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {11307#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:44:36,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {11307#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch306#1; {11307#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:44:36,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {11307#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {11307#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:44:36,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {11307#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch318#1; {11307#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:44:36,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {11307#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_pf_exit } true;havoc pf_exit_#t~mem301#1, pf_exit_#t~mem302#1.base, pf_exit_#t~mem302#1.offset, pf_exit_#t~mem303#1.base, pf_exit_#t~mem303#1.offset, pf_exit_#t~mem304#1.base, pf_exit_#t~mem304#1.offset, pf_exit_~pf~7#1.base, pf_exit_~pf~7#1.offset, pf_exit_~unit~3#1;havoc pf_exit_~pf~7#1.base, pf_exit_~pf~7#1.offset;havoc pf_exit_~unit~3#1; {11306#false} is VALID [2022-02-20 21:44:36,894 INFO L272 TraceCheckUtils]: 9: Hoare triple {11306#false} call unregister_blkdev(~major~0, ~name~0.base, ~name~0.offset); {11305#true} is VALID [2022-02-20 21:44:36,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {11305#true} ~arg0 := #in~arg0;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {11305#true} is VALID [2022-02-20 21:44:36,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {11305#true} assume true; {11305#true} is VALID [2022-02-20 21:44:36,897 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11305#true} {11306#false} #1358#return; {11306#false} is VALID [2022-02-20 21:44:36,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {11306#false} pf_exit_~pf~7#1.base, pf_exit_~pf~7#1.offset := ~#units~0.base, ~#units~0.offset;pf_exit_~unit~3#1 := 0; {11306#false} is VALID [2022-02-20 21:44:36,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {11306#false} assume !(pf_exit_~unit~3#1 <= 3); {11306#false} is VALID [2022-02-20 21:44:36,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {11306#false} assume { :begin_inline_blk_cleanup_queue } true;blk_cleanup_queue_#in~arg0#1.base, blk_cleanup_queue_#in~arg0#1.offset := ~pf_queue~0.base, ~pf_queue~0.offset;havoc blk_cleanup_queue_~arg0#1.base, blk_cleanup_queue_~arg0#1.offset;blk_cleanup_queue_~arg0#1.base, blk_cleanup_queue_~arg0#1.offset := blk_cleanup_queue_#in~arg0#1.base, blk_cleanup_queue_#in~arg0#1.offset; {11306#false} is VALID [2022-02-20 21:44:36,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {11306#false} assume { :end_inline_blk_cleanup_queue } true; {11306#false} is VALID [2022-02-20 21:44:36,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {11306#false} assume { :end_inline_pf_exit } true;~ldv_state_variable_0~0 := 2; {11306#false} is VALID [2022-02-20 21:44:36,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {11306#false} assume { :begin_inline_ldv_check_final_state } true; {11306#false} is VALID [2022-02-20 21:44:36,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {11306#false} assume !(1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0); {11306#false} is VALID [2022-02-20 21:44:36,900 INFO L272 TraceCheckUtils]: 20: Hoare triple {11306#false} call ldv_error(); {11306#false} is VALID [2022-02-20 21:44:36,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {11306#false} assume !false; {11306#false} is VALID [2022-02-20 21:44:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:44:36,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:44:36,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62686325] [2022-02-20 21:44:36,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62686325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:44:36,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:44:36,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:44:36,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441579876] [2022-02-20 21:44:36,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:44:36,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-20 21:44:36,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:44:36,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:44:36,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:44:36,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:44:36,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:44:36,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:44:36,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:44:36,937 INFO L87 Difference]: Start difference. First operand 896 states and 1225 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:44:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:42,370 INFO L93 Difference]: Finished difference Result 2152 states and 2933 transitions. [2022-02-20 21:44:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:44:42,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-20 21:44:42,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:44:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:44:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 21:44:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:44:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 21:44:42,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1859 transitions. [2022-02-20 21:44:43,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:44:43,779 INFO L225 Difference]: With dead ends: 2152 [2022-02-20 21:44:43,780 INFO L226 Difference]: Without dead ends: 1259 [2022-02-20 21:44:43,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:44:43,783 INFO L933 BasicCegarLoop]: 1124 mSDtfsCounter, 658 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:44:43,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [658 Valid, 1606 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:44:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-02-20 21:44:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1235. [2022-02-20 21:44:43,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:44:43,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1259 states. Second operand has 1235 states, 881 states have (on average 1.3280363223609535) internal successors, (1170), 898 states have internal predecessors, (1170), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:43,813 INFO L74 IsIncluded]: Start isIncluded. First operand 1259 states. Second operand has 1235 states, 881 states have (on average 1.3280363223609535) internal successors, (1170), 898 states have internal predecessors, (1170), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:43,816 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand has 1235 states, 881 states have (on average 1.3280363223609535) internal successors, (1170), 898 states have internal predecessors, (1170), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:43,892 INFO L93 Difference]: Finished difference Result 1259 states and 1705 transitions. [2022-02-20 21:44:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1705 transitions. [2022-02-20 21:44:43,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:44:43,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:44:43,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 1235 states, 881 states have (on average 1.3280363223609535) internal successors, (1170), 898 states have internal predecessors, (1170), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) Second operand 1259 states. [2022-02-20 21:44:43,901 INFO L87 Difference]: Start difference. First operand has 1235 states, 881 states have (on average 1.3280363223609535) internal successors, (1170), 898 states have internal predecessors, (1170), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) Second operand 1259 states. [2022-02-20 21:44:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:43,959 INFO L93 Difference]: Finished difference Result 1259 states and 1705 transitions. [2022-02-20 21:44:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1705 transitions. [2022-02-20 21:44:43,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:44:43,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:44:43,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:44:43,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:44:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 881 states have (on average 1.3280363223609535) internal successors, (1170), 898 states have internal predecessors, (1170), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1680 transitions. [2022-02-20 21:44:44,054 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1680 transitions. Word has length 22 [2022-02-20 21:44:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:44:44,054 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 1680 transitions. [2022-02-20 21:44:44,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:44:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1680 transitions. [2022-02-20 21:44:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 21:44:44,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:44:44,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:44:44,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:44:44,059 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:44:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:44:44,065 INFO L85 PathProgramCache]: Analyzing trace with hash -184420453, now seen corresponding path program 1 times [2022-02-20 21:44:44,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:44:44,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476095181] [2022-02-20 21:44:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:44:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:44:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:44,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {18614#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {18614#true} is VALID [2022-02-20 21:44:44,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {18614#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {18614#true} is VALID [2022-02-20 21:44:44,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {18614#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {18614#true} is VALID [2022-02-20 21:44:44,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {18614#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {18614#true} is VALID [2022-02-20 21:44:44,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {18614#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {18614#true} is VALID [2022-02-20 21:44:44,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {18614#true} assume main_#t~switch306#1; {18614#true} is VALID [2022-02-20 21:44:44,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {18614#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {18614#true} is VALID [2022-02-20 21:44:44,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {18614#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {18614#true} is VALID [2022-02-20 21:44:44,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {18614#true} assume main_#t~switch318#1; {18614#true} is VALID [2022-02-20 21:44:44,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {18614#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {18614#true} is VALID [2022-02-20 21:44:44,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {18614#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {18616#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:44:44,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {18616#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume !(pf_init_units_~unit~0#1 <= 3); {18615#false} is VALID [2022-02-20 21:44:44,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {18615#false} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {18615#false} is VALID [2022-02-20 21:44:44,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {18615#false} assume !(0 == ~pf_drive_count~0);pf_detect_~unit~1#1 := 0; {18615#false} is VALID [2022-02-20 21:44:44,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {18615#false} assume !(pf_detect_~unit~1#1 <= 3); {18615#false} is VALID [2022-02-20 21:44:44,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {18615#false} assume 0 != pf_detect_~k~3#1;pf_detect_#res#1 := 0; {18615#false} is VALID [2022-02-20 21:44:44,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {18615#false} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {18615#false} is VALID [2022-02-20 21:44:44,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {18615#false} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {18615#false} is VALID [2022-02-20 21:44:44,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {18615#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {18615#false} is VALID [2022-02-20 21:44:44,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {18615#false} assume 0 == ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1; {18615#false} is VALID [2022-02-20 21:44:44,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {18615#false} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {18615#false} is VALID [2022-02-20 21:44:44,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {18615#false} assume { :begin_inline_ldv_check_final_state } true; {18615#false} is VALID [2022-02-20 21:44:44,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {18615#false} assume !(1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0); {18615#false} is VALID [2022-02-20 21:44:44,135 INFO L272 TraceCheckUtils]: 23: Hoare triple {18615#false} call ldv_error(); {18615#false} is VALID [2022-02-20 21:44:44,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {18615#false} assume !false; {18615#false} is VALID [2022-02-20 21:44:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:44:44,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:44:44,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476095181] [2022-02-20 21:44:44,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476095181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:44:44,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:44:44,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:44:44,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806220743] [2022-02-20 21:44:44,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:44:44,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 21:44:44,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:44:44,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:44,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:44:44,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:44:44,172 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:44:44,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:44:44,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:44:44,173 INFO L87 Difference]: Start difference. First operand 1235 states and 1680 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:47,707 INFO L93 Difference]: Finished difference Result 2483 states and 3381 transitions. [2022-02-20 21:44:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:44:47,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 21:44:47,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:44:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1413 transitions. [2022-02-20 21:44:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1413 transitions. [2022-02-20 21:44:47,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1413 transitions. [2022-02-20 21:44:48,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1413 edges. 1413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:44:48,789 INFO L225 Difference]: With dead ends: 2483 [2022-02-20 21:44:48,790 INFO L226 Difference]: Without dead ends: 1251 [2022-02-20 21:44:48,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:44:48,794 INFO L933 BasicCegarLoop]: 698 mSDtfsCounter, 10 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:44:48,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1394 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:44:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2022-02-20 21:44:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1237. [2022-02-20 21:44:48,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:44:48,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1251 states. Second operand has 1237 states, 883 states have (on average 1.3272933182332955) internal successors, (1172), 900 states have internal predecessors, (1172), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:48,825 INFO L74 IsIncluded]: Start isIncluded. First operand 1251 states. Second operand has 1237 states, 883 states have (on average 1.3272933182332955) internal successors, (1172), 900 states have internal predecessors, (1172), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:48,828 INFO L87 Difference]: Start difference. First operand 1251 states. Second operand has 1237 states, 883 states have (on average 1.3272933182332955) internal successors, (1172), 900 states have internal predecessors, (1172), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:48,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:48,884 INFO L93 Difference]: Finished difference Result 1251 states and 1702 transitions. [2022-02-20 21:44:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1702 transitions. [2022-02-20 21:44:48,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:44:48,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:44:48,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 1237 states, 883 states have (on average 1.3272933182332955) internal successors, (1172), 900 states have internal predecessors, (1172), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) Second operand 1251 states. [2022-02-20 21:44:48,893 INFO L87 Difference]: Start difference. First operand has 1237 states, 883 states have (on average 1.3272933182332955) internal successors, (1172), 900 states have internal predecessors, (1172), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) Second operand 1251 states. [2022-02-20 21:44:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:48,949 INFO L93 Difference]: Finished difference Result 1251 states and 1702 transitions. [2022-02-20 21:44:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1702 transitions. [2022-02-20 21:44:48,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:44:48,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:44:48,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:44:48,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:44:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 883 states have (on average 1.3272933182332955) internal successors, (1172), 900 states have internal predecessors, (1172), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1682 transitions. [2022-02-20 21:44:49,032 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1682 transitions. Word has length 25 [2022-02-20 21:44:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:44:49,032 INFO L470 AbstractCegarLoop]: Abstraction has 1237 states and 1682 transitions. [2022-02-20 21:44:49,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1682 transitions. [2022-02-20 21:44:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 21:44:49,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:44:49,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:44:49,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:44:49,034 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:44:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:44:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1602018988, now seen corresponding path program 1 times [2022-02-20 21:44:49,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:44:49,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624876862] [2022-02-20 21:44:49,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:44:49,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:44:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:49,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {26356#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {26356#true} is VALID [2022-02-20 21:44:49,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {26356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {26356#true} is VALID [2022-02-20 21:44:49,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {26356#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {26356#true} is VALID [2022-02-20 21:44:49,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {26356#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {26356#true} is VALID [2022-02-20 21:44:49,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {26356#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {26356#true} is VALID [2022-02-20 21:44:49,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {26356#true} assume main_#t~switch306#1; {26356#true} is VALID [2022-02-20 21:44:49,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {26356#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {26356#true} is VALID [2022-02-20 21:44:49,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {26356#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {26356#true} is VALID [2022-02-20 21:44:49,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {26356#true} assume main_#t~switch318#1; {26356#true} is VALID [2022-02-20 21:44:49,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {26356#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {26356#true} is VALID [2022-02-20 21:44:49,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {26356#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {26358#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:44:49,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {26358#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume pf_init_units_~unit~0#1 <= 3; {26358#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:44:49,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {26358#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {26358#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:44:49,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {26358#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {26358#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:44:49,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {26358#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {26359#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} is VALID [2022-02-20 21:44:49,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {26359#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} assume !(pf_init_units_~unit~0#1 <= 3); {26357#false} is VALID [2022-02-20 21:44:49,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {26357#false} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {26357#false} is VALID [2022-02-20 21:44:49,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {26357#false} assume !(0 == ~pf_drive_count~0);pf_detect_~unit~1#1 := 0; {26357#false} is VALID [2022-02-20 21:44:49,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {26357#false} assume !(pf_detect_~unit~1#1 <= 3); {26357#false} is VALID [2022-02-20 21:44:49,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {26357#false} assume 0 != pf_detect_~k~3#1;pf_detect_#res#1 := 0; {26357#false} is VALID [2022-02-20 21:44:49,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {26357#false} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {26357#false} is VALID [2022-02-20 21:44:49,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {26357#false} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {26357#false} is VALID [2022-02-20 21:44:49,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {26357#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {26357#false} is VALID [2022-02-20 21:44:49,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {26357#false} assume 0 == ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1; {26357#false} is VALID [2022-02-20 21:44:49,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {26357#false} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {26357#false} is VALID [2022-02-20 21:44:49,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {26357#false} assume { :begin_inline_ldv_check_final_state } true; {26357#false} is VALID [2022-02-20 21:44:49,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {26357#false} assume !(1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0); {26357#false} is VALID [2022-02-20 21:44:49,141 INFO L272 TraceCheckUtils]: 27: Hoare triple {26357#false} call ldv_error(); {26357#false} is VALID [2022-02-20 21:44:49,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {26357#false} assume !false; {26357#false} is VALID [2022-02-20 21:44:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:44:49,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:44:49,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624876862] [2022-02-20 21:44:49,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624876862] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:44:49,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004694724] [2022-02-20 21:44:49,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:44:49,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:44:49,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:44:49,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:44:49,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 21:44:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:49,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 21:44:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:49,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:44:49,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {26356#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {26356#true} is VALID [2022-02-20 21:44:49,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {26356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {26356#true} is VALID [2022-02-20 21:44:49,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {26356#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {26356#true} is VALID [2022-02-20 21:44:49,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {26356#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {26356#true} is VALID [2022-02-20 21:44:49,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {26356#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {26356#true} is VALID [2022-02-20 21:44:49,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {26356#true} assume main_#t~switch306#1; {26356#true} is VALID [2022-02-20 21:44:49,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {26356#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {26356#true} is VALID [2022-02-20 21:44:49,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {26356#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {26356#true} is VALID [2022-02-20 21:44:49,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {26356#true} assume main_#t~switch318#1; {26356#true} is VALID [2022-02-20 21:44:49,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {26356#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {26356#true} is VALID [2022-02-20 21:44:49,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {26356#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {26356#true} is VALID [2022-02-20 21:44:49,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {26356#true} assume pf_init_units_~unit~0#1 <= 3; {26356#true} is VALID [2022-02-20 21:44:49,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {26356#true} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {26356#true} is VALID [2022-02-20 21:44:49,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {26356#true} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {26356#true} is VALID [2022-02-20 21:44:49,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {26356#true} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {26356#true} is VALID [2022-02-20 21:44:49,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {26356#true} assume !(pf_init_units_~unit~0#1 <= 3); {26356#true} is VALID [2022-02-20 21:44:49,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {26356#true} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {26356#true} is VALID [2022-02-20 21:44:49,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {26356#true} assume !(0 == ~pf_drive_count~0);pf_detect_~unit~1#1 := 0; {26414#(<= |ULTIMATE.start_pf_detect_~unit~1#1| 0)} is VALID [2022-02-20 21:44:49,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {26414#(<= |ULTIMATE.start_pf_detect_~unit~1#1| 0)} assume !(pf_detect_~unit~1#1 <= 3); {26357#false} is VALID [2022-02-20 21:44:49,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {26357#false} assume 0 != pf_detect_~k~3#1;pf_detect_#res#1 := 0; {26357#false} is VALID [2022-02-20 21:44:49,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {26357#false} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {26357#false} is VALID [2022-02-20 21:44:49,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {26357#false} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {26357#false} is VALID [2022-02-20 21:44:49,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {26357#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {26357#false} is VALID [2022-02-20 21:44:49,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {26357#false} assume 0 == ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1; {26357#false} is VALID [2022-02-20 21:44:49,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {26357#false} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {26357#false} is VALID [2022-02-20 21:44:49,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {26357#false} assume { :begin_inline_ldv_check_final_state } true; {26357#false} is VALID [2022-02-20 21:44:49,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {26357#false} assume !(1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0); {26357#false} is VALID [2022-02-20 21:44:49,500 INFO L272 TraceCheckUtils]: 27: Hoare triple {26357#false} call ldv_error(); {26357#false} is VALID [2022-02-20 21:44:49,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {26357#false} assume !false; {26357#false} is VALID [2022-02-20 21:44:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 21:44:49,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:44:49,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004694724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:44:49,501 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:44:49,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 21:44:49,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757756250] [2022-02-20 21:44:49,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:44:49,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 21:44:49,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:44:49,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:49,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:44:49,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:44:49,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:44:49,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:44:49,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:44:49,534 INFO L87 Difference]: Start difference. First operand 1237 states and 1682 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:53,235 INFO L93 Difference]: Finished difference Result 2509 states and 3421 transitions. [2022-02-20 21:44:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:44:53,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 21:44:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:44:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1431 transitions. [2022-02-20 21:44:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1431 transitions. [2022-02-20 21:44:53,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1431 transitions. [2022-02-20 21:44:54,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1431 edges. 1431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:44:54,314 INFO L225 Difference]: With dead ends: 2509 [2022-02-20 21:44:54,314 INFO L226 Difference]: Without dead ends: 1275 [2022-02-20 21:44:54,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:44:54,319 INFO L933 BasicCegarLoop]: 706 mSDtfsCounter, 16 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:44:54,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 1399 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:44:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-02-20 21:44:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1241. [2022-02-20 21:44:54,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:44:54,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1275 states. Second operand has 1241 states, 887 states have (on average 1.3258173618940248) internal successors, (1176), 904 states have internal predecessors, (1176), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:54,359 INFO L74 IsIncluded]: Start isIncluded. First operand 1275 states. Second operand has 1241 states, 887 states have (on average 1.3258173618940248) internal successors, (1176), 904 states have internal predecessors, (1176), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:54,360 INFO L87 Difference]: Start difference. First operand 1275 states. Second operand has 1241 states, 887 states have (on average 1.3258173618940248) internal successors, (1176), 904 states have internal predecessors, (1176), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:54,411 INFO L93 Difference]: Finished difference Result 1275 states and 1738 transitions. [2022-02-20 21:44:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1738 transitions. [2022-02-20 21:44:54,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:44:54,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:44:54,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 1241 states, 887 states have (on average 1.3258173618940248) internal successors, (1176), 904 states have internal predecessors, (1176), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) Second operand 1275 states. [2022-02-20 21:44:54,418 INFO L87 Difference]: Start difference. First operand has 1241 states, 887 states have (on average 1.3258173618940248) internal successors, (1176), 904 states have internal predecessors, (1176), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) Second operand 1275 states. [2022-02-20 21:44:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:54,471 INFO L93 Difference]: Finished difference Result 1275 states and 1738 transitions. [2022-02-20 21:44:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1738 transitions. [2022-02-20 21:44:54,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:44:54,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:44:54,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:44:54,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:44:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 887 states have (on average 1.3258173618940248) internal successors, (1176), 904 states have internal predecessors, (1176), 258 states have call successors, (258), 96 states have call predecessors, (258), 95 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2022-02-20 21:44:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1686 transitions. [2022-02-20 21:44:54,555 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1686 transitions. Word has length 29 [2022-02-20 21:44:54,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:44:54,556 INFO L470 AbstractCegarLoop]: Abstraction has 1241 states and 1686 transitions. [2022-02-20 21:44:54,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:44:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1686 transitions. [2022-02-20 21:44:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 21:44:54,557 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:44:54,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:44:54,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 21:44:54,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:44:54,780 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:44:54,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:44:54,781 INFO L85 PathProgramCache]: Analyzing trace with hash -400370473, now seen corresponding path program 1 times [2022-02-20 21:44:54,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:44:54,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914326387] [2022-02-20 21:44:54,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:44:54,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:44:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:44:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:54,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {34282#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {34282#true} is VALID [2022-02-20 21:44:54,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {34282#true} assume true; {34282#true} is VALID [2022-02-20 21:44:54,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34282#true} {34283#false} #1364#return; {34283#false} is VALID [2022-02-20 21:44:54,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {34282#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {34282#true} is VALID [2022-02-20 21:44:54,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {34282#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {34282#true} is VALID [2022-02-20 21:44:54,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {34282#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {34282#true} is VALID [2022-02-20 21:44:54,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {34282#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {34282#true} is VALID [2022-02-20 21:44:54,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {34282#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {34282#true} is VALID [2022-02-20 21:44:54,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {34282#true} assume main_#t~switch306#1; {34282#true} is VALID [2022-02-20 21:44:54,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {34282#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {34282#true} is VALID [2022-02-20 21:44:54,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {34282#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {34282#true} is VALID [2022-02-20 21:44:54,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {34282#true} assume main_#t~switch318#1; {34282#true} is VALID [2022-02-20 21:44:54,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {34282#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {34282#true} is VALID [2022-02-20 21:44:54,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {34282#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {34284#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:44:54,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {34284#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume pf_init_units_~unit~0#1 <= 3; {34284#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:44:54,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {34284#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {34284#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:44:54,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {34284#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {34284#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:44:54,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {34284#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {34285#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} is VALID [2022-02-20 21:44:54,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {34285#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} assume !(pf_init_units_~unit~0#1 <= 3); {34283#false} is VALID [2022-02-20 21:44:54,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {34283#false} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {34283#false} is VALID [2022-02-20 21:44:54,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {34283#false} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {34283#false} is VALID [2022-02-20 21:44:54,917 INFO L272 TraceCheckUtils]: 18: Hoare triple {34283#false} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {34282#true} is VALID [2022-02-20 21:44:54,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {34282#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {34282#true} is VALID [2022-02-20 21:44:54,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {34282#true} assume true; {34282#true} is VALID [2022-02-20 21:44:54,917 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {34282#true} {34283#false} #1364#return; {34283#false} is VALID [2022-02-20 21:44:54,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {34283#false} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {34283#false} is VALID [2022-02-20 21:44:54,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {34283#false} assume !(0 != pf_detect_~tmp___0~8#1); {34283#false} is VALID [2022-02-20 21:44:54,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {34283#false} assume 0 != pf_detect_~k~3#1;pf_detect_#res#1 := 0; {34283#false} is VALID [2022-02-20 21:44:54,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {34283#false} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {34283#false} is VALID [2022-02-20 21:44:54,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {34283#false} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {34283#false} is VALID [2022-02-20 21:44:54,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {34283#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {34283#false} is VALID [2022-02-20 21:44:54,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {34283#false} assume 0 == ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1; {34283#false} is VALID [2022-02-20 21:44:54,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {34283#false} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {34283#false} is VALID [2022-02-20 21:44:54,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {34283#false} assume { :begin_inline_ldv_check_final_state } true; {34283#false} is VALID [2022-02-20 21:44:54,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {34283#false} assume !(1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0); {34283#false} is VALID [2022-02-20 21:44:54,925 INFO L272 TraceCheckUtils]: 32: Hoare triple {34283#false} call ldv_error(); {34283#false} is VALID [2022-02-20 21:44:54,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {34283#false} assume !false; {34283#false} is VALID [2022-02-20 21:44:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:44:54,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:44:54,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914326387] [2022-02-20 21:44:54,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914326387] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:44:54,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709811888] [2022-02-20 21:44:54,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:44:54,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:44:54,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:44:54,929 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:44:54,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 21:44:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:55,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:44:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:44:55,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:44:55,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {34282#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {34282#true} is VALID [2022-02-20 21:44:55,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {34282#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {34282#true} is VALID [2022-02-20 21:44:55,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {34282#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {34282#true} is VALID [2022-02-20 21:44:55,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {34282#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {34282#true} is VALID [2022-02-20 21:44:55,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {34282#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {34282#true} is VALID [2022-02-20 21:44:55,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {34282#true} assume main_#t~switch306#1; {34282#true} is VALID [2022-02-20 21:44:55,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {34282#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {34282#true} is VALID [2022-02-20 21:44:55,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {34282#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {34282#true} is VALID [2022-02-20 21:44:55,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {34282#true} assume main_#t~switch318#1; {34282#true} is VALID [2022-02-20 21:44:55,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {34282#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {34282#true} is VALID [2022-02-20 21:44:55,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {34282#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {34282#true} is VALID [2022-02-20 21:44:55,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {34282#true} assume pf_init_units_~unit~0#1 <= 3; {34282#true} is VALID [2022-02-20 21:44:55,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {34282#true} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {34282#true} is VALID [2022-02-20 21:44:55,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {34282#true} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {34282#true} is VALID [2022-02-20 21:44:55,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {34282#true} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {34282#true} is VALID [2022-02-20 21:44:55,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {34282#true} assume !(pf_init_units_~unit~0#1 <= 3); {34282#true} is VALID [2022-02-20 21:44:55,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {34282#true} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {34340#(= 0 |ULTIMATE.start_pf_detect_~k~3#1|)} is VALID [2022-02-20 21:44:55,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {34340#(= 0 |ULTIMATE.start_pf_detect_~k~3#1|)} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {34340#(= 0 |ULTIMATE.start_pf_detect_~k~3#1|)} is VALID [2022-02-20 21:44:55,283 INFO L272 TraceCheckUtils]: 18: Hoare triple {34340#(= 0 |ULTIMATE.start_pf_detect_~k~3#1|)} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {34282#true} is VALID [2022-02-20 21:44:55,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {34282#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {34282#true} is VALID [2022-02-20 21:44:55,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {34282#true} assume true; {34282#true} is VALID [2022-02-20 21:44:55,285 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {34282#true} {34340#(= 0 |ULTIMATE.start_pf_detect_~k~3#1|)} #1364#return; {34340#(= 0 |ULTIMATE.start_pf_detect_~k~3#1|)} is VALID [2022-02-20 21:44:55,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {34340#(= 0 |ULTIMATE.start_pf_detect_~k~3#1|)} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {34340#(= 0 |ULTIMATE.start_pf_detect_~k~3#1|)} is VALID [2022-02-20 21:44:55,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {34340#(= 0 |ULTIMATE.start_pf_detect_~k~3#1|)} assume !(0 != pf_detect_~tmp___0~8#1); {34340#(= 0 |ULTIMATE.start_pf_detect_~k~3#1|)} is VALID [2022-02-20 21:44:55,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {34340#(= 0 |ULTIMATE.start_pf_detect_~k~3#1|)} assume 0 != pf_detect_~k~3#1;pf_detect_#res#1 := 0; {34283#false} is VALID [2022-02-20 21:44:55,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {34283#false} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {34283#false} is VALID [2022-02-20 21:44:55,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {34283#false} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {34283#false} is VALID [2022-02-20 21:44:55,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {34283#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {34283#false} is VALID [2022-02-20 21:44:55,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {34283#false} assume 0 == ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1; {34283#false} is VALID [2022-02-20 21:44:55,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {34283#false} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {34283#false} is VALID [2022-02-20 21:44:55,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {34283#false} assume { :begin_inline_ldv_check_final_state } true; {34283#false} is VALID [2022-02-20 21:44:55,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {34283#false} assume !(1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0); {34283#false} is VALID [2022-02-20 21:44:55,287 INFO L272 TraceCheckUtils]: 32: Hoare triple {34283#false} call ldv_error(); {34283#false} is VALID [2022-02-20 21:44:55,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {34283#false} assume !false; {34283#false} is VALID [2022-02-20 21:44:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 21:44:55,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:44:55,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709811888] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:44:55,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:44:55,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 21:44:55,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981753824] [2022-02-20 21:44:55,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:44:55,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 21:44:55,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:44:55,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:44:55,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:44:55,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:44:55,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:44:55,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:44:55,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:44:55,325 INFO L87 Difference]: Start difference. First operand 1241 states and 1686 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:44:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:44:59,693 INFO L93 Difference]: Finished difference Result 2783 states and 3848 transitions. [2022-02-20 21:44:59,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:44:59,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 21:44:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:44:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:44:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1635 transitions. [2022-02-20 21:44:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:44:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1635 transitions. [2022-02-20 21:44:59,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1635 transitions. [2022-02-20 21:45:00,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1635 edges. 1635 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:00,988 INFO L225 Difference]: With dead ends: 2783 [2022-02-20 21:45:00,988 INFO L226 Difference]: Without dead ends: 1545 [2022-02-20 21:45:00,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:45:00,991 INFO L933 BasicCegarLoop]: 769 mSDtfsCounter, 179 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:45:00,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 1449 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:45:00,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2022-02-20 21:45:01,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1273. [2022-02-20 21:45:01,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:45:01,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1545 states. Second operand has 1273 states, 911 states have (on average 1.3282107574094402) internal successors, (1210), 928 states have internal predecessors, (1210), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:01,057 INFO L74 IsIncluded]: Start isIncluded. First operand 1545 states. Second operand has 1273 states, 911 states have (on average 1.3282107574094402) internal successors, (1210), 928 states have internal predecessors, (1210), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:01,058 INFO L87 Difference]: Start difference. First operand 1545 states. Second operand has 1273 states, 911 states have (on average 1.3282107574094402) internal successors, (1210), 928 states have internal predecessors, (1210), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:01,137 INFO L93 Difference]: Finished difference Result 1545 states and 2163 transitions. [2022-02-20 21:45:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2163 transitions. [2022-02-20 21:45:01,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:01,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:01,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 1273 states, 911 states have (on average 1.3282107574094402) internal successors, (1210), 928 states have internal predecessors, (1210), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) Second operand 1545 states. [2022-02-20 21:45:01,145 INFO L87 Difference]: Start difference. First operand has 1273 states, 911 states have (on average 1.3282107574094402) internal successors, (1210), 928 states have internal predecessors, (1210), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) Second operand 1545 states. [2022-02-20 21:45:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:01,222 INFO L93 Difference]: Finished difference Result 1545 states and 2163 transitions. [2022-02-20 21:45:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2163 transitions. [2022-02-20 21:45:01,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:01,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:01,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:45:01,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:45:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 911 states have (on average 1.3282107574094402) internal successors, (1210), 928 states have internal predecessors, (1210), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1736 transitions. [2022-02-20 21:45:01,305 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1736 transitions. Word has length 34 [2022-02-20 21:45:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:45:01,306 INFO L470 AbstractCegarLoop]: Abstraction has 1273 states and 1736 transitions. [2022-02-20 21:45:01,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:45:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1736 transitions. [2022-02-20 21:45:01,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 21:45:01,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:45:01,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:45:01,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 21:45:01,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 21:45:01,526 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:45:01,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:45:01,527 INFO L85 PathProgramCache]: Analyzing trace with hash 538936913, now seen corresponding path program 1 times [2022-02-20 21:45:01,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:45:01,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448583782] [2022-02-20 21:45:01,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:45:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:01,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:45:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:01,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {43217#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {43217#true} is VALID [2022-02-20 21:45:01,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {43217#true} assume true; {43217#true} is VALID [2022-02-20 21:45:01,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43217#true} {43218#false} #1364#return; {43218#false} is VALID [2022-02-20 21:45:01,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 21:45:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:01,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {43217#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {43217#true} is VALID [2022-02-20 21:45:01,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {43217#true} assume true; {43217#true} is VALID [2022-02-20 21:45:01,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43217#true} {43218#false} #1378#return; {43218#false} is VALID [2022-02-20 21:45:01,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {43217#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {43217#true} is VALID [2022-02-20 21:45:01,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {43217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {43217#true} is VALID [2022-02-20 21:45:01,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {43217#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {43217#true} is VALID [2022-02-20 21:45:01,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {43217#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {43217#true} is VALID [2022-02-20 21:45:01,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {43217#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {43217#true} is VALID [2022-02-20 21:45:01,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {43217#true} assume main_#t~switch306#1; {43217#true} is VALID [2022-02-20 21:45:01,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {43217#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {43217#true} is VALID [2022-02-20 21:45:01,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {43217#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {43217#true} is VALID [2022-02-20 21:45:01,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {43217#true} assume main_#t~switch318#1; {43217#true} is VALID [2022-02-20 21:45:01,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {43217#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {43217#true} is VALID [2022-02-20 21:45:01,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {43217#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {43219#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:01,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {43219#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume pf_init_units_~unit~0#1 <= 3; {43219#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:01,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {43219#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {43219#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:01,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {43219#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {43219#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:01,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {43219#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {43220#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} is VALID [2022-02-20 21:45:01,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {43220#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} assume !(pf_init_units_~unit~0#1 <= 3); {43218#false} is VALID [2022-02-20 21:45:01,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {43218#false} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {43218#false} is VALID [2022-02-20 21:45:01,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {43218#false} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {43218#false} is VALID [2022-02-20 21:45:01,627 INFO L272 TraceCheckUtils]: 18: Hoare triple {43218#false} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {43217#true} is VALID [2022-02-20 21:45:01,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {43217#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {43217#true} is VALID [2022-02-20 21:45:01,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {43217#true} assume true; {43217#true} is VALID [2022-02-20 21:45:01,628 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43217#true} {43218#false} #1364#return; {43218#false} is VALID [2022-02-20 21:45:01,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {43218#false} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {43218#false} is VALID [2022-02-20 21:45:01,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {43218#false} assume !(0 != pf_detect_~tmp___0~8#1); {43218#false} is VALID [2022-02-20 21:45:01,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {43218#false} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {43218#false} is VALID [2022-02-20 21:45:01,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {43218#false} assume pf_detect_~unit~1#1 <= 3; {43218#false} is VALID [2022-02-20 21:45:01,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {43218#false} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {43218#false} is VALID [2022-02-20 21:45:01,631 INFO L272 TraceCheckUtils]: 27: Hoare triple {43218#false} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {43217#true} is VALID [2022-02-20 21:45:01,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {43217#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {43217#true} is VALID [2022-02-20 21:45:01,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {43217#true} assume true; {43217#true} is VALID [2022-02-20 21:45:01,637 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {43217#true} {43218#false} #1378#return; {43218#false} is VALID [2022-02-20 21:45:01,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {43218#false} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {43218#false} is VALID [2022-02-20 21:45:01,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {43218#false} assume !(pf_detect_~unit~1#1 <= 3); {43218#false} is VALID [2022-02-20 21:45:01,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {43218#false} pf_detect_#res#1 := -1; {43218#false} is VALID [2022-02-20 21:45:01,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {43218#false} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {43218#false} is VALID [2022-02-20 21:45:01,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {43218#false} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {43218#false} is VALID [2022-02-20 21:45:01,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {43218#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {43218#false} is VALID [2022-02-20 21:45:01,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {43218#false} assume 0 == ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1; {43218#false} is VALID [2022-02-20 21:45:01,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {43218#false} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {43218#false} is VALID [2022-02-20 21:45:01,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {43218#false} assume { :begin_inline_ldv_check_final_state } true; {43218#false} is VALID [2022-02-20 21:45:01,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {43218#false} assume !(1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0); {43218#false} is VALID [2022-02-20 21:45:01,641 INFO L272 TraceCheckUtils]: 41: Hoare triple {43218#false} call ldv_error(); {43218#false} is VALID [2022-02-20 21:45:01,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {43218#false} assume !false; {43218#false} is VALID [2022-02-20 21:45:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 21:45:01,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:45:01,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448583782] [2022-02-20 21:45:01,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448583782] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:45:01,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046921829] [2022-02-20 21:45:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:01,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:45:01,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:45:01,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:45:01,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 21:45:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:01,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:45:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:01,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:45:02,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {43217#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {43217#true} is VALID [2022-02-20 21:45:02,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {43217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {43217#true} is VALID [2022-02-20 21:45:02,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {43217#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {43217#true} is VALID [2022-02-20 21:45:02,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {43217#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {43217#true} is VALID [2022-02-20 21:45:02,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {43217#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {43217#true} is VALID [2022-02-20 21:45:02,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {43217#true} assume main_#t~switch306#1; {43217#true} is VALID [2022-02-20 21:45:02,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {43217#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {43217#true} is VALID [2022-02-20 21:45:02,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {43217#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {43217#true} is VALID [2022-02-20 21:45:02,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {43217#true} assume main_#t~switch318#1; {43217#true} is VALID [2022-02-20 21:45:02,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {43217#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {43217#true} is VALID [2022-02-20 21:45:02,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {43217#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {43217#true} is VALID [2022-02-20 21:45:02,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {43217#true} assume pf_init_units_~unit~0#1 <= 3; {43217#true} is VALID [2022-02-20 21:45:02,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {43217#true} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {43217#true} is VALID [2022-02-20 21:45:02,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {43217#true} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {43217#true} is VALID [2022-02-20 21:45:02,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {43217#true} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {43217#true} is VALID [2022-02-20 21:45:02,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {43217#true} assume !(pf_init_units_~unit~0#1 <= 3); {43217#true} is VALID [2022-02-20 21:45:02,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {43217#true} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {43217#true} is VALID [2022-02-20 21:45:02,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {43217#true} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {43217#true} is VALID [2022-02-20 21:45:02,005 INFO L272 TraceCheckUtils]: 18: Hoare triple {43217#true} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {43217#true} is VALID [2022-02-20 21:45:02,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {43217#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {43217#true} is VALID [2022-02-20 21:45:02,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {43217#true} assume true; {43217#true} is VALID [2022-02-20 21:45:02,006 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43217#true} {43217#true} #1364#return; {43217#true} is VALID [2022-02-20 21:45:02,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {43217#true} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {43217#true} is VALID [2022-02-20 21:45:02,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {43217#true} assume !(0 != pf_detect_~tmp___0~8#1); {43217#true} is VALID [2022-02-20 21:45:02,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {43217#true} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {43217#true} is VALID [2022-02-20 21:45:02,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {43217#true} assume pf_detect_~unit~1#1 <= 3; {43217#true} is VALID [2022-02-20 21:45:02,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {43217#true} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {43217#true} is VALID [2022-02-20 21:45:02,007 INFO L272 TraceCheckUtils]: 27: Hoare triple {43217#true} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {43217#true} is VALID [2022-02-20 21:45:02,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {43217#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {43217#true} is VALID [2022-02-20 21:45:02,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {43217#true} assume true; {43217#true} is VALID [2022-02-20 21:45:02,008 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {43217#true} {43217#true} #1378#return; {43217#true} is VALID [2022-02-20 21:45:02,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {43217#true} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {43217#true} is VALID [2022-02-20 21:45:02,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {43217#true} assume !(pf_detect_~unit~1#1 <= 3); {43217#true} is VALID [2022-02-20 21:45:02,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {43217#true} pf_detect_#res#1 := -1; {43217#true} is VALID [2022-02-20 21:45:02,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {43217#true} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {43217#true} is VALID [2022-02-20 21:45:02,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {43217#true} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {43217#true} is VALID [2022-02-20 21:45:02,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {43217#true} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {43217#true} is VALID [2022-02-20 21:45:02,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {43217#true} assume 0 == ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1; {43341#(= ~ldv_retval_pf_init~0 0)} is VALID [2022-02-20 21:45:02,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {43341#(= ~ldv_retval_pf_init~0 0)} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {43218#false} is VALID [2022-02-20 21:45:02,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {43218#false} assume { :begin_inline_ldv_check_final_state } true; {43218#false} is VALID [2022-02-20 21:45:02,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {43218#false} assume !(1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0); {43218#false} is VALID [2022-02-20 21:45:02,011 INFO L272 TraceCheckUtils]: 41: Hoare triple {43218#false} call ldv_error(); {43218#false} is VALID [2022-02-20 21:45:02,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {43218#false} assume !false; {43218#false} is VALID [2022-02-20 21:45:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 21:45:02,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:45:02,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046921829] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:45:02,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:45:02,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 21:45:02,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457767164] [2022-02-20 21:45:02,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:45:02,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-02-20 21:45:02,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:45:02,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:02,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:02,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:45:02,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:45:02,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:45:02,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:45:02,050 INFO L87 Difference]: Start difference. First operand 1273 states and 1736 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:03,844 INFO L93 Difference]: Finished difference Result 1295 states and 1762 transitions. [2022-02-20 21:45:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:45:03,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-02-20 21:45:03,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:45:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2022-02-20 21:45:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2022-02-20 21:45:03,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 730 transitions. [2022-02-20 21:45:04,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 730 edges. 730 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:04,438 INFO L225 Difference]: With dead ends: 1295 [2022-02-20 21:45:04,439 INFO L226 Difference]: Without dead ends: 1284 [2022-02-20 21:45:04,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:45:04,440 INFO L933 BasicCegarLoop]: 714 mSDtfsCounter, 697 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:45:04,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [697 Valid, 727 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:45:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2022-02-20 21:45:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1273. [2022-02-20 21:45:04,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:45:04,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1284 states. Second operand has 1273 states, 911 states have (on average 1.3271130625686058) internal successors, (1209), 928 states have internal predecessors, (1209), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:04,482 INFO L74 IsIncluded]: Start isIncluded. First operand 1284 states. Second operand has 1273 states, 911 states have (on average 1.3271130625686058) internal successors, (1209), 928 states have internal predecessors, (1209), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:04,483 INFO L87 Difference]: Start difference. First operand 1284 states. Second operand has 1273 states, 911 states have (on average 1.3271130625686058) internal successors, (1209), 928 states have internal predecessors, (1209), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:04,534 INFO L93 Difference]: Finished difference Result 1284 states and 1748 transitions. [2022-02-20 21:45:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1748 transitions. [2022-02-20 21:45:04,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:04,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:04,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 1273 states, 911 states have (on average 1.3271130625686058) internal successors, (1209), 928 states have internal predecessors, (1209), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) Second operand 1284 states. [2022-02-20 21:45:04,540 INFO L87 Difference]: Start difference. First operand has 1273 states, 911 states have (on average 1.3271130625686058) internal successors, (1209), 928 states have internal predecessors, (1209), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) Second operand 1284 states. [2022-02-20 21:45:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:04,591 INFO L93 Difference]: Finished difference Result 1284 states and 1748 transitions. [2022-02-20 21:45:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1748 transitions. [2022-02-20 21:45:04,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:04,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:04,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:45:04,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:45:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 911 states have (on average 1.3271130625686058) internal successors, (1209), 928 states have internal predecessors, (1209), 266 states have call successors, (266), 96 states have call predecessors, (266), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1735 transitions. [2022-02-20 21:45:04,734 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1735 transitions. Word has length 43 [2022-02-20 21:45:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:45:04,735 INFO L470 AbstractCegarLoop]: Abstraction has 1273 states and 1735 transitions. [2022-02-20 21:45:04,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1735 transitions. [2022-02-20 21:45:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 21:45:04,736 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:45:04,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:45:04,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 21:45:04,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:45:04,957 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:45:04,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:45:04,958 INFO L85 PathProgramCache]: Analyzing trace with hash 596195215, now seen corresponding path program 1 times [2022-02-20 21:45:04,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:45:04,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961436204] [2022-02-20 21:45:04,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:04,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:45:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:05,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:45:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:05,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {49552#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {49552#true} is VALID [2022-02-20 21:45:05,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {49552#true} assume true; {49552#true} is VALID [2022-02-20 21:45:05,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49552#true} {49553#false} #1364#return; {49553#false} is VALID [2022-02-20 21:45:05,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 21:45:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:05,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {49552#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {49552#true} is VALID [2022-02-20 21:45:05,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {49552#true} assume true; {49552#true} is VALID [2022-02-20 21:45:05,063 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49552#true} {49553#false} #1378#return; {49553#false} is VALID [2022-02-20 21:45:05,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {49552#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {49552#true} is VALID [2022-02-20 21:45:05,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {49552#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {49552#true} is VALID [2022-02-20 21:45:05,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {49552#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {49552#true} is VALID [2022-02-20 21:45:05,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {49552#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {49552#true} is VALID [2022-02-20 21:45:05,064 INFO L290 TraceCheckUtils]: 4: Hoare triple {49552#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {49552#true} is VALID [2022-02-20 21:45:05,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {49552#true} assume main_#t~switch306#1; {49552#true} is VALID [2022-02-20 21:45:05,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {49552#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {49552#true} is VALID [2022-02-20 21:45:05,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {49552#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {49552#true} is VALID [2022-02-20 21:45:05,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {49552#true} assume main_#t~switch318#1; {49552#true} is VALID [2022-02-20 21:45:05,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {49552#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {49552#true} is VALID [2022-02-20 21:45:05,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {49552#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {49554#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:05,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {49554#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume pf_init_units_~unit~0#1 <= 3; {49554#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:05,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {49554#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {49554#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:05,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {49554#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {49554#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:05,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {49554#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {49555#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} is VALID [2022-02-20 21:45:05,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {49555#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} assume !(pf_init_units_~unit~0#1 <= 3); {49553#false} is VALID [2022-02-20 21:45:05,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {49553#false} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {49553#false} is VALID [2022-02-20 21:45:05,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {49553#false} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {49553#false} is VALID [2022-02-20 21:45:05,068 INFO L272 TraceCheckUtils]: 18: Hoare triple {49553#false} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {49552#true} is VALID [2022-02-20 21:45:05,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {49552#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {49552#true} is VALID [2022-02-20 21:45:05,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {49552#true} assume true; {49552#true} is VALID [2022-02-20 21:45:05,068 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {49552#true} {49553#false} #1364#return; {49553#false} is VALID [2022-02-20 21:45:05,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {49553#false} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {49553#false} is VALID [2022-02-20 21:45:05,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {49553#false} assume !(0 != pf_detect_~tmp___0~8#1); {49553#false} is VALID [2022-02-20 21:45:05,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {49553#false} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {49553#false} is VALID [2022-02-20 21:45:05,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {49553#false} assume pf_detect_~unit~1#1 <= 3; {49553#false} is VALID [2022-02-20 21:45:05,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {49553#false} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {49553#false} is VALID [2022-02-20 21:45:05,072 INFO L272 TraceCheckUtils]: 27: Hoare triple {49553#false} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {49552#true} is VALID [2022-02-20 21:45:05,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {49552#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {49552#true} is VALID [2022-02-20 21:45:05,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {49552#true} assume true; {49552#true} is VALID [2022-02-20 21:45:05,073 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {49552#true} {49553#false} #1378#return; {49553#false} is VALID [2022-02-20 21:45:05,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {49553#false} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {49553#false} is VALID [2022-02-20 21:45:05,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {49553#false} assume !(pf_detect_~unit~1#1 <= 3); {49553#false} is VALID [2022-02-20 21:45:05,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {49553#false} pf_detect_#res#1 := -1; {49553#false} is VALID [2022-02-20 21:45:05,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {49553#false} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {49553#false} is VALID [2022-02-20 21:45:05,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {49553#false} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {49553#false} is VALID [2022-02-20 21:45:05,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {49553#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {49553#false} is VALID [2022-02-20 21:45:05,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {49553#false} assume !(0 == ~ldv_retval_pf_init~0); {49553#false} is VALID [2022-02-20 21:45:05,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {49553#false} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {49553#false} is VALID [2022-02-20 21:45:05,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {49553#false} assume { :begin_inline_ldv_check_final_state } true; {49553#false} is VALID [2022-02-20 21:45:05,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {49553#false} assume !(1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0); {49553#false} is VALID [2022-02-20 21:45:05,074 INFO L272 TraceCheckUtils]: 41: Hoare triple {49553#false} call ldv_error(); {49553#false} is VALID [2022-02-20 21:45:05,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {49553#false} assume !false; {49553#false} is VALID [2022-02-20 21:45:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 21:45:05,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:45:05,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961436204] [2022-02-20 21:45:05,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961436204] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:45:05,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564785772] [2022-02-20 21:45:05,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:05,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:45:05,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:45:05,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:45:05,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 21:45:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:05,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:45:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:05,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:45:05,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {49552#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {49552#true} is VALID [2022-02-20 21:45:05,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {49552#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume main_#t~switch306#1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume main_#t~switch318#1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume pf_init_units_~unit~0#1 <= 3; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume !(pf_init_units_~unit~0#1 <= 3); {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,485 INFO L272 TraceCheckUtils]: 18: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume true; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,487 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} #1364#return; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume !(0 != pf_detect_~tmp___0~8#1); {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume pf_detect_~unit~1#1 <= 3; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,490 INFO L272 TraceCheckUtils]: 27: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume true; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,491 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} #1378#return; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume !(pf_detect_~unit~1#1 <= 3); {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} pf_detect_#res#1 := -1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume !(0 == ~ldv_retval_pf_init~0); {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume { :begin_inline_ldv_check_final_state } true; {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} is VALID [2022-02-20 21:45:05,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {49568#(= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)} assume !(1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0); {49553#false} is VALID [2022-02-20 21:45:05,494 INFO L272 TraceCheckUtils]: 41: Hoare triple {49553#false} call ldv_error(); {49553#false} is VALID [2022-02-20 21:45:05,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {49553#false} assume !false; {49553#false} is VALID [2022-02-20 21:45:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 21:45:05,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:45:05,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564785772] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:45:05,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:45:05,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 21:45:05,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488072707] [2022-02-20 21:45:05,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:45:05,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-02-20 21:45:05,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:45:05,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:05,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:05,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:45:05,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:45:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:45:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:45:05,539 INFO L87 Difference]: Start difference. First operand 1273 states and 1735 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:07,181 INFO L93 Difference]: Finished difference Result 1275 states and 1736 transitions. [2022-02-20 21:45:07,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:45:07,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-02-20 21:45:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:45:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2022-02-20 21:45:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2022-02-20 21:45:07,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 703 transitions. [2022-02-20 21:45:07,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 703 edges. 703 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:07,748 INFO L225 Difference]: With dead ends: 1275 [2022-02-20 21:45:07,748 INFO L226 Difference]: Without dead ends: 1272 [2022-02-20 21:45:07,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:45:07,751 INFO L933 BasicCegarLoop]: 699 mSDtfsCounter, 660 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:45:07,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [660 Valid, 699 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:45:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2022-02-20 21:45:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1272. [2022-02-20 21:45:07,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:45:07,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1272 states. Second operand has 1272 states, 911 states have (on average 1.3260153677277717) internal successors, (1208), 927 states have internal predecessors, (1208), 265 states have call successors, (265), 96 states have call predecessors, (265), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:07,842 INFO L74 IsIncluded]: Start isIncluded. First operand 1272 states. Second operand has 1272 states, 911 states have (on average 1.3260153677277717) internal successors, (1208), 927 states have internal predecessors, (1208), 265 states have call successors, (265), 96 states have call predecessors, (265), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:07,844 INFO L87 Difference]: Start difference. First operand 1272 states. Second operand has 1272 states, 911 states have (on average 1.3260153677277717) internal successors, (1208), 927 states have internal predecessors, (1208), 265 states have call successors, (265), 96 states have call predecessors, (265), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:07,924 INFO L93 Difference]: Finished difference Result 1272 states and 1733 transitions. [2022-02-20 21:45:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1733 transitions. [2022-02-20 21:45:07,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:07,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:07,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 1272 states, 911 states have (on average 1.3260153677277717) internal successors, (1208), 927 states have internal predecessors, (1208), 265 states have call successors, (265), 96 states have call predecessors, (265), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) Second operand 1272 states. [2022-02-20 21:45:07,930 INFO L87 Difference]: Start difference. First operand has 1272 states, 911 states have (on average 1.3260153677277717) internal successors, (1208), 927 states have internal predecessors, (1208), 265 states have call successors, (265), 96 states have call predecessors, (265), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) Second operand 1272 states. [2022-02-20 21:45:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:07,980 INFO L93 Difference]: Finished difference Result 1272 states and 1733 transitions. [2022-02-20 21:45:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1733 transitions. [2022-02-20 21:45:07,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:07,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:07,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:45:07,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:45:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 911 states have (on average 1.3260153677277717) internal successors, (1208), 927 states have internal predecessors, (1208), 265 states have call successors, (265), 96 states have call predecessors, (265), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:08,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1733 transitions. [2022-02-20 21:45:08,059 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1733 transitions. Word has length 43 [2022-02-20 21:45:08,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:45:08,059 INFO L470 AbstractCegarLoop]: Abstraction has 1272 states and 1733 transitions. [2022-02-20 21:45:08,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1733 transitions. [2022-02-20 21:45:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 21:45:08,060 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:45:08,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:45:08,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 21:45:08,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:45:08,279 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:45:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:45:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1301881938, now seen corresponding path program 1 times [2022-02-20 21:45:08,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:45:08,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163465887] [2022-02-20 21:45:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:08,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:45:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:08,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:45:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:08,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {55830#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {55830#true} is VALID [2022-02-20 21:45:08,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {55830#true} assume true; {55830#true} is VALID [2022-02-20 21:45:08,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55830#true} {55831#false} #1364#return; {55831#false} is VALID [2022-02-20 21:45:08,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 21:45:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:08,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {55830#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {55830#true} is VALID [2022-02-20 21:45:08,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {55830#true} assume true; {55830#true} is VALID [2022-02-20 21:45:08,394 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55830#true} {55831#false} #1378#return; {55831#false} is VALID [2022-02-20 21:45:08,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {55830#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {55830#true} is VALID [2022-02-20 21:45:08,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {55830#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {55830#true} is VALID [2022-02-20 21:45:08,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {55830#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {55830#true} is VALID [2022-02-20 21:45:08,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {55830#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {55830#true} is VALID [2022-02-20 21:45:08,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {55830#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {55830#true} is VALID [2022-02-20 21:45:08,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {55830#true} assume main_#t~switch306#1; {55830#true} is VALID [2022-02-20 21:45:08,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {55830#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {55830#true} is VALID [2022-02-20 21:45:08,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {55830#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {55830#true} is VALID [2022-02-20 21:45:08,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {55830#true} assume main_#t~switch318#1; {55830#true} is VALID [2022-02-20 21:45:08,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {55830#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {55830#true} is VALID [2022-02-20 21:45:08,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {55830#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {55832#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:08,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {55832#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume pf_init_units_~unit~0#1 <= 3; {55832#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:08,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {55832#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {55832#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:08,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {55832#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {55832#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:08,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {55832#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {55833#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} is VALID [2022-02-20 21:45:08,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {55833#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} assume !(pf_init_units_~unit~0#1 <= 3); {55831#false} is VALID [2022-02-20 21:45:08,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {55831#false} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {55831#false} is VALID [2022-02-20 21:45:08,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {55831#false} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {55831#false} is VALID [2022-02-20 21:45:08,398 INFO L272 TraceCheckUtils]: 18: Hoare triple {55831#false} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {55830#true} is VALID [2022-02-20 21:45:08,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {55830#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {55830#true} is VALID [2022-02-20 21:45:08,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {55830#true} assume true; {55830#true} is VALID [2022-02-20 21:45:08,398 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {55830#true} {55831#false} #1364#return; {55831#false} is VALID [2022-02-20 21:45:08,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {55831#false} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {55831#false} is VALID [2022-02-20 21:45:08,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {55831#false} assume !(0 != pf_detect_~tmp___0~8#1); {55831#false} is VALID [2022-02-20 21:45:08,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {55831#false} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {55831#false} is VALID [2022-02-20 21:45:08,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {55831#false} assume pf_detect_~unit~1#1 <= 3; {55831#false} is VALID [2022-02-20 21:45:08,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {55831#false} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {55831#false} is VALID [2022-02-20 21:45:08,404 INFO L272 TraceCheckUtils]: 27: Hoare triple {55831#false} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {55830#true} is VALID [2022-02-20 21:45:08,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {55830#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {55830#true} is VALID [2022-02-20 21:45:08,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {55830#true} assume true; {55830#true} is VALID [2022-02-20 21:45:08,404 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {55830#true} {55831#false} #1378#return; {55831#false} is VALID [2022-02-20 21:45:08,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {55831#false} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {55831#false} is VALID [2022-02-20 21:45:08,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {55831#false} assume !(pf_detect_~unit~1#1 <= 3); {55831#false} is VALID [2022-02-20 21:45:08,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {55831#false} pf_detect_#res#1 := -1; {55831#false} is VALID [2022-02-20 21:45:08,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {55831#false} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {55831#false} is VALID [2022-02-20 21:45:08,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {55831#false} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {55831#false} is VALID [2022-02-20 21:45:08,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {55831#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {55831#false} is VALID [2022-02-20 21:45:08,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {55831#false} assume !(0 == ~ldv_retval_pf_init~0); {55831#false} is VALID [2022-02-20 21:45:08,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {55831#false} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {55831#false} is VALID [2022-02-20 21:45:08,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {55831#false} assume { :begin_inline_ldv_check_final_state } true; {55831#false} is VALID [2022-02-20 21:45:08,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {55831#false} assume 1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0; {55831#false} is VALID [2022-02-20 21:45:08,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {55831#false} assume !(1 == ~ldv_mutex_lock~0); {55831#false} is VALID [2022-02-20 21:45:08,405 INFO L272 TraceCheckUtils]: 42: Hoare triple {55831#false} call ldv_error(); {55831#false} is VALID [2022-02-20 21:45:08,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {55831#false} assume !false; {55831#false} is VALID [2022-02-20 21:45:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 21:45:08,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:45:08,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163465887] [2022-02-20 21:45:08,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163465887] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:45:08,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393119007] [2022-02-20 21:45:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:08,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:45:08,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:45:08,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:45:08,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 21:45:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:08,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:45:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:08,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:45:08,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {55830#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {55830#true} is VALID [2022-02-20 21:45:08,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {55830#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume main_#t~switch306#1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume main_#t~switch318#1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume pf_init_units_~unit~0#1 <= 3; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume !(pf_init_units_~unit~0#1 <= 3); {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,790 INFO L272 TraceCheckUtils]: 18: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume true; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,792 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {55846#(= ~ldv_mutex_lock~0 1)} {55846#(= ~ldv_mutex_lock~0 1)} #1364#return; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume !(0 != pf_detect_~tmp___0~8#1); {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume pf_detect_~unit~1#1 <= 3; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,794 INFO L272 TraceCheckUtils]: 27: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume true; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,796 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {55846#(= ~ldv_mutex_lock~0 1)} {55846#(= ~ldv_mutex_lock~0 1)} #1378#return; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume !(pf_detect_~unit~1#1 <= 3); {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} pf_detect_#res#1 := -1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume !(0 == ~ldv_retval_pf_init~0); {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume { :begin_inline_ldv_check_final_state } true; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume 1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0; {55846#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:45:08,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {55846#(= ~ldv_mutex_lock~0 1)} assume !(1 == ~ldv_mutex_lock~0); {55831#false} is VALID [2022-02-20 21:45:08,799 INFO L272 TraceCheckUtils]: 42: Hoare triple {55831#false} call ldv_error(); {55831#false} is VALID [2022-02-20 21:45:08,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {55831#false} assume !false; {55831#false} is VALID [2022-02-20 21:45:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 21:45:08,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:45:08,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393119007] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:45:08,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:45:08,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 21:45:08,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619480755] [2022-02-20 21:45:08,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:45:08,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-02-20 21:45:08,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:45:08,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:08,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:08,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:45:08,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:45:08,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:45:08,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:45:08,845 INFO L87 Difference]: Start difference. First operand 1272 states and 1733 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:11,098 INFO L93 Difference]: Finished difference Result 1274 states and 1734 transitions. [2022-02-20 21:45:11,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:45:11,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-02-20 21:45:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:45:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2022-02-20 21:45:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2022-02-20 21:45:11,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 701 transitions. [2022-02-20 21:45:11,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:11,626 INFO L225 Difference]: With dead ends: 1274 [2022-02-20 21:45:11,626 INFO L226 Difference]: Without dead ends: 1271 [2022-02-20 21:45:11,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:45:11,629 INFO L933 BasicCegarLoop]: 697 mSDtfsCounter, 657 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:45:11,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [657 Valid, 697 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:45:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-02-20 21:45:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2022-02-20 21:45:11,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:45:11,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1271 states. Second operand has 1271 states, 911 states have (on average 1.3249176728869374) internal successors, (1207), 926 states have internal predecessors, (1207), 264 states have call successors, (264), 96 states have call predecessors, (264), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:11,682 INFO L74 IsIncluded]: Start isIncluded. First operand 1271 states. Second operand has 1271 states, 911 states have (on average 1.3249176728869374) internal successors, (1207), 926 states have internal predecessors, (1207), 264 states have call successors, (264), 96 states have call predecessors, (264), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:11,684 INFO L87 Difference]: Start difference. First operand 1271 states. Second operand has 1271 states, 911 states have (on average 1.3249176728869374) internal successors, (1207), 926 states have internal predecessors, (1207), 264 states have call successors, (264), 96 states have call predecessors, (264), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:11,733 INFO L93 Difference]: Finished difference Result 1271 states and 1731 transitions. [2022-02-20 21:45:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1731 transitions. [2022-02-20 21:45:11,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:11,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:11,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 1271 states, 911 states have (on average 1.3249176728869374) internal successors, (1207), 926 states have internal predecessors, (1207), 264 states have call successors, (264), 96 states have call predecessors, (264), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) Second operand 1271 states. [2022-02-20 21:45:11,739 INFO L87 Difference]: Start difference. First operand has 1271 states, 911 states have (on average 1.3249176728869374) internal successors, (1207), 926 states have internal predecessors, (1207), 264 states have call successors, (264), 96 states have call predecessors, (264), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) Second operand 1271 states. [2022-02-20 21:45:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:11,790 INFO L93 Difference]: Finished difference Result 1271 states and 1731 transitions. [2022-02-20 21:45:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1731 transitions. [2022-02-20 21:45:11,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:11,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:11,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:45:11,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:45:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 911 states have (on average 1.3249176728869374) internal successors, (1207), 926 states have internal predecessors, (1207), 264 states have call successors, (264), 96 states have call predecessors, (264), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1731 transitions. [2022-02-20 21:45:11,869 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1731 transitions. Word has length 44 [2022-02-20 21:45:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:45:11,869 INFO L470 AbstractCegarLoop]: Abstraction has 1271 states and 1731 transitions. [2022-02-20 21:45:11,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1731 transitions. [2022-02-20 21:45:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 21:45:11,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:45:11,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:45:11,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 21:45:12,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:45:12,110 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:45:12,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:45:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1703338738, now seen corresponding path program 1 times [2022-02-20 21:45:12,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:45:12,111 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082019697] [2022-02-20 21:45:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:45:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:12,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:45:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:12,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {62105#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {62105#true} is VALID [2022-02-20 21:45:12,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {62105#true} assume true; {62105#true} is VALID [2022-02-20 21:45:12,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62105#true} {62106#false} #1364#return; {62106#false} is VALID [2022-02-20 21:45:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 21:45:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:12,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {62105#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {62105#true} is VALID [2022-02-20 21:45:12,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {62105#true} assume true; {62105#true} is VALID [2022-02-20 21:45:12,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62105#true} {62106#false} #1378#return; {62106#false} is VALID [2022-02-20 21:45:12,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {62105#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {62105#true} is VALID [2022-02-20 21:45:12,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {62105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {62105#true} is VALID [2022-02-20 21:45:12,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {62105#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {62105#true} is VALID [2022-02-20 21:45:12,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {62105#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {62105#true} is VALID [2022-02-20 21:45:12,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {62105#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {62105#true} is VALID [2022-02-20 21:45:12,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {62105#true} assume main_#t~switch306#1; {62105#true} is VALID [2022-02-20 21:45:12,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {62105#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {62105#true} is VALID [2022-02-20 21:45:12,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {62105#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {62105#true} is VALID [2022-02-20 21:45:12,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {62105#true} assume main_#t~switch318#1; {62105#true} is VALID [2022-02-20 21:45:12,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {62105#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {62105#true} is VALID [2022-02-20 21:45:12,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {62105#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {62107#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:12,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {62107#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume pf_init_units_~unit~0#1 <= 3; {62107#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:12,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {62107#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {62107#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:12,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {62107#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {62107#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:12,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {62107#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {62108#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} is VALID [2022-02-20 21:45:12,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {62108#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} assume !(pf_init_units_~unit~0#1 <= 3); {62106#false} is VALID [2022-02-20 21:45:12,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {62106#false} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {62106#false} is VALID [2022-02-20 21:45:12,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {62106#false} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {62106#false} is VALID [2022-02-20 21:45:12,202 INFO L272 TraceCheckUtils]: 18: Hoare triple {62106#false} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {62105#true} is VALID [2022-02-20 21:45:12,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {62105#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {62105#true} is VALID [2022-02-20 21:45:12,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {62105#true} assume true; {62105#true} is VALID [2022-02-20 21:45:12,202 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {62105#true} {62106#false} #1364#return; {62106#false} is VALID [2022-02-20 21:45:12,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {62106#false} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {62106#false} is VALID [2022-02-20 21:45:12,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {62106#false} assume !(0 != pf_detect_~tmp___0~8#1); {62106#false} is VALID [2022-02-20 21:45:12,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {62106#false} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {62106#false} is VALID [2022-02-20 21:45:12,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {62106#false} assume pf_detect_~unit~1#1 <= 3; {62106#false} is VALID [2022-02-20 21:45:12,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {62106#false} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {62106#false} is VALID [2022-02-20 21:45:12,203 INFO L272 TraceCheckUtils]: 27: Hoare triple {62106#false} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {62105#true} is VALID [2022-02-20 21:45:12,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {62105#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {62105#true} is VALID [2022-02-20 21:45:12,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {62105#true} assume true; {62105#true} is VALID [2022-02-20 21:45:12,203 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {62105#true} {62106#false} #1378#return; {62106#false} is VALID [2022-02-20 21:45:12,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {62106#false} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {62106#false} is VALID [2022-02-20 21:45:12,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {62106#false} assume !(pf_detect_~unit~1#1 <= 3); {62106#false} is VALID [2022-02-20 21:45:12,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {62106#false} pf_detect_#res#1 := -1; {62106#false} is VALID [2022-02-20 21:45:12,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {62106#false} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {62106#false} is VALID [2022-02-20 21:45:12,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {62106#false} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {62106#false} is VALID [2022-02-20 21:45:12,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {62106#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {62106#false} is VALID [2022-02-20 21:45:12,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {62106#false} assume !(0 == ~ldv_retval_pf_init~0); {62106#false} is VALID [2022-02-20 21:45:12,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {62106#false} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {62106#false} is VALID [2022-02-20 21:45:12,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {62106#false} assume { :begin_inline_ldv_check_final_state } true; {62106#false} is VALID [2022-02-20 21:45:12,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {62106#false} assume 1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0; {62106#false} is VALID [2022-02-20 21:45:12,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {62106#false} assume 1 == ~ldv_mutex_lock~0; {62106#false} is VALID [2022-02-20 21:45:12,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {62106#false} assume !(1 == ~ldv_mutex_mutex_of_device~0); {62106#false} is VALID [2022-02-20 21:45:12,205 INFO L272 TraceCheckUtils]: 43: Hoare triple {62106#false} call ldv_error(); {62106#false} is VALID [2022-02-20 21:45:12,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {62106#false} assume !false; {62106#false} is VALID [2022-02-20 21:45:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 21:45:12,205 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:45:12,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082019697] [2022-02-20 21:45:12,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082019697] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:45:12,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375848988] [2022-02-20 21:45:12,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:45:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:45:12,207 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:45:12,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 21:45:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:12,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:45:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:12,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:45:12,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {62105#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {62105#true} is VALID [2022-02-20 21:45:12,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {62105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume main_#t~switch306#1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume main_#t~switch318#1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume pf_init_units_~unit~0#1 <= 3; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(pf_init_units_~unit~0#1 <= 3); {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,614 INFO L272 TraceCheckUtils]: 18: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume true; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,616 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} #1364#return; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(0 != pf_detect_~tmp___0~8#1); {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume pf_detect_~unit~1#1 <= 3; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,618 INFO L272 TraceCheckUtils]: 27: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume true; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,619 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} #1378#return; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(pf_detect_~unit~1#1 <= 3); {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} pf_detect_#res#1 := -1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(0 == ~ldv_retval_pf_init~0); {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume { :begin_inline_ldv_check_final_state } true; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,623 INFO L290 TraceCheckUtils]: 41: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 1 == ~ldv_mutex_lock~0; {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:45:12,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {62121#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(1 == ~ldv_mutex_mutex_of_device~0); {62106#false} is VALID [2022-02-20 21:45:12,623 INFO L272 TraceCheckUtils]: 43: Hoare triple {62106#false} call ldv_error(); {62106#false} is VALID [2022-02-20 21:45:12,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {62106#false} assume !false; {62106#false} is VALID [2022-02-20 21:45:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 21:45:12,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:45:12,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375848988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:45:12,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:45:12,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 21:45:12,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709514257] [2022-02-20 21:45:12,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:45:12,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-02-20 21:45:12,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:45:12,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:12,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:12,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:45:12,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:45:12,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:45:12,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:45:12,700 INFO L87 Difference]: Start difference. First operand 1271 states and 1731 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:14,490 INFO L93 Difference]: Finished difference Result 1273 states and 1732 transitions. [2022-02-20 21:45:14,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:45:14,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-02-20 21:45:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:45:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2022-02-20 21:45:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2022-02-20 21:45:14,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 699 transitions. [2022-02-20 21:45:15,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 699 edges. 699 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:15,091 INFO L225 Difference]: With dead ends: 1273 [2022-02-20 21:45:15,092 INFO L226 Difference]: Without dead ends: 1270 [2022-02-20 21:45:15,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:45:15,093 INFO L933 BasicCegarLoop]: 695 mSDtfsCounter, 654 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:45:15,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 695 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:45:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2022-02-20 21:45:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1270. [2022-02-20 21:45:15,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:45:15,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1270 states. Second operand has 1270 states, 911 states have (on average 1.323819978046103) internal successors, (1206), 925 states have internal predecessors, (1206), 263 states have call successors, (263), 96 states have call predecessors, (263), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:15,136 INFO L74 IsIncluded]: Start isIncluded. First operand 1270 states. Second operand has 1270 states, 911 states have (on average 1.323819978046103) internal successors, (1206), 925 states have internal predecessors, (1206), 263 states have call successors, (263), 96 states have call predecessors, (263), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:15,138 INFO L87 Difference]: Start difference. First operand 1270 states. Second operand has 1270 states, 911 states have (on average 1.323819978046103) internal successors, (1206), 925 states have internal predecessors, (1206), 263 states have call successors, (263), 96 states have call predecessors, (263), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:15,186 INFO L93 Difference]: Finished difference Result 1270 states and 1729 transitions. [2022-02-20 21:45:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1729 transitions. [2022-02-20 21:45:15,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:15,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:15,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 1270 states, 911 states have (on average 1.323819978046103) internal successors, (1206), 925 states have internal predecessors, (1206), 263 states have call successors, (263), 96 states have call predecessors, (263), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) Second operand 1270 states. [2022-02-20 21:45:15,192 INFO L87 Difference]: Start difference. First operand has 1270 states, 911 states have (on average 1.323819978046103) internal successors, (1206), 925 states have internal predecessors, (1206), 263 states have call successors, (263), 96 states have call predecessors, (263), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) Second operand 1270 states. [2022-02-20 21:45:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:15,242 INFO L93 Difference]: Finished difference Result 1270 states and 1729 transitions. [2022-02-20 21:45:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1729 transitions. [2022-02-20 21:45:15,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:15,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:15,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:45:15,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:45:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 911 states have (on average 1.323819978046103) internal successors, (1206), 925 states have internal predecessors, (1206), 263 states have call successors, (263), 96 states have call predecessors, (263), 95 states have return successors, (260), 260 states have call predecessors, (260), 260 states have call successors, (260) [2022-02-20 21:45:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1729 transitions. [2022-02-20 21:45:15,320 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1729 transitions. Word has length 45 [2022-02-20 21:45:15,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:45:15,320 INFO L470 AbstractCegarLoop]: Abstraction has 1270 states and 1729 transitions. [2022-02-20 21:45:15,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1729 transitions. [2022-02-20 21:45:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 21:45:15,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:45:15,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:45:15,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 21:45:15,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:45:15,540 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:45:15,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:45:15,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1263602517, now seen corresponding path program 1 times [2022-02-20 21:45:15,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:45:15,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165214257] [2022-02-20 21:45:15,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:15,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:45:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:15,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:45:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:15,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {68377#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {68377#true} is VALID [2022-02-20 21:45:15,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {68377#true} assume true; {68377#true} is VALID [2022-02-20 21:45:15,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68377#true} {68378#false} #1364#return; {68378#false} is VALID [2022-02-20 21:45:15,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 21:45:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:15,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {68377#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {68377#true} is VALID [2022-02-20 21:45:15,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {68377#true} assume true; {68377#true} is VALID [2022-02-20 21:45:15,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68377#true} {68378#false} #1378#return; {68378#false} is VALID [2022-02-20 21:45:15,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {68377#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {68377#true} is VALID [2022-02-20 21:45:15,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {68377#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {68377#true} is VALID [2022-02-20 21:45:15,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {68377#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {68377#true} is VALID [2022-02-20 21:45:15,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {68377#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {68377#true} is VALID [2022-02-20 21:45:15,616 INFO L290 TraceCheckUtils]: 4: Hoare triple {68377#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {68377#true} is VALID [2022-02-20 21:45:15,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {68377#true} assume main_#t~switch306#1; {68377#true} is VALID [2022-02-20 21:45:15,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {68377#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {68377#true} is VALID [2022-02-20 21:45:15,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {68377#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {68377#true} is VALID [2022-02-20 21:45:15,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {68377#true} assume main_#t~switch318#1; {68377#true} is VALID [2022-02-20 21:45:15,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {68377#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {68377#true} is VALID [2022-02-20 21:45:15,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {68377#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {68379#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:15,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {68379#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume pf_init_units_~unit~0#1 <= 3; {68379#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:15,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {68379#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {68379#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:15,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {68379#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {68379#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:15,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {68379#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {68380#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} is VALID [2022-02-20 21:45:15,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {68380#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} assume !(pf_init_units_~unit~0#1 <= 3); {68378#false} is VALID [2022-02-20 21:45:15,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {68378#false} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {68378#false} is VALID [2022-02-20 21:45:15,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {68378#false} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {68378#false} is VALID [2022-02-20 21:45:15,619 INFO L272 TraceCheckUtils]: 18: Hoare triple {68378#false} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {68377#true} is VALID [2022-02-20 21:45:15,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {68377#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {68377#true} is VALID [2022-02-20 21:45:15,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {68377#true} assume true; {68377#true} is VALID [2022-02-20 21:45:15,619 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {68377#true} {68378#false} #1364#return; {68378#false} is VALID [2022-02-20 21:45:15,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {68378#false} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {68378#false} is VALID [2022-02-20 21:45:15,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {68378#false} assume !(0 != pf_detect_~tmp___0~8#1); {68378#false} is VALID [2022-02-20 21:45:15,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {68378#false} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {68378#false} is VALID [2022-02-20 21:45:15,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {68378#false} assume pf_detect_~unit~1#1 <= 3; {68378#false} is VALID [2022-02-20 21:45:15,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {68378#false} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {68378#false} is VALID [2022-02-20 21:45:15,620 INFO L272 TraceCheckUtils]: 27: Hoare triple {68378#false} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {68377#true} is VALID [2022-02-20 21:45:15,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {68377#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {68377#true} is VALID [2022-02-20 21:45:15,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {68377#true} assume true; {68377#true} is VALID [2022-02-20 21:45:15,620 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {68377#true} {68378#false} #1378#return; {68378#false} is VALID [2022-02-20 21:45:15,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {68378#false} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {68378#false} is VALID [2022-02-20 21:45:15,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {68378#false} assume !(pf_detect_~unit~1#1 <= 3); {68378#false} is VALID [2022-02-20 21:45:15,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {68378#false} pf_detect_#res#1 := -1; {68378#false} is VALID [2022-02-20 21:45:15,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {68378#false} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {68378#false} is VALID [2022-02-20 21:45:15,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {68378#false} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {68378#false} is VALID [2022-02-20 21:45:15,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {68378#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {68378#false} is VALID [2022-02-20 21:45:15,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {68378#false} assume !(0 == ~ldv_retval_pf_init~0); {68378#false} is VALID [2022-02-20 21:45:15,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {68378#false} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {68378#false} is VALID [2022-02-20 21:45:15,621 INFO L290 TraceCheckUtils]: 39: Hoare triple {68378#false} assume { :begin_inline_ldv_check_final_state } true; {68378#false} is VALID [2022-02-20 21:45:15,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {68378#false} assume 1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0; {68378#false} is VALID [2022-02-20 21:45:15,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {68378#false} assume 1 == ~ldv_mutex_lock~0; {68378#false} is VALID [2022-02-20 21:45:15,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {68378#false} assume 1 == ~ldv_mutex_mutex_of_device~0; {68378#false} is VALID [2022-02-20 21:45:15,625 INFO L290 TraceCheckUtils]: 43: Hoare triple {68378#false} assume !(1 == ~ldv_mutex_pf_mutex~0); {68378#false} is VALID [2022-02-20 21:45:15,626 INFO L272 TraceCheckUtils]: 44: Hoare triple {68378#false} call ldv_error(); {68378#false} is VALID [2022-02-20 21:45:15,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {68378#false} assume !false; {68378#false} is VALID [2022-02-20 21:45:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 21:45:15,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:45:15,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165214257] [2022-02-20 21:45:15,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165214257] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:45:15,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236043838] [2022-02-20 21:45:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:15,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:45:15,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:45:15,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:45:15,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 21:45:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:15,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:45:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:15,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:45:16,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {68377#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {68377#true} is VALID [2022-02-20 21:45:16,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {68377#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,039 INFO L290 TraceCheckUtils]: 4: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume main_#t~switch306#1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume main_#t~switch318#1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume pf_init_units_~unit~0#1 <= 3; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume !(pf_init_units_~unit~0#1 <= 3); {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,045 INFO L272 TraceCheckUtils]: 18: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume true; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,047 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {68393#(= ~ldv_mutex_pf_mutex~0 1)} {68393#(= ~ldv_mutex_pf_mutex~0 1)} #1364#return; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume !(0 != pf_detect_~tmp___0~8#1); {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume pf_detect_~unit~1#1 <= 3; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,049 INFO L272 TraceCheckUtils]: 27: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume true; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,050 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {68393#(= ~ldv_mutex_pf_mutex~0 1)} {68393#(= ~ldv_mutex_pf_mutex~0 1)} #1378#return; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume !(pf_detect_~unit~1#1 <= 3); {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} pf_detect_#res#1 := -1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume !(0 == ~ldv_retval_pf_init~0); {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume 0 != ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 2; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume { :begin_inline_ldv_check_final_state } true; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume 1 == ~ldv_mutex_cred_guard_mutex_of_signal_struct~0; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume 1 == ~ldv_mutex_lock~0; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume 1 == ~ldv_mutex_mutex_of_device~0; {68393#(= ~ldv_mutex_pf_mutex~0 1)} is VALID [2022-02-20 21:45:16,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {68393#(= ~ldv_mutex_pf_mutex~0 1)} assume !(1 == ~ldv_mutex_pf_mutex~0); {68378#false} is VALID [2022-02-20 21:45:16,054 INFO L272 TraceCheckUtils]: 44: Hoare triple {68378#false} call ldv_error(); {68378#false} is VALID [2022-02-20 21:45:16,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {68378#false} assume !false; {68378#false} is VALID [2022-02-20 21:45:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 21:45:16,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:45:16,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236043838] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:45:16,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:45:16,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 21:45:16,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764363781] [2022-02-20 21:45:16,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:45:16,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-02-20 21:45:16,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:45:16,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:16,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:16,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:45:16,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:45:16,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:45:16,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:45:16,099 INFO L87 Difference]: Start difference. First operand 1270 states and 1729 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:19,380 INFO L93 Difference]: Finished difference Result 1480 states and 1999 transitions. [2022-02-20 21:45:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:45:19,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-02-20 21:45:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:45:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2022-02-20 21:45:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2022-02-20 21:45:19,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 964 transitions. [2022-02-20 21:45:20,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 964 edges. 964 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:20,184 INFO L225 Difference]: With dead ends: 1480 [2022-02-20 21:45:20,185 INFO L226 Difference]: Without dead ends: 1448 [2022-02-20 21:45:20,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:45:20,186 INFO L933 BasicCegarLoop]: 949 mSDtfsCounter, 589 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:45:20,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 1272 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:45:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2022-02-20 21:45:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1448. [2022-02-20 21:45:20,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:45:20,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1448 states. Second operand has 1448 states, 1029 states have (on average 1.3129251700680271) internal successors, (1351), 1043 states have internal predecessors, (1351), 305 states have call successors, (305), 114 states have call predecessors, (305), 113 states have return successors, (304), 304 states have call predecessors, (304), 304 states have call successors, (304) [2022-02-20 21:45:20,236 INFO L74 IsIncluded]: Start isIncluded. First operand 1448 states. Second operand has 1448 states, 1029 states have (on average 1.3129251700680271) internal successors, (1351), 1043 states have internal predecessors, (1351), 305 states have call successors, (305), 114 states have call predecessors, (305), 113 states have return successors, (304), 304 states have call predecessors, (304), 304 states have call successors, (304) [2022-02-20 21:45:20,237 INFO L87 Difference]: Start difference. First operand 1448 states. Second operand has 1448 states, 1029 states have (on average 1.3129251700680271) internal successors, (1351), 1043 states have internal predecessors, (1351), 305 states have call successors, (305), 114 states have call predecessors, (305), 113 states have return successors, (304), 304 states have call predecessors, (304), 304 states have call successors, (304) [2022-02-20 21:45:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:20,302 INFO L93 Difference]: Finished difference Result 1448 states and 1960 transitions. [2022-02-20 21:45:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1960 transitions. [2022-02-20 21:45:20,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:20,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:20,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 1448 states, 1029 states have (on average 1.3129251700680271) internal successors, (1351), 1043 states have internal predecessors, (1351), 305 states have call successors, (305), 114 states have call predecessors, (305), 113 states have return successors, (304), 304 states have call predecessors, (304), 304 states have call successors, (304) Second operand 1448 states. [2022-02-20 21:45:20,309 INFO L87 Difference]: Start difference. First operand has 1448 states, 1029 states have (on average 1.3129251700680271) internal successors, (1351), 1043 states have internal predecessors, (1351), 305 states have call successors, (305), 114 states have call predecessors, (305), 113 states have return successors, (304), 304 states have call predecessors, (304), 304 states have call successors, (304) Second operand 1448 states. [2022-02-20 21:45:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:20,372 INFO L93 Difference]: Finished difference Result 1448 states and 1960 transitions. [2022-02-20 21:45:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1960 transitions. [2022-02-20 21:45:20,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:20,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:20,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:45:20,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:45:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1029 states have (on average 1.3129251700680271) internal successors, (1351), 1043 states have internal predecessors, (1351), 305 states have call successors, (305), 114 states have call predecessors, (305), 113 states have return successors, (304), 304 states have call predecessors, (304), 304 states have call successors, (304) [2022-02-20 21:45:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1960 transitions. [2022-02-20 21:45:20,478 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1960 transitions. Word has length 46 [2022-02-20 21:45:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:45:20,478 INFO L470 AbstractCegarLoop]: Abstraction has 1448 states and 1960 transitions. [2022-02-20 21:45:20,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:45:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1960 transitions. [2022-02-20 21:45:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 21:45:20,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:45:20,479 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:45:20,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-20 21:45:20,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:45:20,696 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:45:20,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:45:20,697 INFO L85 PathProgramCache]: Analyzing trace with hash 127015852, now seen corresponding path program 1 times [2022-02-20 21:45:20,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:45:20,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670617285] [2022-02-20 21:45:20,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:20,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:45:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:20,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:45:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:20,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {75534#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {75534#true} is VALID [2022-02-20 21:45:20,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {75534#true} assume true; {75534#true} is VALID [2022-02-20 21:45:20,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75534#true} {75535#false} #1364#return; {75535#false} is VALID [2022-02-20 21:45:20,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 21:45:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:20,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {75534#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {75534#true} is VALID [2022-02-20 21:45:20,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {75534#true} assume true; {75534#true} is VALID [2022-02-20 21:45:20,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75534#true} {75535#false} #1378#return; {75535#false} is VALID [2022-02-20 21:45:20,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 21:45:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:20,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {75552#(= |old(~ldv_mutex_pf_mutex~0)| ~ldv_mutex_pf_mutex~0)} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {75534#true} is VALID [2022-02-20 21:45:20,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {75534#true} assume 1 == ~ldv_mutex_pf_mutex~0; {75534#true} is VALID [2022-02-20 21:45:20,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {75534#true} ~ldv_mutex_pf_mutex~0 := 2; {75534#true} is VALID [2022-02-20 21:45:20,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {75534#true} assume true; {75534#true} is VALID [2022-02-20 21:45:20,779 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75534#true} {75535#false} #1332#return; {75535#false} is VALID [2022-02-20 21:45:20,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-20 21:45:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:20,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {75534#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {75534#true} is VALID [2022-02-20 21:45:20,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {75534#true} assume true; {75534#true} is VALID [2022-02-20 21:45:20,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75534#true} {75535#false} #1334#return; {75535#false} is VALID [2022-02-20 21:45:20,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {75534#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {75534#true} is VALID [2022-02-20 21:45:20,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {75534#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {75534#true} is VALID [2022-02-20 21:45:20,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {75534#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {75534#true} is VALID [2022-02-20 21:45:20,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {75534#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {75534#true} is VALID [2022-02-20 21:45:20,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {75534#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {75534#true} is VALID [2022-02-20 21:45:20,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {75534#true} assume main_#t~switch306#1; {75534#true} is VALID [2022-02-20 21:45:20,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {75534#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {75534#true} is VALID [2022-02-20 21:45:20,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {75534#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {75534#true} is VALID [2022-02-20 21:45:20,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {75534#true} assume main_#t~switch318#1; {75534#true} is VALID [2022-02-20 21:45:20,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {75534#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {75534#true} is VALID [2022-02-20 21:45:20,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {75534#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {75536#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:20,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {75536#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume pf_init_units_~unit~0#1 <= 3; {75536#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:20,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {75536#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {75536#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:20,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {75536#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {75536#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} is VALID [2022-02-20 21:45:20,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {75536#(= |ULTIMATE.start_pf_init_units_~unit~0#1| 0)} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {75537#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} is VALID [2022-02-20 21:45:20,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {75537#(<= |ULTIMATE.start_pf_init_units_~unit~0#1| 1)} assume !(pf_init_units_~unit~0#1 <= 3); {75535#false} is VALID [2022-02-20 21:45:20,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {75535#false} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {75535#false} is VALID [2022-02-20 21:45:20,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {75535#false} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {75535#false} is VALID [2022-02-20 21:45:20,807 INFO L272 TraceCheckUtils]: 18: Hoare triple {75535#false} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {75534#true} is VALID [2022-02-20 21:45:20,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {75534#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {75534#true} is VALID [2022-02-20 21:45:20,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {75534#true} assume true; {75534#true} is VALID [2022-02-20 21:45:20,807 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {75534#true} {75535#false} #1364#return; {75535#false} is VALID [2022-02-20 21:45:20,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {75535#false} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {75535#false} is VALID [2022-02-20 21:45:20,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {75535#false} assume !(0 != pf_detect_~tmp___0~8#1); {75535#false} is VALID [2022-02-20 21:45:20,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {75535#false} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {75535#false} is VALID [2022-02-20 21:45:20,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {75535#false} assume pf_detect_~unit~1#1 <= 3; {75535#false} is VALID [2022-02-20 21:45:20,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {75535#false} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {75535#false} is VALID [2022-02-20 21:45:20,808 INFO L272 TraceCheckUtils]: 27: Hoare triple {75535#false} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {75534#true} is VALID [2022-02-20 21:45:20,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {75534#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {75534#true} is VALID [2022-02-20 21:45:20,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {75534#true} assume true; {75534#true} is VALID [2022-02-20 21:45:20,808 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {75534#true} {75535#false} #1378#return; {75535#false} is VALID [2022-02-20 21:45:20,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {75535#false} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {75535#false} is VALID [2022-02-20 21:45:20,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {75535#false} assume !(pf_detect_~unit~1#1 <= 3); {75535#false} is VALID [2022-02-20 21:45:20,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {75535#false} pf_detect_#res#1 := -1; {75535#false} is VALID [2022-02-20 21:45:20,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {75535#false} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {75535#false} is VALID [2022-02-20 21:45:20,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {75535#false} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {75535#false} is VALID [2022-02-20 21:45:20,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {75535#false} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {75535#false} is VALID [2022-02-20 21:45:20,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {75535#false} assume 0 == ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1; {75535#false} is VALID [2022-02-20 21:45:20,809 INFO L290 TraceCheckUtils]: 38: Hoare triple {75535#false} assume !(0 != ~ldv_retval_pf_init~0); {75535#false} is VALID [2022-02-20 21:45:20,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {75535#false} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {75535#false} is VALID [2022-02-20 21:45:20,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {75535#false} assume main_#t~switch306#1; {75535#false} is VALID [2022-02-20 21:45:20,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {75535#false} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet307#1 && main_#t~nondet307#1 <= 2147483647;main_~tmp___0~15#1 := main_#t~nondet307#1;havoc main_#t~nondet307#1;main_#t~switch308#1 := 0 == main_~tmp___0~15#1; {75535#false} is VALID [2022-02-20 21:45:20,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {75535#false} assume !main_#t~switch308#1;main_#t~switch308#1 := main_#t~switch308#1 || 1 == main_~tmp___0~15#1; {75535#false} is VALID [2022-02-20 21:45:20,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {75535#false} assume !main_#t~switch308#1;main_#t~switch308#1 := main_#t~switch308#1 || 2 == main_~tmp___0~15#1; {75535#false} is VALID [2022-02-20 21:45:20,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {75535#false} assume !main_#t~switch308#1;main_#t~switch308#1 := main_#t~switch308#1 || 3 == main_~tmp___0~15#1; {75535#false} is VALID [2022-02-20 21:45:20,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {75535#false} assume main_#t~switch308#1; {75535#false} is VALID [2022-02-20 21:45:20,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {75535#false} assume 2 == ~ldv_state_variable_1~0;assume { :begin_inline_pf_release } true;pf_release_#in~disk#1.base, pf_release_#in~disk#1.offset, pf_release_#in~mode#1 := ~pf_fops_group2~0.base, ~pf_fops_group2~0.offset, ~ldvarg1~0;havoc pf_release_#res#1;havoc pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset, pf_release_#t~mem111#1, pf_release_#t~mem112#1, pf_release_#t~mem113#1, pf_release_#t~mem114#1, pf_release_#t~short115#1, pf_release_~disk#1.base, pf_release_~disk#1.offset, pf_release_~mode#1, pf_release_~pf~4#1.base, pf_release_~pf~4#1.offset;pf_release_~disk#1.base, pf_release_~disk#1.offset := pf_release_#in~disk#1.base, pf_release_#in~disk#1.offset;pf_release_~mode#1 := pf_release_#in~mode#1;havoc pf_release_~pf~4#1.base, pf_release_~pf~4#1.offset;call pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset := read~$Pointer$(pf_release_~disk#1.base, 1275 + pf_release_~disk#1.offset, 8);pf_release_~pf~4#1.base, pf_release_~pf~4#1.offset := pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset;havoc pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset;assume { :begin_inline_ldv_mutex_lock_12 } true;ldv_mutex_lock_12_#in~ldv_func_arg1#1.base, ldv_mutex_lock_12_#in~ldv_func_arg1#1.offset := ~#pf_mutex~0.base, ~#pf_mutex~0.offset;havoc ldv_mutex_lock_12_~ldv_func_arg1#1.base, ldv_mutex_lock_12_~ldv_func_arg1#1.offset;ldv_mutex_lock_12_~ldv_func_arg1#1.base, ldv_mutex_lock_12_~ldv_func_arg1#1.offset := ldv_mutex_lock_12_#in~ldv_func_arg1#1.base, ldv_mutex_lock_12_#in~ldv_func_arg1#1.offset; {75535#false} is VALID [2022-02-20 21:45:20,810 INFO L272 TraceCheckUtils]: 47: Hoare triple {75535#false} call ldv_mutex_lock_pf_mutex(ldv_mutex_lock_12_~ldv_func_arg1#1.base, ldv_mutex_lock_12_~ldv_func_arg1#1.offset); {75552#(= |old(~ldv_mutex_pf_mutex~0)| ~ldv_mutex_pf_mutex~0)} is VALID [2022-02-20 21:45:20,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {75552#(= |old(~ldv_mutex_pf_mutex~0)| ~ldv_mutex_pf_mutex~0)} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {75534#true} is VALID [2022-02-20 21:45:20,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {75534#true} assume 1 == ~ldv_mutex_pf_mutex~0; {75534#true} is VALID [2022-02-20 21:45:20,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {75534#true} ~ldv_mutex_pf_mutex~0 := 2; {75534#true} is VALID [2022-02-20 21:45:20,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {75534#true} assume true; {75534#true} is VALID [2022-02-20 21:45:20,811 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {75534#true} {75535#false} #1332#return; {75535#false} is VALID [2022-02-20 21:45:20,811 INFO L272 TraceCheckUtils]: 53: Hoare triple {75535#false} call mutex_lock(ldv_mutex_lock_12_~ldv_func_arg1#1.base, ldv_mutex_lock_12_~ldv_func_arg1#1.offset); {75534#true} is VALID [2022-02-20 21:45:20,811 INFO L290 TraceCheckUtils]: 54: Hoare triple {75534#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {75534#true} is VALID [2022-02-20 21:45:20,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {75534#true} assume true; {75534#true} is VALID [2022-02-20 21:45:20,811 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {75534#true} {75535#false} #1334#return; {75535#false} is VALID [2022-02-20 21:45:20,812 INFO L290 TraceCheckUtils]: 57: Hoare triple {75535#false} assume { :end_inline_ldv_mutex_lock_12 } true;call pf_release_#t~mem111#1 := read~int(pf_release_~pf~4#1.base, 192 + pf_release_~pf~4#1.offset, 4); {75535#false} is VALID [2022-02-20 21:45:20,812 INFO L290 TraceCheckUtils]: 58: Hoare triple {75535#false} assume pf_release_#t~mem111#1 <= 0;havoc pf_release_#t~mem111#1;assume { :begin_inline_ldv_mutex_unlock_13 } true;ldv_mutex_unlock_13_#in~ldv_func_arg1#1.base, ldv_mutex_unlock_13_#in~ldv_func_arg1#1.offset := ~#pf_mutex~0.base, ~#pf_mutex~0.offset;havoc ldv_mutex_unlock_13_~ldv_func_arg1#1.base, ldv_mutex_unlock_13_~ldv_func_arg1#1.offset;ldv_mutex_unlock_13_~ldv_func_arg1#1.base, ldv_mutex_unlock_13_~ldv_func_arg1#1.offset := ldv_mutex_unlock_13_#in~ldv_func_arg1#1.base, ldv_mutex_unlock_13_#in~ldv_func_arg1#1.offset; {75535#false} is VALID [2022-02-20 21:45:20,812 INFO L272 TraceCheckUtils]: 59: Hoare triple {75535#false} call ldv_mutex_unlock_pf_mutex(ldv_mutex_unlock_13_~ldv_func_arg1#1.base, ldv_mutex_unlock_13_~ldv_func_arg1#1.offset); {75535#false} is VALID [2022-02-20 21:45:20,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {75535#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {75535#false} is VALID [2022-02-20 21:45:20,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {75535#false} assume !(2 == ~ldv_mutex_pf_mutex~0); {75535#false} is VALID [2022-02-20 21:45:20,812 INFO L272 TraceCheckUtils]: 62: Hoare triple {75535#false} call ldv_error(); {75535#false} is VALID [2022-02-20 21:45:20,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {75535#false} assume !false; {75535#false} is VALID [2022-02-20 21:45:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 21:45:20,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:45:20,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670617285] [2022-02-20 21:45:20,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670617285] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:45:20,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598682869] [2022-02-20 21:45:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:45:20,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:45:20,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:45:20,815 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:45:20,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 21:45:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:21,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 21:45:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:45:21,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:45:21,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {75534#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(72, 2);call #Ultimate.allocInit(3, 3);call write~init~int(112, 3, 0, 1);call write~init~int(102, 3, 1, 1);call write~init~int(0, 3, 2, 1);call #Ultimate.allocInit(19, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(13, 6);call #Ultimate.allocInit(36, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(123, 9);call #Ultimate.allocInit(123, 10);call #Ultimate.allocInit(5, 11);call write~init~int(37, 11, 0, 1);call write~init~int(115, 11, 1, 1);call write~init~int(37, 11, 2, 1);call write~init~int(100, 11, 3, 1);call write~init~int(0, 11, 4, 1);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(15, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(29, 15);call #Ultimate.allocInit(11, 16);call #Ultimate.allocInit(10, 17);call #Ultimate.allocInit(14, 18);call #Ultimate.allocInit(14, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(5, 21);call write~init~int(108, 21, 0, 1);call write~init~int(111, 21, 1, 1);call write~init~int(99, 21, 2, 1);call write~init~int(107, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(7, 22);call write~init~int(117, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(108, 22, 2, 1);call write~init~int(111, 22, 3, 1);call write~init~int(99, 22, 4, 1);call write~init~int(107, 22, 5, 1);call write~init~int(0, 22, 6, 1);call #Ultimate.allocInit(6, 23);call write~init~int(101, 23, 0, 1);call write~init~int(106, 23, 1, 1);call write~init~int(101, 23, 2, 1);call write~init~int(99, 23, 3, 1);call write~init~int(116, 23, 4, 1);call write~init~int(0, 23, 5, 1);call #Ultimate.allocInit(28, 24);call #Ultimate.allocInit(4, 25);call write~init~int(37, 25, 0, 1);call write~init~int(51, 25, 1, 1);call write~init~int(120, 25, 2, 1);call write~init~int(0, 25, 3, 1);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(2, 27);call write~init~int(10, 27, 0, 1);call write~init~int(0, 27, 1, 1);call #Ultimate.allocInit(11, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(49, 30);call #Ultimate.allocInit(7, 31);call write~init~int(109, 31, 0, 1);call write~init~int(97, 31, 1, 1);call write~init~int(115, 31, 2, 1);call write~init~int(116, 31, 3, 1);call write~init~int(101, 31, 4, 1);call write~init~int(114, 31, 5, 1);call write~init~int(0, 31, 6, 1);call #Ultimate.allocInit(6, 32);call write~init~int(115, 32, 0, 1);call write~init~int(108, 32, 1, 1);call write~init~int(97, 32, 2, 1);call write~init~int(118, 32, 3, 1);call write~init~int(101, 32, 4, 1);call write~init~int(0, 32, 5, 1);call #Ultimate.allocInit(9, 33);call #Ultimate.allocInit(43, 34);call #Ultimate.allocInit(30, 35);call #Ultimate.allocInit(12, 36);call #Ultimate.allocInit(12, 37);call #Ultimate.allocInit(5, 38);call write~init~int(44, 38, 0, 1);call write~init~int(32, 38, 1, 1);call write~init~int(82, 38, 2, 1);call write~init~int(79, 38, 3, 1);call write~init~int(0, 38, 4, 1);call #Ultimate.allocInit(15, 39);call #Ultimate.allocInit(50, 40);call #Ultimate.allocInit(5, 41);call write~init~int(49, 41, 0, 1);call write~init~int(46, 41, 1, 1);call write~init~int(48, 41, 2, 1);call write~init~int(52, 41, 3, 1);call write~init~int(0, 41, 4, 1);call #Ultimate.allocInit(28, 42);call #Ultimate.allocInit(10, 43);call #Ultimate.allocInit(11, 44);call #Ultimate.allocInit(11, 45);call #Ultimate.allocInit(12, 46);call #Ultimate.allocInit(10, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(5, 49);call write~init~int(100, 49, 0, 1);call write~init~int(111, 49, 1, 1);call write~init~int(110, 49, 2, 1);call write~init~int(101, 49, 3, 1);call write~init~int(0, 49, 4, 1);~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~verbose~0 := 0;~major~0 := 47;~name~0.base, ~name~0.offset := 3, 0;~cluster~0 := 64;~nice~0 := 0;~disable~0 := 0;~#drive0~0.base, ~#drive0~0.offset := 50, 0;call #Ultimate.allocInit(28, 50);call write~init~int(0, ~#drive0~0.base, ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 4 + ~#drive0~0.offset, 4);call write~init~int(0, ~#drive0~0.base, 8 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 12 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 16 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 20 + ~#drive0~0.offset, 4);call write~init~int(-1, ~#drive0~0.base, 24 + ~#drive0~0.offset, 4);~#drive1~0.base, ~#drive1~0.offset := 51, 0;call #Ultimate.allocInit(28, 51);call write~init~int(0, ~#drive1~0.base, ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 4 + ~#drive1~0.offset, 4);call write~init~int(0, ~#drive1~0.base, 8 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 12 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 16 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 20 + ~#drive1~0.offset, 4);call write~init~int(-1, ~#drive1~0.base, 24 + ~#drive1~0.offset, 4);~#drive2~0.base, ~#drive2~0.offset := 52, 0;call #Ultimate.allocInit(28, 52);call write~init~int(0, ~#drive2~0.base, ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 4 + ~#drive2~0.offset, 4);call write~init~int(0, ~#drive2~0.base, 8 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 12 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 16 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 20 + ~#drive2~0.offset, 4);call write~init~int(-1, ~#drive2~0.base, 24 + ~#drive2~0.offset, 4);~#drive3~0.base, ~#drive3~0.offset := 53, 0;call #Ultimate.allocInit(28, 53);call write~init~int(0, ~#drive3~0.base, ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 4 + ~#drive3~0.offset, 4);call write~init~int(0, ~#drive3~0.base, 8 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 12 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 16 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 20 + ~#drive3~0.offset, 4);call write~init~int(-1, ~#drive3~0.base, 24 + ~#drive3~0.offset, 4);~#drives~0.base, ~#drives~0.offset := 54, 0;call #Ultimate.allocInit(32, 54);call write~init~$Pointer$(~#drive0~0.base, ~#drive0~0.offset, ~#drives~0.base, ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive1~0.base, ~#drive1~0.offset, ~#drives~0.base, 8 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive2~0.base, ~#drive2~0.offset, ~#drives~0.base, 16 + ~#drives~0.offset, 8);call write~init~$Pointer$(~#drive3~0.base, ~#drive3~0.offset, ~#drives~0.base, 24 + ~#drives~0.offset, 8);~pf_drive_count~0 := 0;~#pf_mutex~0.base, ~#pf_mutex~0.offset := 55, 0;call #Ultimate.allocInit(156, 55);call write~init~int(1, ~#pf_mutex~0.base, ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 4 + ~#pf_mutex~0.offset, 4);call write~init~int(3735899821, ~#pf_mutex~0.base, 8 + ~#pf_mutex~0.offset, 4);call write~init~int(4294967295, ~#pf_mutex~0.base, 12 + ~#pf_mutex~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_mutex~0.base, 16 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 24 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 32 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 40 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(4, 0, ~#pf_mutex~0.base, 48 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 56 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 60 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, 72 + ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 80 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 88 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 96 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(~#pf_mutex~0.base, ~#pf_mutex~0.offset, ~#pf_mutex~0.base, 104 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 112 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 120 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_mutex~0.base, 128 + ~#pf_mutex~0.offset, 8);call write~init~$Pointer$(5, 0, ~#pf_mutex~0.base, 136 + ~#pf_mutex~0.offset, 8);call write~init~int(0, ~#pf_mutex~0.base, 144 + ~#pf_mutex~0.offset, 4);call write~init~int(0, ~#pf_mutex~0.base, 148 + ~#pf_mutex~0.offset, 8);~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset := 56, 0;call #Ultimate.allocInit(68, 56);call write~init~int(0, ~#pf_spin_lock~0.base, ~#pf_spin_lock~0.offset, 4);call write~init~int(3735899821, ~#pf_spin_lock~0.base, 4 + ~#pf_spin_lock~0.offset, 4);call write~init~int(4294967295, ~#pf_spin_lock~0.base, 8 + ~#pf_spin_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#pf_spin_lock~0.base, 12 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 20 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 28 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_spin_lock~0.base, 36 + ~#pf_spin_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#pf_spin_lock~0.base, 44 + ~#pf_spin_lock~0.offset, 8);call write~init~int(0, ~#pf_spin_lock~0.base, 52 + ~#pf_spin_lock~0.offset, 4);call write~init~int(0, ~#pf_spin_lock~0.base, 56 + ~#pf_spin_lock~0.offset, 8);~ps_continuation~0.base, ~ps_continuation~0.offset := 0, 0;~ps_ready~0.base, ~ps_ready~0.offset := 0, 0;~ps_timeout~0 := 0;~ps_tq_active~0 := 0;~ps_nice~0 := 0;~#ps_spinlock~0.base, ~#ps_spinlock~0.offset := 57, 0;call #Ultimate.allocInit(68, 57);call write~init~int(0, ~#ps_spinlock~0.base, ~#ps_spinlock~0.offset, 4);call write~init~int(3735899821, ~#ps_spinlock~0.base, 4 + ~#ps_spinlock~0.offset, 4);call write~init~int(4294967295, ~#ps_spinlock~0.base, 8 + ~#ps_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#ps_spinlock~0.base, 12 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 20 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 28 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_spinlock~0.base, 36 + ~#ps_spinlock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#ps_spinlock~0.base, 44 + ~#ps_spinlock~0.offset, 8);call write~init~int(0, ~#ps_spinlock~0.base, 52 + ~#ps_spinlock~0.offset, 4);call write~init~int(0, ~#ps_spinlock~0.base, 56 + ~#ps_spinlock~0.offset, 8);~#ps_tq~0.base, ~#ps_tq~0.offset := 58, 0;call #Ultimate.allocInit(204, 58);call write~init~int(4195344, ~#ps_tq~0.base, ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, 8 + ~#ps_tq~0.offset, ~#ps_tq~0.base, 16 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~ps_tq_int.base, #funAddr~ps_tq_int.offset, ~#ps_tq~0.base, 24 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(~#ps_tq~0.base, ~#ps_tq~0.offset, ~#ps_tq~0.base, 32 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 40 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 48 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(8, 0, ~#ps_tq~0.base, 56 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 64 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 68 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 76 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 1953723489, ~#ps_tq~0.base, 84 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 92 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, (if (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 else (2 + (~#boot_tvec_bases~0.base + ~#boot_tvec_bases~0.offset)) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~#ps_tq~0.base, 100 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(#funAddr~delayed_work_timer_fn.base, #funAddr~delayed_work_timer_fn.offset, ~#ps_tq~0.base, 108 + ~#ps_tq~0.offset, 8);call write~init~int(~#ps_tq~0.base + ~#ps_tq~0.offset, ~#ps_tq~0.base, 116 + ~#ps_tq~0.offset, 8);call write~init~int(-1, ~#ps_tq~0.base, 124 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 128 + ~#ps_tq~0.offset, 4);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 132 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 140 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 141 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 142 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 143 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 144 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 145 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 146 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 147 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 148 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 149 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 150 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 151 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 152 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 153 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 154 + ~#ps_tq~0.offset, 1);call write~init~int(0, ~#ps_tq~0.base, 155 + ~#ps_tq~0.offset, 1);call write~init~$Pointer$(9, 0, ~#ps_tq~0.base, 156 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 164 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ps_tq~0.base, 172 + ~#ps_tq~0.offset, 8);call write~init~$Pointer$(10, 0, ~#ps_tq~0.base, 180 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 188 + ~#ps_tq~0.offset, 4);call write~init~int(0, ~#ps_tq~0.base, 192 + ~#ps_tq~0.offset, 8);call write~init~int(0, ~#ps_tq~0.base, 200 + ~#ps_tq~0.offset, 4);~#units~0.base, ~#units~0.offset := 59, 0;call #Ultimate.allocInit(864, 59);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#units~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#units~0.base);~#pf_scratch~0.base, ~#pf_scratch~0.offset := 60, 0;call #Ultimate.allocInit(512, 60);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pf_scratch~0.base);~pf_retries~0 := 0;~pf_busy~0 := 0;~pf_req~0.base, ~pf_req~0.offset := 0, 0;~pf_block~0 := 0;~pf_count~0 := 0;~pf_run~0 := 0;~pf_cmd~0 := 0;~pf_current~0.base, ~pf_current~0.offset := 0, 0;~pf_mask~0 := 0;~pf_buf~0.base, ~pf_buf~0.offset := 0, 0;~#pf_fops~0.base, ~#pf_fops~0.offset := 61, 0;call #Ultimate.allocInit(96, 61);call write~init~$Pointer$(#funAddr~pf_open.base, #funAddr~pf_open.offset, ~#pf_fops~0.base, ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_release.base, #funAddr~pf_release.offset, ~#pf_fops~0.base, 8 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_ioctl.base, #funAddr~pf_ioctl.offset, ~#pf_fops~0.base, 16 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 24 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 32 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_check_events.base, #funAddr~pf_check_events.offset, ~#pf_fops~0.base, 40 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 48 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 56 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 64 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~pf_getgeo.base, #funAddr~pf_getgeo.offset, ~#pf_fops~0.base, 72 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#pf_fops~0.base, 80 + ~#pf_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#pf_fops~0.base, 88 + ~#pf_fops~0.offset, 8);~pf_queue~0.base, ~pf_queue~0.offset := 0, 0;~ldv_retval_pf_init~0 := 0;~ldvarg3~0 := 0;~ldvarg0~0 := 0;~pf_fops_group2~0.base, ~pf_fops_group2~0.offset := 0, 0;~pf_fops_group1~0.base, ~pf_fops_group1~0.offset := 0, 0;~ldvarg5~0.base, ~ldvarg5~0.offset := 0, 0;~ldvarg6~0 := 0;~ldvarg1~0 := 0;~ldv_retval_pf_open~0 := 0;~ldvarg4~0 := 0;~pf_fops_group0~0.base, ~pf_fops_group0~0.offset := 0, 0;~ldvarg2~0 := 0;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_pf_mutex~0 := 0; {75534#true} is VALID [2022-02-20 21:45:21,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {75534#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet305#1, main_#t~switch306#1, main_#t~nondet307#1, main_#t~switch308#1, main_#t~ret309#1, main_#t~ret310#1, main_#t~ret311#1, main_#t~ret312#1, main_#t~ret313#1, main_#t~ret314#1, main_#t~ret315#1, main_#t~ret316#1, main_#t~nondet317#1, main_#t~switch318#1, main_#t~ret319#1, main_~tmp~32#1, main_~tmp___0~15#1, main_~tmp___1~7#1;havoc main_~tmp~32#1;havoc main_~tmp___0~15#1;havoc main_~tmp___1~7#1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_cred_guard_mutex_of_signal_struct~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_pf_mutex~0 := 1; {75534#true} is VALID [2022-02-20 21:45:21,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {75534#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {75534#true} is VALID [2022-02-20 21:45:21,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {75534#true} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {75534#true} is VALID [2022-02-20 21:45:21,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {75534#true} assume !main_#t~switch306#1;main_#t~switch306#1 := main_#t~switch306#1 || 1 == main_~tmp~32#1; {75534#true} is VALID [2022-02-20 21:45:21,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {75534#true} assume main_#t~switch306#1; {75534#true} is VALID [2022-02-20 21:45:21,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {75534#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet317#1 && main_#t~nondet317#1 <= 2147483647;main_~tmp___1~7#1 := main_#t~nondet317#1;havoc main_#t~nondet317#1;main_#t~switch318#1 := 0 == main_~tmp___1~7#1; {75534#true} is VALID [2022-02-20 21:45:21,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {75534#true} assume !main_#t~switch318#1;main_#t~switch318#1 := main_#t~switch318#1 || 1 == main_~tmp___1~7#1; {75534#true} is VALID [2022-02-20 21:45:21,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {75534#true} assume main_#t~switch318#1; {75534#true} is VALID [2022-02-20 21:45:21,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {75534#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_pf_init } true;havoc pf_init_#res#1;havoc pf_init_#t~ret294#1, pf_init_#t~ret295#1, pf_init_#t~mem296#1.base, pf_init_#t~mem296#1.offset, pf_init_#t~ret297#1.base, pf_init_#t~ret297#1.offset, pf_init_#t~mem298#1.base, pf_init_#t~mem298#1.offset, pf_init_#t~mem299#1.base, pf_init_#t~mem299#1.offset, pf_init_#t~mem300#1, pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset, pf_init_~unit~2#1, pf_init_~tmp~31#1, pf_init_~tmp___0~14#1, pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset;havoc pf_init_~pf~6#1.base, pf_init_~pf~6#1.offset;havoc pf_init_~unit~2#1;havoc pf_init_~tmp~31#1;havoc pf_init_~tmp___0~14#1;havoc pf_init_~disk~1#1.base, pf_init_~disk~1#1.offset; {75534#true} is VALID [2022-02-20 21:45:21,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {75534#true} assume !(0 != ~disable~0);assume { :begin_inline_pf_init_units } true;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset, pf_init_units_#t~mem87#1.base, pf_init_units_#t~mem87#1.offset, pf_init_units_#t~mem88#1, pf_init_units_#t~mem89#1.base, pf_init_units_#t~mem89#1.offset, pf_init_units_#t~mem90#1, pf_init_units_#t~nondet91#1, pf_init_units_#t~strcpy~res92#1.base, pf_init_units_#t~strcpy~res92#1.offset, pf_init_units_#t~mem93#1.base, pf_init_units_#t~mem93#1.offset, pf_init_units_#t~mem94#1, pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset, pf_init_units_~unit~0#1, pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset, pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;havoc pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset;havoc pf_init_units_~unit~0#1;havoc pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset;havoc pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset;~pf_drive_count~0 := 0;pf_init_units_~unit~0#1 := 0;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := ~#units~0.base, ~#units~0.offset; {75534#true} is VALID [2022-02-20 21:45:21,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {75534#true} assume pf_init_units_~unit~0#1 <= 3; {75534#true} is VALID [2022-02-20 21:45:21,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {75534#true} call pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset := #Ultimate.allocOnHeap(1335);pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset := pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;havoc pf_init_units_#t~malloc86#1.base, pf_init_units_#t~malloc86#1.offset;pf_init_units_~disk~0#1.base, pf_init_units_~disk~0#1.offset := pf_init_units_~tmp~5#1.base, pf_init_units_~tmp~5#1.offset; {75534#true} is VALID [2022-02-20 21:45:21,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {75534#true} assume 0 == (pf_init_units_~disk~0#1.base + pf_init_units_~disk~0#1.offset) % 18446744073709551616; {75534#true} is VALID [2022-02-20 21:45:21,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {75534#true} pf_init_units_~unit~0#1 := 1 + pf_init_units_~unit~0#1;pf_init_units_~pf~0#1.base, pf_init_units_~pf~0#1.offset := pf_init_units_~pf~0#1.base, 216 + pf_init_units_~pf~0#1.offset; {75534#true} is VALID [2022-02-20 21:45:21,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {75534#true} assume !(pf_init_units_~unit~0#1 <= 3); {75534#true} is VALID [2022-02-20 21:45:21,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {75534#true} assume { :end_inline_pf_init_units } true;assume { :begin_inline_pf_detect } true;havoc pf_detect_#res#1;havoc pf_detect_#t~nondet227#1, pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, pf_detect_#t~ret229#1, pf_detect_#t~ret230#1, pf_detect_#t~mem231#1.base, pf_detect_#t~mem231#1.offset, pf_detect_#t~short232#1, pf_detect_#t~mem233#1.base, pf_detect_#t~mem233#1.offset, pf_detect_#t~mem234#1.base, pf_detect_#t~mem234#1.offset, pf_detect_#t~mem235#1, pf_detect_#t~mem236#1.base, pf_detect_#t~mem236#1.offset, pf_detect_#t~mem237#1, pf_detect_#t~mem238#1, pf_detect_#t~mem239#1, pf_detect_#t~mem240#1, pf_detect_#t~mem241#1, pf_detect_#t~ret242#1, pf_detect_#t~mem243#1.base, pf_detect_#t~mem243#1.offset, pf_detect_#t~ret244#1, pf_detect_#t~mem245#1.base, pf_detect_#t~mem245#1.offset, pf_detect_#t~mem246#1.base, pf_detect_#t~mem246#1.offset, pf_detect_#t~nondet247#1, pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset, pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset, pf_detect_~k~3#1, pf_detect_~unit~1#1, pf_detect_~tmp~20#1, pf_detect_~tmp___0~8#1, pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset, pf_detect_~tmp___1~4#1, pf_detect_~tmp___2~3#1;havoc pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset;havoc pf_detect_~k~3#1;havoc pf_detect_~unit~1#1;havoc pf_detect_~tmp~20#1;havoc pf_detect_~tmp___0~8#1;havoc pf_detect_~conf~0#1.base, pf_detect_~conf~0#1.offset;havoc pf_detect_~tmp___1~4#1;havoc pf_detect_~tmp___2~3#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;havoc pf_detect_#t~nondet227#1;pf_detect_~k~3#1 := 0; {75534#true} is VALID [2022-02-20 21:45:21,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {75534#true} assume 0 == ~pf_drive_count~0;call pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 168 + pf_detect_~pf~5#1.offset, 8); {75534#true} is VALID [2022-02-20 21:45:21,244 INFO L272 TraceCheckUtils]: 18: Hoare triple {75534#true} call pf_detect_#t~ret229#1 := pi_init(pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset, 1, -1, -1, -1, -1, -1, ~#pf_scratch~0.base, ~#pf_scratch~0.offset, 2, ~verbose~0 % 256, pf_detect_~pf~5#1.base, 200 + pf_detect_~pf~5#1.offset); {75534#true} is VALID [2022-02-20 21:45:21,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {75534#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2 := #in~arg2;~arg3 := #in~arg3;~arg4 := #in~arg4;~arg5 := #in~arg5;~arg6 := #in~arg6;~arg7.base, ~arg7.offset := #in~arg7.base, #in~arg7.offset;~arg8 := #in~arg8;~arg9 := #in~arg9;~arg10.base, ~arg10.offset := #in~arg10.base, #in~arg10.offset;assume -2147483648 <= #t~nondet350 && #t~nondet350 <= 2147483647;#res := #t~nondet350;havoc #t~nondet350; {75534#true} is VALID [2022-02-20 21:45:21,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {75534#true} assume true; {75534#true} is VALID [2022-02-20 21:45:21,244 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {75534#true} {75534#true} #1364#return; {75534#true} is VALID [2022-02-20 21:45:21,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {75534#true} assume -2147483648 <= pf_detect_#t~ret229#1 && pf_detect_#t~ret229#1 <= 2147483647;pf_detect_~tmp___0~8#1 := pf_detect_#t~ret229#1;havoc pf_detect_#t~mem228#1.base, pf_detect_#t~mem228#1.offset;havoc pf_detect_#t~ret229#1; {75534#true} is VALID [2022-02-20 21:45:21,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {75534#true} assume !(0 != pf_detect_~tmp___0~8#1); {75534#true} is VALID [2022-02-20 21:45:21,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {75534#true} assume !(0 != pf_detect_~k~3#1);havoc pf_detect_#t~nondet247#1;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := ~#units~0.base, ~#units~0.offset;pf_detect_~unit~1#1 := 0; {75534#true} is VALID [2022-02-20 21:45:21,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {75534#true} assume pf_detect_~unit~1#1 <= 3; {75534#true} is VALID [2022-02-20 21:45:21,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {75534#true} call pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset := read~$Pointer$(pf_detect_~pf~5#1.base, 208 + pf_detect_~pf~5#1.offset, 8); {75534#true} is VALID [2022-02-20 21:45:21,267 INFO L272 TraceCheckUtils]: 27: Hoare triple {75534#true} call put_disk(pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset); {75534#true} is VALID [2022-02-20 21:45:21,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {75534#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {75534#true} is VALID [2022-02-20 21:45:21,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {75534#true} assume true; {75534#true} is VALID [2022-02-20 21:45:21,267 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {75534#true} {75534#true} #1378#return; {75534#true} is VALID [2022-02-20 21:45:21,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {75534#true} havoc pf_detect_#t~mem248#1.base, pf_detect_#t~mem248#1.offset;pf_detect_~pf~5#1.base, pf_detect_~pf~5#1.offset := pf_detect_~pf~5#1.base, 216 + pf_detect_~pf~5#1.offset;pf_detect_~unit~1#1 := 1 + pf_detect_~unit~1#1; {75534#true} is VALID [2022-02-20 21:45:21,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {75534#true} assume !(pf_detect_~unit~1#1 <= 3); {75534#true} is VALID [2022-02-20 21:45:21,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {75534#true} pf_detect_#res#1 := -1; {75534#true} is VALID [2022-02-20 21:45:21,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {75534#true} pf_init_#t~ret294#1 := pf_detect_#res#1;assume { :end_inline_pf_detect } true;assume -2147483648 <= pf_init_#t~ret294#1 && pf_init_#t~ret294#1 <= 2147483647;pf_init_~tmp~31#1 := pf_init_#t~ret294#1;havoc pf_init_#t~ret294#1; {75534#true} is VALID [2022-02-20 21:45:21,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {75534#true} assume 0 != pf_init_~tmp~31#1;pf_init_#res#1 := -19; {75534#true} is VALID [2022-02-20 21:45:21,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {75534#true} main_#t~ret319#1 := pf_init_#res#1;assume { :end_inline_pf_init } true;assume -2147483648 <= main_#t~ret319#1 && main_#t~ret319#1 <= 2147483647;~ldv_retval_pf_init~0 := main_#t~ret319#1;havoc main_#t~ret319#1; {75534#true} is VALID [2022-02-20 21:45:21,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {75534#true} assume 0 == ~ldv_retval_pf_init~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1; {75667#(<= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:45:21,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {75667#(<= ~ldv_state_variable_1~0 1)} assume !(0 != ~ldv_retval_pf_init~0); {75667#(<= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:45:21,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {75667#(<= ~ldv_state_variable_1~0 1)} assume -2147483648 <= main_#t~nondet305#1 && main_#t~nondet305#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet305#1;havoc main_#t~nondet305#1;main_#t~switch306#1 := 0 == main_~tmp~32#1; {75667#(<= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:45:21,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {75667#(<= ~ldv_state_variable_1~0 1)} assume main_#t~switch306#1; {75667#(<= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:45:21,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {75667#(<= ~ldv_state_variable_1~0 1)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet307#1 && main_#t~nondet307#1 <= 2147483647;main_~tmp___0~15#1 := main_#t~nondet307#1;havoc main_#t~nondet307#1;main_#t~switch308#1 := 0 == main_~tmp___0~15#1; {75667#(<= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:45:21,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {75667#(<= ~ldv_state_variable_1~0 1)} assume !main_#t~switch308#1;main_#t~switch308#1 := main_#t~switch308#1 || 1 == main_~tmp___0~15#1; {75667#(<= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:45:21,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {75667#(<= ~ldv_state_variable_1~0 1)} assume !main_#t~switch308#1;main_#t~switch308#1 := main_#t~switch308#1 || 2 == main_~tmp___0~15#1; {75667#(<= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:45:21,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {75667#(<= ~ldv_state_variable_1~0 1)} assume !main_#t~switch308#1;main_#t~switch308#1 := main_#t~switch308#1 || 3 == main_~tmp___0~15#1; {75667#(<= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:45:21,271 INFO L290 TraceCheckUtils]: 45: Hoare triple {75667#(<= ~ldv_state_variable_1~0 1)} assume main_#t~switch308#1; {75667#(<= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:45:21,271 INFO L290 TraceCheckUtils]: 46: Hoare triple {75667#(<= ~ldv_state_variable_1~0 1)} assume 2 == ~ldv_state_variable_1~0;assume { :begin_inline_pf_release } true;pf_release_#in~disk#1.base, pf_release_#in~disk#1.offset, pf_release_#in~mode#1 := ~pf_fops_group2~0.base, ~pf_fops_group2~0.offset, ~ldvarg1~0;havoc pf_release_#res#1;havoc pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset, pf_release_#t~mem111#1, pf_release_#t~mem112#1, pf_release_#t~mem113#1, pf_release_#t~mem114#1, pf_release_#t~short115#1, pf_release_~disk#1.base, pf_release_~disk#1.offset, pf_release_~mode#1, pf_release_~pf~4#1.base, pf_release_~pf~4#1.offset;pf_release_~disk#1.base, pf_release_~disk#1.offset := pf_release_#in~disk#1.base, pf_release_#in~disk#1.offset;pf_release_~mode#1 := pf_release_#in~mode#1;havoc pf_release_~pf~4#1.base, pf_release_~pf~4#1.offset;call pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset := read~$Pointer$(pf_release_~disk#1.base, 1275 + pf_release_~disk#1.offset, 8);pf_release_~pf~4#1.base, pf_release_~pf~4#1.offset := pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset;havoc pf_release_#t~mem110#1.base, pf_release_#t~mem110#1.offset;assume { :begin_inline_ldv_mutex_lock_12 } true;ldv_mutex_lock_12_#in~ldv_func_arg1#1.base, ldv_mutex_lock_12_#in~ldv_func_arg1#1.offset := ~#pf_mutex~0.base, ~#pf_mutex~0.offset;havoc ldv_mutex_lock_12_~ldv_func_arg1#1.base, ldv_mutex_lock_12_~ldv_func_arg1#1.offset;ldv_mutex_lock_12_~ldv_func_arg1#1.base, ldv_mutex_lock_12_~ldv_func_arg1#1.offset := ldv_mutex_lock_12_#in~ldv_func_arg1#1.base, ldv_mutex_lock_12_#in~ldv_func_arg1#1.offset; {75535#false} is VALID [2022-02-20 21:45:21,272 INFO L272 TraceCheckUtils]: 47: Hoare triple {75535#false} call ldv_mutex_lock_pf_mutex(ldv_mutex_lock_12_~ldv_func_arg1#1.base, ldv_mutex_lock_12_~ldv_func_arg1#1.offset); {75535#false} is VALID [2022-02-20 21:45:21,272 INFO L290 TraceCheckUtils]: 48: Hoare triple {75535#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {75535#false} is VALID [2022-02-20 21:45:21,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {75535#false} assume 1 == ~ldv_mutex_pf_mutex~0; {75535#false} is VALID [2022-02-20 21:45:21,272 INFO L290 TraceCheckUtils]: 50: Hoare triple {75535#false} ~ldv_mutex_pf_mutex~0 := 2; {75535#false} is VALID [2022-02-20 21:45:21,273 INFO L290 TraceCheckUtils]: 51: Hoare triple {75535#false} assume true; {75535#false} is VALID [2022-02-20 21:45:21,273 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {75535#false} {75535#false} #1332#return; {75535#false} is VALID [2022-02-20 21:45:21,273 INFO L272 TraceCheckUtils]: 53: Hoare triple {75535#false} call mutex_lock(ldv_mutex_lock_12_~ldv_func_arg1#1.base, ldv_mutex_lock_12_~ldv_func_arg1#1.offset); {75535#false} is VALID [2022-02-20 21:45:21,273 INFO L290 TraceCheckUtils]: 54: Hoare triple {75535#false} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {75535#false} is VALID [2022-02-20 21:45:21,273 INFO L290 TraceCheckUtils]: 55: Hoare triple {75535#false} assume true; {75535#false} is VALID [2022-02-20 21:45:21,273 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {75535#false} {75535#false} #1334#return; {75535#false} is VALID [2022-02-20 21:45:21,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {75535#false} assume { :end_inline_ldv_mutex_lock_12 } true;call pf_release_#t~mem111#1 := read~int(pf_release_~pf~4#1.base, 192 + pf_release_~pf~4#1.offset, 4); {75535#false} is VALID [2022-02-20 21:45:21,273 INFO L290 TraceCheckUtils]: 58: Hoare triple {75535#false} assume pf_release_#t~mem111#1 <= 0;havoc pf_release_#t~mem111#1;assume { :begin_inline_ldv_mutex_unlock_13 } true;ldv_mutex_unlock_13_#in~ldv_func_arg1#1.base, ldv_mutex_unlock_13_#in~ldv_func_arg1#1.offset := ~#pf_mutex~0.base, ~#pf_mutex~0.offset;havoc ldv_mutex_unlock_13_~ldv_func_arg1#1.base, ldv_mutex_unlock_13_~ldv_func_arg1#1.offset;ldv_mutex_unlock_13_~ldv_func_arg1#1.base, ldv_mutex_unlock_13_~ldv_func_arg1#1.offset := ldv_mutex_unlock_13_#in~ldv_func_arg1#1.base, ldv_mutex_unlock_13_#in~ldv_func_arg1#1.offset; {75535#false} is VALID [2022-02-20 21:45:21,274 INFO L272 TraceCheckUtils]: 59: Hoare triple {75535#false} call ldv_mutex_unlock_pf_mutex(ldv_mutex_unlock_13_~ldv_func_arg1#1.base, ldv_mutex_unlock_13_~ldv_func_arg1#1.offset); {75535#false} is VALID [2022-02-20 21:45:21,274 INFO L290 TraceCheckUtils]: 60: Hoare triple {75535#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {75535#false} is VALID [2022-02-20 21:45:21,274 INFO L290 TraceCheckUtils]: 61: Hoare triple {75535#false} assume !(2 == ~ldv_mutex_pf_mutex~0); {75535#false} is VALID [2022-02-20 21:45:21,274 INFO L272 TraceCheckUtils]: 62: Hoare triple {75535#false} call ldv_error(); {75535#false} is VALID [2022-02-20 21:45:21,274 INFO L290 TraceCheckUtils]: 63: Hoare triple {75535#false} assume !false; {75535#false} is VALID [2022-02-20 21:45:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 21:45:21,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:45:21,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598682869] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:45:21,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:45:21,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-02-20 21:45:21,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076381613] [2022-02-20 21:45:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:45:21,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-02-20 21:45:21,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:45:21,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:45:21,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:21,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:45:21,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:45:21,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:45:21,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:45:21,325 INFO L87 Difference]: Start difference. First operand 1448 states and 1960 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:45:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:25,392 INFO L93 Difference]: Finished difference Result 3702 states and 4991 transitions. [2022-02-20 21:45:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:45:25,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-02-20 21:45:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:45:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:45:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1927 transitions. [2022-02-20 21:45:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:45:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1927 transitions. [2022-02-20 21:45:25,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1927 transitions. [2022-02-20 21:45:26,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1927 edges. 1927 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:45:27,002 INFO L225 Difference]: With dead ends: 3702 [2022-02-20 21:45:27,003 INFO L226 Difference]: Without dead ends: 2257 [2022-02-20 21:45:27,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:45:27,006 INFO L933 BasicCegarLoop]: 737 mSDtfsCounter, 614 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:45:27,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [614 Valid, 1344 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:45:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2022-02-20 21:45:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2254. [2022-02-20 21:45:27,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:45:27,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2257 states. Second operand has 2254 states, 1600 states have (on average 1.306875) internal successors, (2091), 1621 states have internal predecessors, (2091), 467 states have call successors, (467), 187 states have call predecessors, (467), 186 states have return successors, (466), 466 states have call predecessors, (466), 466 states have call successors, (466) [2022-02-20 21:45:27,317 INFO L74 IsIncluded]: Start isIncluded. First operand 2257 states. Second operand has 2254 states, 1600 states have (on average 1.306875) internal successors, (2091), 1621 states have internal predecessors, (2091), 467 states have call successors, (467), 187 states have call predecessors, (467), 186 states have return successors, (466), 466 states have call predecessors, (466), 466 states have call successors, (466) [2022-02-20 21:45:27,319 INFO L87 Difference]: Start difference. First operand 2257 states. Second operand has 2254 states, 1600 states have (on average 1.306875) internal successors, (2091), 1621 states have internal predecessors, (2091), 467 states have call successors, (467), 187 states have call predecessors, (467), 186 states have return successors, (466), 466 states have call predecessors, (466), 466 states have call successors, (466) [2022-02-20 21:45:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:27,472 INFO L93 Difference]: Finished difference Result 2257 states and 3026 transitions. [2022-02-20 21:45:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3026 transitions. [2022-02-20 21:45:27,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:27,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:27,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 2254 states, 1600 states have (on average 1.306875) internal successors, (2091), 1621 states have internal predecessors, (2091), 467 states have call successors, (467), 187 states have call predecessors, (467), 186 states have return successors, (466), 466 states have call predecessors, (466), 466 states have call successors, (466) Second operand 2257 states. [2022-02-20 21:45:27,481 INFO L87 Difference]: Start difference. First operand has 2254 states, 1600 states have (on average 1.306875) internal successors, (2091), 1621 states have internal predecessors, (2091), 467 states have call successors, (467), 187 states have call predecessors, (467), 186 states have return successors, (466), 466 states have call predecessors, (466), 466 states have call successors, (466) Second operand 2257 states. [2022-02-20 21:45:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:45:27,635 INFO L93 Difference]: Finished difference Result 2257 states and 3026 transitions. [2022-02-20 21:45:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3026 transitions. [2022-02-20 21:45:27,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:45:27,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:45:27,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:45:27,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:45:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 1600 states have (on average 1.306875) internal successors, (2091), 1621 states have internal predecessors, (2091), 467 states have call successors, (467), 187 states have call predecessors, (467), 186 states have return successors, (466), 466 states have call predecessors, (466), 466 states have call successors, (466)