./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.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/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.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 106df4f5c2a241158f9b42d6bacea5fef4152f7015c080096ac6f687357e10b4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:48:43,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:48:43,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:48:43,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:48:43,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:48:43,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:48:43,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:48:43,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:48:43,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:48:43,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:48:43,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:48:43,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:48:43,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:48:43,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:48:43,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:48:43,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:48:43,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:48:43,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:48:43,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:48:43,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:48:43,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:48:43,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:48:43,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:48:43,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:48:43,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:48:43,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:48:43,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:48:43,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:48:43,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:48:43,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:48:43,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:48:43,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:48:43,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:48:43,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:48:43,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:48:43,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:48:43,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:48:43,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:48:43,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:48:43,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:48:43,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:48:43,528 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:48:43,553 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:48:43,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:48:43,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:48:43,554 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:48:43,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:48:43,556 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:48:43,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:48:43,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:48:43,556 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:48:43,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:48:43,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:48:43,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:48:43,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:48:43,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:48:43,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:48:43,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:48:43,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:48:43,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:48:43,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:48:43,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:48:43,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:48:43,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:48:43,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:48:43,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:48:43,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:48:43,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:48:43,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:48:43,560 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:48:43,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:48:43,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:48:43,561 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 -> 106df4f5c2a241158f9b42d6bacea5fef4152f7015c080096ac6f687357e10b4 [2022-02-20 21:48:43,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:48:43,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:48:43,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:48:43,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:48:43,783 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:48:43,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2022-02-20 21:48:43,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b2df83f/679eb24da6914fc19243f65f53041098/FLAG52eb208d7 [2022-02-20 21:48:44,383 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:48:44,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2022-02-20 21:48:44,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b2df83f/679eb24da6914fc19243f65f53041098/FLAG52eb208d7 [2022-02-20 21:48:44,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b2df83f/679eb24da6914fc19243f65f53041098 [2022-02-20 21:48:44,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:48:44,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:48:44,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:48:44,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:48:44,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:48:44,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:48:44" (1/1) ... [2022-02-20 21:48:44,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eaedd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:44, skipping insertion in model container [2022-02-20 21:48:44,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:48:44" (1/1) ... [2022-02-20 21:48:44,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:48:44,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:48:45,833 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/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i[247200,247213] [2022-02-20 21:48:45,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:48:45,950 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:48:46,207 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/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i[247200,247213] [2022-02-20 21:48:46,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:48:46,284 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:48:46,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:46 WrapperNode [2022-02-20 21:48:46,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:48:46,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:48:46,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:48:46,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:48:46,299 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:48:46" (1/1) ... [2022-02-20 21:48:46,356 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:48:46" (1/1) ... [2022-02-20 21:48:46,485 INFO L137 Inliner]: procedures = 216, calls = 1408, calls flagged for inlining = 108, calls inlined = 97, statements flattened = 3109 [2022-02-20 21:48:46,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:48:46,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:48:46,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:48:46,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:48:46,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:46" (1/1) ... [2022-02-20 21:48:46,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:46" (1/1) ... [2022-02-20 21:48:46,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:46" (1/1) ... [2022-02-20 21:48:46,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:46" (1/1) ... [2022-02-20 21:48:46,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:46" (1/1) ... [2022-02-20 21:48:46,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:46" (1/1) ... [2022-02-20 21:48:46,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:46" (1/1) ... [2022-02-20 21:48:46,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:48:46,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:48:46,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:48:46,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:48:46,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:46" (1/1) ... [2022-02-20 21:48:46,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:48:46,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:48:46,733 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:48:46,791 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:48:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-02-20 21:48:46,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-02-20 21:48:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2022-02-20 21:48:46,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2022-02-20 21:48:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-02-20 21:48:46,814 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-02-20 21:48:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:48:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:48:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-02-20 21:48:46,815 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-02-20 21:48:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2022-02-20 21:48:46,815 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2022-02-20 21:48:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:48:46,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:48:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2022-02-20 21:48:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2022-02-20 21:48:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2022-02-20 21:48:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2022-02-20 21:48:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-02-20 21:48:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-02-20 21:48:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:48:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:48:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2022-02-20 21:48:46,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2022-02-20 21:48:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2022-02-20 21:48:46,817 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2022-02-20 21:48:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 21:48:46,817 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 21:48:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:48:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-02-20 21:48:46,817 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-02-20 21:48:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-02-20 21:48:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-02-20 21:48:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:48:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 21:48:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 21:48:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2022-02-20 21:48:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2022-02-20 21:48:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:48:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:48:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-02-20 21:48:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-02-20 21:48:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-02-20 21:48:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-02-20 21:48:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-02-20 21:48:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-02-20 21:48:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 21:48:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 21:48:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-02-20 21:48:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-02-20 21:48:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-02-20 21:48:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-02-20 21:48:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-02-20 21:48:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-02-20 21:48:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2022-02-20 21:48:46,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2022-02-20 21:48:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-02-20 21:48:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-02-20 21:48:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2022-02-20 21:48:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2022-02-20 21:48:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2022-02-20 21:48:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2022-02-20 21:48:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-02-20 21:48:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-02-20 21:48:46,821 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2022-02-20 21:48:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2022-02-20 21:48:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:48:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-02-20 21:48:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-02-20 21:48:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 21:48:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 21:48:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:48:46,822 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-02-20 21:48:46,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-02-20 21:48:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-02-20 21:48:46,823 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-02-20 21:48:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:48:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:48:46,823 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:48:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-02-20 21:48:46,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-02-20 21:48:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-02-20 21:48:46,823 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-02-20 21:48:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:48:46,824 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:48:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-02-20 21:48:46,824 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-02-20 21:48:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2022-02-20 21:48:46,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2022-02-20 21:48:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:48:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2022-02-20 21:48:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2022-02-20 21:48:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2022-02-20 21:48:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2022-02-20 21:48:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:48:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:48:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2022-02-20 21:48:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2022-02-20 21:48:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2022-02-20 21:48:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2022-02-20 21:48:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:48:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:48:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:48:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2022-02-20 21:48:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2022-02-20 21:48:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 21:48:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 21:48:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-02-20 21:48:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-02-20 21:48:46,827 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2022-02-20 21:48:46,827 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2022-02-20 21:48:46,827 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-02-20 21:48:46,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-02-20 21:48:46,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:48:46,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:48:46,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:48:47,420 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:48:47,422 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:48:52,199 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:48:52,221 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:48:52,223 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:48:52,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:48:52 BoogieIcfgContainer [2022-02-20 21:48:52,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:48:52,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:48:52,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:48:52,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:48:52,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:48:44" (1/3) ... [2022-02-20 21:48:52,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a524074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:48:52, skipping insertion in model container [2022-02-20 21:48:52,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:46" (2/3) ... [2022-02-20 21:48:52,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a524074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:48:52, skipping insertion in model container [2022-02-20 21:48:52,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:48:52" (3/3) ... [2022-02-20 21:48:52,240 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2022-02-20 21:48:52,245 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:48:52,245 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:48:52,291 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:48:52,297 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:48:52,297 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:48:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 967 states, 711 states have (on average 1.3389592123769338) internal successors, (952), 731 states have internal predecessors, (952), 204 states have call successors, (204), 50 states have call predecessors, (204), 50 states have return successors, (204), 198 states have call predecessors, (204), 204 states have call successors, (204) [2022-02-20 21:48:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 21:48:52,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:48:52,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:48:52,355 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:48:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:48:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash -290765991, now seen corresponding path program 1 times [2022-02-20 21:48:52,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:48:52,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457382666] [2022-02-20 21:48:52,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:48:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:48:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:48:52,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {970#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(85, 2);call #Ultimate.allocInit(110, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(38, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(32, 7);call #Ultimate.allocInit(21, 8);call #Ultimate.allocInit(17, 9);call #Ultimate.allocInit(21, 10);call #Ultimate.allocInit(44, 11);call #Ultimate.allocInit(21, 12);call #Ultimate.allocInit(4, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(10, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(23, 14);call #Ultimate.allocInit(31, 15);call #Ultimate.allocInit(23, 16);call #Ultimate.allocInit(14, 17);call #Ultimate.allocInit(23, 18);call #Ultimate.allocInit(8, 19);call #Ultimate.allocInit(2, 20);call write~init~int(10, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(43, 21);call #Ultimate.allocInit(23, 22);call #Ultimate.allocInit(42, 23);call #Ultimate.allocInit(23, 24);call #Ultimate.allocInit(13, 25);call #Ultimate.allocInit(23, 26);call #Ultimate.allocInit(8, 27);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);call #Ultimate.allocInit(4, 29);call write~init~int(37, 29, 0, 1);call write~init~int(115, 29, 1, 1);call write~init~int(10, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(24, 30);call #Ultimate.allocInit(4, 31);call write~init~int(37, 31, 0, 1);call write~init~int(115, 31, 1, 1);call write~init~int(10, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(19, 32);call #Ultimate.allocInit(35, 33);call #Ultimate.allocInit(22, 34);call #Ultimate.allocInit(34, 35);call #Ultimate.allocInit(22, 36);call #Ultimate.allocInit(29, 37);call #Ultimate.allocInit(22, 38);call #Ultimate.allocInit(35, 39);call #Ultimate.allocInit(25, 40);call #Ultimate.allocInit(34, 41);call #Ultimate.allocInit(25, 42);call #Ultimate.allocInit(45, 43);call #Ultimate.allocInit(25, 44);call #Ultimate.allocInit(35, 45);call #Ultimate.allocInit(28, 46);call #Ultimate.allocInit(39, 47);call #Ultimate.allocInit(28, 48);call #Ultimate.allocInit(19, 49);call #Ultimate.allocInit(22, 50);call #Ultimate.allocInit(4, 51);call write~init~int(37, 51, 0, 1);call write~init~int(115, 51, 1, 1);call write~init~int(10, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(21, 52);call #Ultimate.allocInit(4, 53);call write~init~int(37, 53, 0, 1);call write~init~int(115, 53, 1, 1);call write~init~int(10, 53, 2, 1);call write~init~int(0, 53, 3, 1);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(4, 55);call write~init~int(37, 55, 0, 1);call write~init~int(115, 55, 1, 1);call write~init~int(10, 55, 2, 1);call write~init~int(0, 55, 3, 1);call #Ultimate.allocInit(25, 56);call #Ultimate.allocInit(40, 57);call #Ultimate.allocInit(25, 58);call #Ultimate.allocInit(4, 59);call write~init~int(37, 59, 0, 1);call write~init~int(115, 59, 1, 1);call write~init~int(10, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(24, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(12, 62);call #Ultimate.allocInit(11, 63);call #Ultimate.allocInit(17, 64);call #Ultimate.allocInit(2, 65);call write~init~int(10, 65, 0, 1);call write~init~int(0, 65, 1, 1);call #Ultimate.allocInit(27, 66);call #Ultimate.allocInit(27, 67);call #Ultimate.allocInit(45, 68);call #Ultimate.allocInit(25, 69);call #Ultimate.allocInit(42, 70);call #Ultimate.allocInit(26, 71);call #Ultimate.allocInit(4, 72);call write~init~int(37, 72, 0, 1);call write~init~int(115, 72, 1, 1);call write~init~int(10, 72, 2, 1);call write~init~int(0, 72, 3, 1);call #Ultimate.allocInit(25, 73);call #Ultimate.allocInit(4, 74);call write~init~int(37, 74, 0, 1);call write~init~int(115, 74, 1, 1);call write~init~int(10, 74, 2, 1);call write~init~int(0, 74, 3, 1);call #Ultimate.allocInit(21, 75);call #Ultimate.allocInit(15, 76);call #Ultimate.allocInit(22, 77);call #Ultimate.allocInit(4, 78);call write~init~int(37, 78, 0, 1);call write~init~int(115, 78, 1, 1);call write~init~int(10, 78, 2, 1);call write~init~int(0, 78, 3, 1);call #Ultimate.allocInit(20, 79);call #Ultimate.allocInit(4, 80);call write~init~int(37, 80, 0, 1);call write~init~int(115, 80, 1, 1);call write~init~int(10, 80, 2, 1);call write~init~int(0, 80, 3, 1);call #Ultimate.allocInit(24, 81);call #Ultimate.allocInit(4, 82);call write~init~int(37, 82, 0, 1);call write~init~int(115, 82, 1, 1);call write~init~int(10, 82, 2, 1);call write~init~int(0, 82, 3, 1);call #Ultimate.allocInit(25, 83);call #Ultimate.allocInit(46, 84);call #Ultimate.allocInit(25, 85);call #Ultimate.allocInit(36, 86);call #Ultimate.allocInit(8, 87);call #Ultimate.allocInit(25, 88);call #Ultimate.allocInit(27, 89);call #Ultimate.allocInit(14, 90);call #Ultimate.allocInit(4, 91);call write~init~int(37, 91, 0, 1);call write~init~int(115, 91, 1, 1);call write~init~int(10, 91, 2, 1);call write~init~int(0, 91, 3, 1);call #Ultimate.allocInit(21, 92);call #Ultimate.allocInit(4, 93);call write~init~int(37, 93, 0, 1);call write~init~int(115, 93, 1, 1);call write~init~int(10, 93, 2, 1);call write~init~int(0, 93, 3, 1);call #Ultimate.allocInit(19, 94);call #Ultimate.allocInit(16, 95);call #Ultimate.allocInit(16, 96);call #Ultimate.allocInit(4, 97);call write~init~int(37, 97, 0, 1);call write~init~int(115, 97, 1, 1);call write~init~int(10, 97, 2, 1);call write~init~int(0, 97, 3, 1);call #Ultimate.allocInit(19, 98);call #Ultimate.allocInit(33, 99);call #Ultimate.allocInit(19, 100);call #Ultimate.allocInit(54, 101);call #Ultimate.allocInit(19, 102);call #Ultimate.allocInit(89, 103);call #Ultimate.allocInit(19, 104);call #Ultimate.allocInit(34, 105);call #Ultimate.allocInit(4, 106);call write~init~int(37, 106, 0, 1);call write~init~int(115, 106, 1, 1);call write~init~int(10, 106, 2, 1);call write~init~int(0, 106, 3, 1);call #Ultimate.allocInit(19, 107);call #Ultimate.allocInit(41, 108);call #Ultimate.allocInit(34, 109);call #Ultimate.allocInit(64, 110);call #Ultimate.allocInit(19, 111);call #Ultimate.allocInit(4, 112);call write~init~int(37, 112, 0, 1);call write~init~int(115, 112, 1, 1);call write~init~int(10, 112, 2, 1);call write~init~int(0, 112, 3, 1);call #Ultimate.allocInit(19, 113);call #Ultimate.allocInit(43, 114);call #Ultimate.allocInit(19, 115);call #Ultimate.allocInit(35, 116);call #Ultimate.allocInit(19, 117);call #Ultimate.allocInit(38, 118);call #Ultimate.allocInit(19, 119);call #Ultimate.allocInit(35, 120);call #Ultimate.allocInit(19, 121);call #Ultimate.allocInit(35, 122);call #Ultimate.allocInit(19, 123);call #Ultimate.allocInit(4, 124);call write~init~int(37, 124, 0, 1);call write~init~int(115, 124, 1, 1);call write~init~int(10, 124, 2, 1);call write~init~int(0, 124, 3, 1);call #Ultimate.allocInit(19, 125);call #Ultimate.allocInit(4, 126);call write~init~int(37, 126, 0, 1);call write~init~int(115, 126, 1, 1);call write~init~int(10, 126, 2, 1);call write~init~int(0, 126, 3, 1);call #Ultimate.allocInit(18, 127);call #Ultimate.allocInit(4, 128);call write~init~int(37, 128, 0, 1);call write~init~int(115, 128, 1, 1);call write~init~int(10, 128, 2, 1);call write~init~int(0, 128, 3, 1);call #Ultimate.allocInit(19, 129);call #Ultimate.allocInit(38, 130);call #Ultimate.allocInit(4, 131);call write~init~int(37, 131, 0, 1);call write~init~int(115, 131, 1, 1);call write~init~int(10, 131, 2, 1);call write~init~int(0, 131, 3, 1);call #Ultimate.allocInit(16, 132);call #Ultimate.allocInit(31, 133);call #Ultimate.allocInit(16, 134);call #Ultimate.allocInit(71, 135);call #Ultimate.allocInit(42, 136);call #Ultimate.allocInit(4, 137);call write~init~int(37, 137, 0, 1);call write~init~int(115, 137, 1, 1);call write~init~int(10, 137, 2, 1);call write~init~int(0, 137, 3, 1);call #Ultimate.allocInit(21, 138);call #Ultimate.allocInit(10, 139);call #Ultimate.allocInit(23, 140);call #Ultimate.allocInit(10, 141);call #Ultimate.allocInit(23, 142);call #Ultimate.allocInit(10, 143);call #Ultimate.allocInit(23, 144);~debug~0 := 0;~output_pva~0 := 0;~enable_rc~0 := 0;~#adapter_nr~0.base, ~#adapter_nr~0.offset := 145, 0;call #Ultimate.allocInit(16, 145);call write~init~int(-1, ~#adapter_nr~0.base, ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 2 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 4 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 6 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 8 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 10 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 12 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 14 + ~#adapter_nr~0.offset, 2);~#rc_keys~0.base, ~#rc_keys~0.offset := 146, 0;call #Ultimate.allocInit(52, 146);call write~init~int(116, ~#rc_keys~0.base, ~#rc_keys~0.offset, 2);call write~init~int(113, ~#rc_keys~0.base, 2 + ~#rc_keys~0.offset, 2);call write~init~int(2, ~#rc_keys~0.base, 4 + ~#rc_keys~0.offset, 2);call write~init~int(3, ~#rc_keys~0.base, 6 + ~#rc_keys~0.offset, 2);call write~init~int(4, ~#rc_keys~0.base, 8 + ~#rc_keys~0.offset, 2);call write~init~int(5, ~#rc_keys~0.base, 10 + ~#rc_keys~0.offset, 2);call write~init~int(6, ~#rc_keys~0.base, 12 + ~#rc_keys~0.offset, 2);call write~init~int(7, ~#rc_keys~0.base, 14 + ~#rc_keys~0.offset, 2);call write~init~int(8, ~#rc_keys~0.base, 16 + ~#rc_keys~0.offset, 2);call write~init~int(9, ~#rc_keys~0.base, 18 + ~#rc_keys~0.offset, 2);call write~init~int(10, ~#rc_keys~0.base, 20 + ~#rc_keys~0.offset, 2);call write~init~int(11, ~#rc_keys~0.base, 22 + ~#rc_keys~0.offset, 2);call write~init~int(402, ~#rc_keys~0.base, 24 + ~#rc_keys~0.offset, 2);call write~init~int(114, ~#rc_keys~0.base, 26 + ~#rc_keys~0.offset, 2);call write~init~int(352, ~#rc_keys~0.base, 28 + ~#rc_keys~0.offset, 2);call write~init~int(115, ~#rc_keys~0.base, 30 + ~#rc_keys~0.offset, 2);call write~init~int(403, ~#rc_keys~0.base, 32 + ~#rc_keys~0.offset, 2);call write~init~int(412, ~#rc_keys~0.base, 34 + ~#rc_keys~0.offset, 2);call write~init~int(1, ~#rc_keys~0.base, 36 + ~#rc_keys~0.offset, 2);call write~init~int(398, ~#rc_keys~0.base, 38 + ~#rc_keys~0.offset, 2);call write~init~int(399, ~#rc_keys~0.base, 40 + ~#rc_keys~0.offset, 2);call write~init~int(400, ~#rc_keys~0.base, 42 + ~#rc_keys~0.offset, 2);call write~init~int(401, ~#rc_keys~0.base, 44 + ~#rc_keys~0.offset, 2);call write~init~int(357, ~#rc_keys~0.base, 46 + ~#rc_keys~0.offset, 2);call write~init~int(50, ~#rc_keys~0.base, 48 + ~#rc_keys~0.offset, 2);call write~init~int(385, ~#rc_keys~0.base, 50 + ~#rc_keys~0.offset, 2);~#fe_config~0.base, ~#fe_config~0.offset := 147, 0;call #Ultimate.allocInit(8, 147);call write~init~$Pointer$(#funAddr~fe_send_command.base, #funAddr~fe_send_command.offset, ~#fe_config~0.base, ~#fe_config~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~LDV_IN_INTERRUPT~0 := 0;~ldv_mutex_iso_mutex_of_ttusb_dec~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_usb_mutex_of_ttusb_dec~0 := 0; {970#true} is VALID [2022-02-20 21:48:52,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {970#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet807#1, main_#t~switch808#1, main_#t~ret809#1, main_#t~nondet810#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_ttusb_dec_probe_38_p1~0#1.base, main_~var_ttusb_dec_probe_38_p1~0#1.offset, main_~res_ttusb_dec_probe_38~0#1, main_~ldv_s_ttusb_dec_driver_usb_driver~0#1, main_~tmp~32#1, main_~tmp___0~13#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_ttusb_dec_probe_38_p1~0#1.base, main_~var_ttusb_dec_probe_38_p1~0#1.offset;havoc main_~res_ttusb_dec_probe_38~0#1;havoc main_~ldv_s_ttusb_dec_driver_usb_driver~0#1;havoc main_~tmp~32#1;havoc main_~tmp___0~13#1;main_~ldv_s_ttusb_dec_driver_usb_driver~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_iso_mutex_of_ttusb_dec~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_usb_mutex_of_ttusb_dec~0 := 1; {972#(= ~ldv_mutex_iso_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:48:52,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#(= ~ldv_mutex_iso_mutex_of_ttusb_dec~0 1)} assume { :end_inline_ldv_initialize } true; {972#(= ~ldv_mutex_iso_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:48:52,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {972#(= ~ldv_mutex_iso_mutex_of_ttusb_dec~0 1)} assume -2147483648 <= main_#t~nondet810#1 && main_#t~nondet810#1 <= 2147483647;main_~tmp___0~13#1 := main_#t~nondet810#1;havoc main_#t~nondet810#1; {972#(= ~ldv_mutex_iso_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:48:52,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {972#(= ~ldv_mutex_iso_mutex_of_ttusb_dec~0 1)} assume !(0 != main_~tmp___0~13#1 || 0 != main_~ldv_s_ttusb_dec_driver_usb_driver~0#1); {972#(= ~ldv_mutex_iso_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:48:52,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {972#(= ~ldv_mutex_iso_mutex_of_ttusb_dec~0 1)} assume { :begin_inline_ldv_check_final_state } true; {972#(= ~ldv_mutex_iso_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:48:52,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {972#(= ~ldv_mutex_iso_mutex_of_ttusb_dec~0 1)} assume !(1 == ~ldv_mutex_iso_mutex_of_ttusb_dec~0); {971#false} is VALID [2022-02-20 21:48:52,734 INFO L272 TraceCheckUtils]: 7: Hoare triple {971#false} call ldv_error(); {971#false} is VALID [2022-02-20 21:48:52,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {971#false} assume !false; {971#false} is VALID [2022-02-20 21:48:52,735 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:48:52,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:48:52,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457382666] [2022-02-20 21:48:52,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457382666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:48:52,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:48:52,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:48:52,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915672269] [2022-02-20 21:48:52,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:48:52,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2022-02-20 21:48:52,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:48:52,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:48:52,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:48:52,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:48:52,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:48:52,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:48:52,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:48:52,812 INFO L87 Difference]: Start difference. First operand has 967 states, 711 states have (on average 1.3389592123769338) internal successors, (952), 731 states have internal predecessors, (952), 204 states have call successors, (204), 50 states have call predecessors, (204), 50 states have return successors, (204), 198 states have call predecessors, (204), 204 states have call successors, (204) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:49:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:02,693 INFO L93 Difference]: Finished difference Result 2868 states and 4132 transitions. [2022-02-20 21:49:02,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:49:02,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2022-02-20 21:49:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:49:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:49:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4132 transitions. [2022-02-20 21:49:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:49:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4132 transitions. [2022-02-20 21:49:02,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4132 transitions. [2022-02-20 21:49:05,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4132 edges. 4132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:49:06,096 INFO L225 Difference]: With dead ends: 2868 [2022-02-20 21:49:06,096 INFO L226 Difference]: Without dead ends: 1898 [2022-02-20 21:49:06,108 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:49:06,111 INFO L933 BasicCegarLoop]: 1610 mSDtfsCounter, 1334 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 2919 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:49:06,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1334 Valid, 2919 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:49:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2022-02-20 21:49:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1893. [2022-02-20 21:49:06,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:49:06,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1898 states. Second operand has 1893 states, 1398 states have (on average 1.3233190271816881) internal successors, (1850), 1429 states have internal predecessors, (1850), 397 states have call successors, (397), 99 states have call predecessors, (397), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:06,266 INFO L74 IsIncluded]: Start isIncluded. First operand 1898 states. Second operand has 1893 states, 1398 states have (on average 1.3233190271816881) internal successors, (1850), 1429 states have internal predecessors, (1850), 397 states have call successors, (397), 99 states have call predecessors, (397), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:06,271 INFO L87 Difference]: Start difference. First operand 1898 states. Second operand has 1893 states, 1398 states have (on average 1.3233190271816881) internal successors, (1850), 1429 states have internal predecessors, (1850), 397 states have call successors, (397), 99 states have call predecessors, (397), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:06,416 INFO L93 Difference]: Finished difference Result 1898 states and 2649 transitions. [2022-02-20 21:49:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2649 transitions. [2022-02-20 21:49:06,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:49:06,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:49:06,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 1893 states, 1398 states have (on average 1.3233190271816881) internal successors, (1850), 1429 states have internal predecessors, (1850), 397 states have call successors, (397), 99 states have call predecessors, (397), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) Second operand 1898 states. [2022-02-20 21:49:06,443 INFO L87 Difference]: Start difference. First operand has 1893 states, 1398 states have (on average 1.3233190271816881) internal successors, (1850), 1429 states have internal predecessors, (1850), 397 states have call successors, (397), 99 states have call predecessors, (397), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) Second operand 1898 states. [2022-02-20 21:49:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:06,569 INFO L93 Difference]: Finished difference Result 1898 states and 2649 transitions. [2022-02-20 21:49:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2649 transitions. [2022-02-20 21:49:06,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:49:06,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:49:06,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:49:06,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:49:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1398 states have (on average 1.3233190271816881) internal successors, (1850), 1429 states have internal predecessors, (1850), 397 states have call successors, (397), 99 states have call predecessors, (397), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2645 transitions. [2022-02-20 21:49:06,773 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2645 transitions. Word has length 9 [2022-02-20 21:49:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:49:06,774 INFO L470 AbstractCegarLoop]: Abstraction has 1893 states and 2645 transitions. [2022-02-20 21:49:06,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:49:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2645 transitions. [2022-02-20 21:49:06,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 21:49:06,775 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:49:06,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:49:06,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:49:06,775 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:49:06,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:49:06,776 INFO L85 PathProgramCache]: Analyzing trace with hash -424214905, now seen corresponding path program 1 times [2022-02-20 21:49:06,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:49:06,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931358058] [2022-02-20 21:49:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:49:06,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:49:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:06,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {11445#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(85, 2);call #Ultimate.allocInit(110, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(38, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(32, 7);call #Ultimate.allocInit(21, 8);call #Ultimate.allocInit(17, 9);call #Ultimate.allocInit(21, 10);call #Ultimate.allocInit(44, 11);call #Ultimate.allocInit(21, 12);call #Ultimate.allocInit(4, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(10, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(23, 14);call #Ultimate.allocInit(31, 15);call #Ultimate.allocInit(23, 16);call #Ultimate.allocInit(14, 17);call #Ultimate.allocInit(23, 18);call #Ultimate.allocInit(8, 19);call #Ultimate.allocInit(2, 20);call write~init~int(10, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(43, 21);call #Ultimate.allocInit(23, 22);call #Ultimate.allocInit(42, 23);call #Ultimate.allocInit(23, 24);call #Ultimate.allocInit(13, 25);call #Ultimate.allocInit(23, 26);call #Ultimate.allocInit(8, 27);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);call #Ultimate.allocInit(4, 29);call write~init~int(37, 29, 0, 1);call write~init~int(115, 29, 1, 1);call write~init~int(10, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(24, 30);call #Ultimate.allocInit(4, 31);call write~init~int(37, 31, 0, 1);call write~init~int(115, 31, 1, 1);call write~init~int(10, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(19, 32);call #Ultimate.allocInit(35, 33);call #Ultimate.allocInit(22, 34);call #Ultimate.allocInit(34, 35);call #Ultimate.allocInit(22, 36);call #Ultimate.allocInit(29, 37);call #Ultimate.allocInit(22, 38);call #Ultimate.allocInit(35, 39);call #Ultimate.allocInit(25, 40);call #Ultimate.allocInit(34, 41);call #Ultimate.allocInit(25, 42);call #Ultimate.allocInit(45, 43);call #Ultimate.allocInit(25, 44);call #Ultimate.allocInit(35, 45);call #Ultimate.allocInit(28, 46);call #Ultimate.allocInit(39, 47);call #Ultimate.allocInit(28, 48);call #Ultimate.allocInit(19, 49);call #Ultimate.allocInit(22, 50);call #Ultimate.allocInit(4, 51);call write~init~int(37, 51, 0, 1);call write~init~int(115, 51, 1, 1);call write~init~int(10, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(21, 52);call #Ultimate.allocInit(4, 53);call write~init~int(37, 53, 0, 1);call write~init~int(115, 53, 1, 1);call write~init~int(10, 53, 2, 1);call write~init~int(0, 53, 3, 1);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(4, 55);call write~init~int(37, 55, 0, 1);call write~init~int(115, 55, 1, 1);call write~init~int(10, 55, 2, 1);call write~init~int(0, 55, 3, 1);call #Ultimate.allocInit(25, 56);call #Ultimate.allocInit(40, 57);call #Ultimate.allocInit(25, 58);call #Ultimate.allocInit(4, 59);call write~init~int(37, 59, 0, 1);call write~init~int(115, 59, 1, 1);call write~init~int(10, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(24, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(12, 62);call #Ultimate.allocInit(11, 63);call #Ultimate.allocInit(17, 64);call #Ultimate.allocInit(2, 65);call write~init~int(10, 65, 0, 1);call write~init~int(0, 65, 1, 1);call #Ultimate.allocInit(27, 66);call #Ultimate.allocInit(27, 67);call #Ultimate.allocInit(45, 68);call #Ultimate.allocInit(25, 69);call #Ultimate.allocInit(42, 70);call #Ultimate.allocInit(26, 71);call #Ultimate.allocInit(4, 72);call write~init~int(37, 72, 0, 1);call write~init~int(115, 72, 1, 1);call write~init~int(10, 72, 2, 1);call write~init~int(0, 72, 3, 1);call #Ultimate.allocInit(25, 73);call #Ultimate.allocInit(4, 74);call write~init~int(37, 74, 0, 1);call write~init~int(115, 74, 1, 1);call write~init~int(10, 74, 2, 1);call write~init~int(0, 74, 3, 1);call #Ultimate.allocInit(21, 75);call #Ultimate.allocInit(15, 76);call #Ultimate.allocInit(22, 77);call #Ultimate.allocInit(4, 78);call write~init~int(37, 78, 0, 1);call write~init~int(115, 78, 1, 1);call write~init~int(10, 78, 2, 1);call write~init~int(0, 78, 3, 1);call #Ultimate.allocInit(20, 79);call #Ultimate.allocInit(4, 80);call write~init~int(37, 80, 0, 1);call write~init~int(115, 80, 1, 1);call write~init~int(10, 80, 2, 1);call write~init~int(0, 80, 3, 1);call #Ultimate.allocInit(24, 81);call #Ultimate.allocInit(4, 82);call write~init~int(37, 82, 0, 1);call write~init~int(115, 82, 1, 1);call write~init~int(10, 82, 2, 1);call write~init~int(0, 82, 3, 1);call #Ultimate.allocInit(25, 83);call #Ultimate.allocInit(46, 84);call #Ultimate.allocInit(25, 85);call #Ultimate.allocInit(36, 86);call #Ultimate.allocInit(8, 87);call #Ultimate.allocInit(25, 88);call #Ultimate.allocInit(27, 89);call #Ultimate.allocInit(14, 90);call #Ultimate.allocInit(4, 91);call write~init~int(37, 91, 0, 1);call write~init~int(115, 91, 1, 1);call write~init~int(10, 91, 2, 1);call write~init~int(0, 91, 3, 1);call #Ultimate.allocInit(21, 92);call #Ultimate.allocInit(4, 93);call write~init~int(37, 93, 0, 1);call write~init~int(115, 93, 1, 1);call write~init~int(10, 93, 2, 1);call write~init~int(0, 93, 3, 1);call #Ultimate.allocInit(19, 94);call #Ultimate.allocInit(16, 95);call #Ultimate.allocInit(16, 96);call #Ultimate.allocInit(4, 97);call write~init~int(37, 97, 0, 1);call write~init~int(115, 97, 1, 1);call write~init~int(10, 97, 2, 1);call write~init~int(0, 97, 3, 1);call #Ultimate.allocInit(19, 98);call #Ultimate.allocInit(33, 99);call #Ultimate.allocInit(19, 100);call #Ultimate.allocInit(54, 101);call #Ultimate.allocInit(19, 102);call #Ultimate.allocInit(89, 103);call #Ultimate.allocInit(19, 104);call #Ultimate.allocInit(34, 105);call #Ultimate.allocInit(4, 106);call write~init~int(37, 106, 0, 1);call write~init~int(115, 106, 1, 1);call write~init~int(10, 106, 2, 1);call write~init~int(0, 106, 3, 1);call #Ultimate.allocInit(19, 107);call #Ultimate.allocInit(41, 108);call #Ultimate.allocInit(34, 109);call #Ultimate.allocInit(64, 110);call #Ultimate.allocInit(19, 111);call #Ultimate.allocInit(4, 112);call write~init~int(37, 112, 0, 1);call write~init~int(115, 112, 1, 1);call write~init~int(10, 112, 2, 1);call write~init~int(0, 112, 3, 1);call #Ultimate.allocInit(19, 113);call #Ultimate.allocInit(43, 114);call #Ultimate.allocInit(19, 115);call #Ultimate.allocInit(35, 116);call #Ultimate.allocInit(19, 117);call #Ultimate.allocInit(38, 118);call #Ultimate.allocInit(19, 119);call #Ultimate.allocInit(35, 120);call #Ultimate.allocInit(19, 121);call #Ultimate.allocInit(35, 122);call #Ultimate.allocInit(19, 123);call #Ultimate.allocInit(4, 124);call write~init~int(37, 124, 0, 1);call write~init~int(115, 124, 1, 1);call write~init~int(10, 124, 2, 1);call write~init~int(0, 124, 3, 1);call #Ultimate.allocInit(19, 125);call #Ultimate.allocInit(4, 126);call write~init~int(37, 126, 0, 1);call write~init~int(115, 126, 1, 1);call write~init~int(10, 126, 2, 1);call write~init~int(0, 126, 3, 1);call #Ultimate.allocInit(18, 127);call #Ultimate.allocInit(4, 128);call write~init~int(37, 128, 0, 1);call write~init~int(115, 128, 1, 1);call write~init~int(10, 128, 2, 1);call write~init~int(0, 128, 3, 1);call #Ultimate.allocInit(19, 129);call #Ultimate.allocInit(38, 130);call #Ultimate.allocInit(4, 131);call write~init~int(37, 131, 0, 1);call write~init~int(115, 131, 1, 1);call write~init~int(10, 131, 2, 1);call write~init~int(0, 131, 3, 1);call #Ultimate.allocInit(16, 132);call #Ultimate.allocInit(31, 133);call #Ultimate.allocInit(16, 134);call #Ultimate.allocInit(71, 135);call #Ultimate.allocInit(42, 136);call #Ultimate.allocInit(4, 137);call write~init~int(37, 137, 0, 1);call write~init~int(115, 137, 1, 1);call write~init~int(10, 137, 2, 1);call write~init~int(0, 137, 3, 1);call #Ultimate.allocInit(21, 138);call #Ultimate.allocInit(10, 139);call #Ultimate.allocInit(23, 140);call #Ultimate.allocInit(10, 141);call #Ultimate.allocInit(23, 142);call #Ultimate.allocInit(10, 143);call #Ultimate.allocInit(23, 144);~debug~0 := 0;~output_pva~0 := 0;~enable_rc~0 := 0;~#adapter_nr~0.base, ~#adapter_nr~0.offset := 145, 0;call #Ultimate.allocInit(16, 145);call write~init~int(-1, ~#adapter_nr~0.base, ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 2 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 4 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 6 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 8 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 10 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 12 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 14 + ~#adapter_nr~0.offset, 2);~#rc_keys~0.base, ~#rc_keys~0.offset := 146, 0;call #Ultimate.allocInit(52, 146);call write~init~int(116, ~#rc_keys~0.base, ~#rc_keys~0.offset, 2);call write~init~int(113, ~#rc_keys~0.base, 2 + ~#rc_keys~0.offset, 2);call write~init~int(2, ~#rc_keys~0.base, 4 + ~#rc_keys~0.offset, 2);call write~init~int(3, ~#rc_keys~0.base, 6 + ~#rc_keys~0.offset, 2);call write~init~int(4, ~#rc_keys~0.base, 8 + ~#rc_keys~0.offset, 2);call write~init~int(5, ~#rc_keys~0.base, 10 + ~#rc_keys~0.offset, 2);call write~init~int(6, ~#rc_keys~0.base, 12 + ~#rc_keys~0.offset, 2);call write~init~int(7, ~#rc_keys~0.base, 14 + ~#rc_keys~0.offset, 2);call write~init~int(8, ~#rc_keys~0.base, 16 + ~#rc_keys~0.offset, 2);call write~init~int(9, ~#rc_keys~0.base, 18 + ~#rc_keys~0.offset, 2);call write~init~int(10, ~#rc_keys~0.base, 20 + ~#rc_keys~0.offset, 2);call write~init~int(11, ~#rc_keys~0.base, 22 + ~#rc_keys~0.offset, 2);call write~init~int(402, ~#rc_keys~0.base, 24 + ~#rc_keys~0.offset, 2);call write~init~int(114, ~#rc_keys~0.base, 26 + ~#rc_keys~0.offset, 2);call write~init~int(352, ~#rc_keys~0.base, 28 + ~#rc_keys~0.offset, 2);call write~init~int(115, ~#rc_keys~0.base, 30 + ~#rc_keys~0.offset, 2);call write~init~int(403, ~#rc_keys~0.base, 32 + ~#rc_keys~0.offset, 2);call write~init~int(412, ~#rc_keys~0.base, 34 + ~#rc_keys~0.offset, 2);call write~init~int(1, ~#rc_keys~0.base, 36 + ~#rc_keys~0.offset, 2);call write~init~int(398, ~#rc_keys~0.base, 38 + ~#rc_keys~0.offset, 2);call write~init~int(399, ~#rc_keys~0.base, 40 + ~#rc_keys~0.offset, 2);call write~init~int(400, ~#rc_keys~0.base, 42 + ~#rc_keys~0.offset, 2);call write~init~int(401, ~#rc_keys~0.base, 44 + ~#rc_keys~0.offset, 2);call write~init~int(357, ~#rc_keys~0.base, 46 + ~#rc_keys~0.offset, 2);call write~init~int(50, ~#rc_keys~0.base, 48 + ~#rc_keys~0.offset, 2);call write~init~int(385, ~#rc_keys~0.base, 50 + ~#rc_keys~0.offset, 2);~#fe_config~0.base, ~#fe_config~0.offset := 147, 0;call #Ultimate.allocInit(8, 147);call write~init~$Pointer$(#funAddr~fe_send_command.base, #funAddr~fe_send_command.offset, ~#fe_config~0.base, ~#fe_config~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~LDV_IN_INTERRUPT~0 := 0;~ldv_mutex_iso_mutex_of_ttusb_dec~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_usb_mutex_of_ttusb_dec~0 := 0; {11445#true} is VALID [2022-02-20 21:49:06,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {11445#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet807#1, main_#t~switch808#1, main_#t~ret809#1, main_#t~nondet810#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_ttusb_dec_probe_38_p1~0#1.base, main_~var_ttusb_dec_probe_38_p1~0#1.offset, main_~res_ttusb_dec_probe_38~0#1, main_~ldv_s_ttusb_dec_driver_usb_driver~0#1, main_~tmp~32#1, main_~tmp___0~13#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_ttusb_dec_probe_38_p1~0#1.base, main_~var_ttusb_dec_probe_38_p1~0#1.offset;havoc main_~res_ttusb_dec_probe_38~0#1;havoc main_~ldv_s_ttusb_dec_driver_usb_driver~0#1;havoc main_~tmp~32#1;havoc main_~tmp___0~13#1;main_~ldv_s_ttusb_dec_driver_usb_driver~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_iso_mutex_of_ttusb_dec~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_usb_mutex_of_ttusb_dec~0 := 1; {11447#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:49:06,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {11447#(= ~ldv_mutex_lock~0 1)} assume { :end_inline_ldv_initialize } true; {11447#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:49:06,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {11447#(= ~ldv_mutex_lock~0 1)} assume -2147483648 <= main_#t~nondet810#1 && main_#t~nondet810#1 <= 2147483647;main_~tmp___0~13#1 := main_#t~nondet810#1;havoc main_#t~nondet810#1; {11447#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:49:06,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {11447#(= ~ldv_mutex_lock~0 1)} assume !(0 != main_~tmp___0~13#1 || 0 != main_~ldv_s_ttusb_dec_driver_usb_driver~0#1); {11447#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:49:06,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {11447#(= ~ldv_mutex_lock~0 1)} assume { :begin_inline_ldv_check_final_state } true; {11447#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:49:06,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {11447#(= ~ldv_mutex_lock~0 1)} assume 1 == ~ldv_mutex_iso_mutex_of_ttusb_dec~0; {11447#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:49:06,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {11447#(= ~ldv_mutex_lock~0 1)} assume !(1 == ~ldv_mutex_lock~0); {11446#false} is VALID [2022-02-20 21:49:06,848 INFO L272 TraceCheckUtils]: 8: Hoare triple {11446#false} call ldv_error(); {11446#false} is VALID [2022-02-20 21:49:06,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {11446#false} assume !false; {11446#false} is VALID [2022-02-20 21:49:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:49:06,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:49:06,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931358058] [2022-02-20 21:49:06,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931358058] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:49:06,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:49:06,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:49:06,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456652625] [2022-02-20 21:49:06,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:49:06,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 21:49:06,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:49:06,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:49:06,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:49:06,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:49:06,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:49:06,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:49:06,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:49:06,867 INFO L87 Difference]: Start difference. First operand 1893 states and 2645 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:49:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:11,315 INFO L93 Difference]: Finished difference Result 1895 states and 2646 transitions. [2022-02-20 21:49:11,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:49:11,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-02-20 21:49:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:49:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:49:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1336 transitions. [2022-02-20 21:49:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:49:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1336 transitions. [2022-02-20 21:49:11,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1336 transitions. [2022-02-20 21:49:12,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1336 edges. 1336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:49:12,551 INFO L225 Difference]: With dead ends: 1895 [2022-02-20 21:49:12,552 INFO L226 Difference]: Without dead ends: 1892 [2022-02-20 21:49:12,553 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:49:12,553 INFO L933 BasicCegarLoop]: 1332 mSDtfsCounter, 1326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1332 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:49:12,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1326 Valid, 1332 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:49:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2022-02-20 21:49:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1892. [2022-02-20 21:49:12,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:49:12,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1892 states. Second operand has 1892 states, 1398 states have (on average 1.3226037195994278) internal successors, (1849), 1428 states have internal predecessors, (1849), 396 states have call successors, (396), 99 states have call predecessors, (396), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:12,611 INFO L74 IsIncluded]: Start isIncluded. First operand 1892 states. Second operand has 1892 states, 1398 states have (on average 1.3226037195994278) internal successors, (1849), 1428 states have internal predecessors, (1849), 396 states have call successors, (396), 99 states have call predecessors, (396), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:12,628 INFO L87 Difference]: Start difference. First operand 1892 states. Second operand has 1892 states, 1398 states have (on average 1.3226037195994278) internal successors, (1849), 1428 states have internal predecessors, (1849), 396 states have call successors, (396), 99 states have call predecessors, (396), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:12,746 INFO L93 Difference]: Finished difference Result 1892 states and 2643 transitions. [2022-02-20 21:49:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2643 transitions. [2022-02-20 21:49:12,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:49:12,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:49:12,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 1892 states, 1398 states have (on average 1.3226037195994278) internal successors, (1849), 1428 states have internal predecessors, (1849), 396 states have call successors, (396), 99 states have call predecessors, (396), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) Second operand 1892 states. [2022-02-20 21:49:12,765 INFO L87 Difference]: Start difference. First operand has 1892 states, 1398 states have (on average 1.3226037195994278) internal successors, (1849), 1428 states have internal predecessors, (1849), 396 states have call successors, (396), 99 states have call predecessors, (396), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) Second operand 1892 states. [2022-02-20 21:49:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:12,885 INFO L93 Difference]: Finished difference Result 1892 states and 2643 transitions. [2022-02-20 21:49:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2643 transitions. [2022-02-20 21:49:12,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:49:12,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:49:12,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:49:12,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:49:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1398 states have (on average 1.3226037195994278) internal successors, (1849), 1428 states have internal predecessors, (1849), 396 states have call successors, (396), 99 states have call predecessors, (396), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2643 transitions. [2022-02-20 21:49:13,085 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2643 transitions. Word has length 10 [2022-02-20 21:49:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:49:13,086 INFO L470 AbstractCegarLoop]: Abstraction has 1892 states and 2643 transitions. [2022-02-20 21:49:13,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:49:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2643 transitions. [2022-02-20 21:49:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 21:49:13,086 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:49:13,087 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:49:13,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:49:13,087 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:49:13,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:49:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash -266159076, now seen corresponding path program 1 times [2022-02-20 21:49:13,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:49:13,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327190623] [2022-02-20 21:49:13,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:49:13,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:49:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:13,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {20537#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(85, 2);call #Ultimate.allocInit(110, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(38, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(32, 7);call #Ultimate.allocInit(21, 8);call #Ultimate.allocInit(17, 9);call #Ultimate.allocInit(21, 10);call #Ultimate.allocInit(44, 11);call #Ultimate.allocInit(21, 12);call #Ultimate.allocInit(4, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(10, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(23, 14);call #Ultimate.allocInit(31, 15);call #Ultimate.allocInit(23, 16);call #Ultimate.allocInit(14, 17);call #Ultimate.allocInit(23, 18);call #Ultimate.allocInit(8, 19);call #Ultimate.allocInit(2, 20);call write~init~int(10, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(43, 21);call #Ultimate.allocInit(23, 22);call #Ultimate.allocInit(42, 23);call #Ultimate.allocInit(23, 24);call #Ultimate.allocInit(13, 25);call #Ultimate.allocInit(23, 26);call #Ultimate.allocInit(8, 27);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);call #Ultimate.allocInit(4, 29);call write~init~int(37, 29, 0, 1);call write~init~int(115, 29, 1, 1);call write~init~int(10, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(24, 30);call #Ultimate.allocInit(4, 31);call write~init~int(37, 31, 0, 1);call write~init~int(115, 31, 1, 1);call write~init~int(10, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(19, 32);call #Ultimate.allocInit(35, 33);call #Ultimate.allocInit(22, 34);call #Ultimate.allocInit(34, 35);call #Ultimate.allocInit(22, 36);call #Ultimate.allocInit(29, 37);call #Ultimate.allocInit(22, 38);call #Ultimate.allocInit(35, 39);call #Ultimate.allocInit(25, 40);call #Ultimate.allocInit(34, 41);call #Ultimate.allocInit(25, 42);call #Ultimate.allocInit(45, 43);call #Ultimate.allocInit(25, 44);call #Ultimate.allocInit(35, 45);call #Ultimate.allocInit(28, 46);call #Ultimate.allocInit(39, 47);call #Ultimate.allocInit(28, 48);call #Ultimate.allocInit(19, 49);call #Ultimate.allocInit(22, 50);call #Ultimate.allocInit(4, 51);call write~init~int(37, 51, 0, 1);call write~init~int(115, 51, 1, 1);call write~init~int(10, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(21, 52);call #Ultimate.allocInit(4, 53);call write~init~int(37, 53, 0, 1);call write~init~int(115, 53, 1, 1);call write~init~int(10, 53, 2, 1);call write~init~int(0, 53, 3, 1);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(4, 55);call write~init~int(37, 55, 0, 1);call write~init~int(115, 55, 1, 1);call write~init~int(10, 55, 2, 1);call write~init~int(0, 55, 3, 1);call #Ultimate.allocInit(25, 56);call #Ultimate.allocInit(40, 57);call #Ultimate.allocInit(25, 58);call #Ultimate.allocInit(4, 59);call write~init~int(37, 59, 0, 1);call write~init~int(115, 59, 1, 1);call write~init~int(10, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(24, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(12, 62);call #Ultimate.allocInit(11, 63);call #Ultimate.allocInit(17, 64);call #Ultimate.allocInit(2, 65);call write~init~int(10, 65, 0, 1);call write~init~int(0, 65, 1, 1);call #Ultimate.allocInit(27, 66);call #Ultimate.allocInit(27, 67);call #Ultimate.allocInit(45, 68);call #Ultimate.allocInit(25, 69);call #Ultimate.allocInit(42, 70);call #Ultimate.allocInit(26, 71);call #Ultimate.allocInit(4, 72);call write~init~int(37, 72, 0, 1);call write~init~int(115, 72, 1, 1);call write~init~int(10, 72, 2, 1);call write~init~int(0, 72, 3, 1);call #Ultimate.allocInit(25, 73);call #Ultimate.allocInit(4, 74);call write~init~int(37, 74, 0, 1);call write~init~int(115, 74, 1, 1);call write~init~int(10, 74, 2, 1);call write~init~int(0, 74, 3, 1);call #Ultimate.allocInit(21, 75);call #Ultimate.allocInit(15, 76);call #Ultimate.allocInit(22, 77);call #Ultimate.allocInit(4, 78);call write~init~int(37, 78, 0, 1);call write~init~int(115, 78, 1, 1);call write~init~int(10, 78, 2, 1);call write~init~int(0, 78, 3, 1);call #Ultimate.allocInit(20, 79);call #Ultimate.allocInit(4, 80);call write~init~int(37, 80, 0, 1);call write~init~int(115, 80, 1, 1);call write~init~int(10, 80, 2, 1);call write~init~int(0, 80, 3, 1);call #Ultimate.allocInit(24, 81);call #Ultimate.allocInit(4, 82);call write~init~int(37, 82, 0, 1);call write~init~int(115, 82, 1, 1);call write~init~int(10, 82, 2, 1);call write~init~int(0, 82, 3, 1);call #Ultimate.allocInit(25, 83);call #Ultimate.allocInit(46, 84);call #Ultimate.allocInit(25, 85);call #Ultimate.allocInit(36, 86);call #Ultimate.allocInit(8, 87);call #Ultimate.allocInit(25, 88);call #Ultimate.allocInit(27, 89);call #Ultimate.allocInit(14, 90);call #Ultimate.allocInit(4, 91);call write~init~int(37, 91, 0, 1);call write~init~int(115, 91, 1, 1);call write~init~int(10, 91, 2, 1);call write~init~int(0, 91, 3, 1);call #Ultimate.allocInit(21, 92);call #Ultimate.allocInit(4, 93);call write~init~int(37, 93, 0, 1);call write~init~int(115, 93, 1, 1);call write~init~int(10, 93, 2, 1);call write~init~int(0, 93, 3, 1);call #Ultimate.allocInit(19, 94);call #Ultimate.allocInit(16, 95);call #Ultimate.allocInit(16, 96);call #Ultimate.allocInit(4, 97);call write~init~int(37, 97, 0, 1);call write~init~int(115, 97, 1, 1);call write~init~int(10, 97, 2, 1);call write~init~int(0, 97, 3, 1);call #Ultimate.allocInit(19, 98);call #Ultimate.allocInit(33, 99);call #Ultimate.allocInit(19, 100);call #Ultimate.allocInit(54, 101);call #Ultimate.allocInit(19, 102);call #Ultimate.allocInit(89, 103);call #Ultimate.allocInit(19, 104);call #Ultimate.allocInit(34, 105);call #Ultimate.allocInit(4, 106);call write~init~int(37, 106, 0, 1);call write~init~int(115, 106, 1, 1);call write~init~int(10, 106, 2, 1);call write~init~int(0, 106, 3, 1);call #Ultimate.allocInit(19, 107);call #Ultimate.allocInit(41, 108);call #Ultimate.allocInit(34, 109);call #Ultimate.allocInit(64, 110);call #Ultimate.allocInit(19, 111);call #Ultimate.allocInit(4, 112);call write~init~int(37, 112, 0, 1);call write~init~int(115, 112, 1, 1);call write~init~int(10, 112, 2, 1);call write~init~int(0, 112, 3, 1);call #Ultimate.allocInit(19, 113);call #Ultimate.allocInit(43, 114);call #Ultimate.allocInit(19, 115);call #Ultimate.allocInit(35, 116);call #Ultimate.allocInit(19, 117);call #Ultimate.allocInit(38, 118);call #Ultimate.allocInit(19, 119);call #Ultimate.allocInit(35, 120);call #Ultimate.allocInit(19, 121);call #Ultimate.allocInit(35, 122);call #Ultimate.allocInit(19, 123);call #Ultimate.allocInit(4, 124);call write~init~int(37, 124, 0, 1);call write~init~int(115, 124, 1, 1);call write~init~int(10, 124, 2, 1);call write~init~int(0, 124, 3, 1);call #Ultimate.allocInit(19, 125);call #Ultimate.allocInit(4, 126);call write~init~int(37, 126, 0, 1);call write~init~int(115, 126, 1, 1);call write~init~int(10, 126, 2, 1);call write~init~int(0, 126, 3, 1);call #Ultimate.allocInit(18, 127);call #Ultimate.allocInit(4, 128);call write~init~int(37, 128, 0, 1);call write~init~int(115, 128, 1, 1);call write~init~int(10, 128, 2, 1);call write~init~int(0, 128, 3, 1);call #Ultimate.allocInit(19, 129);call #Ultimate.allocInit(38, 130);call #Ultimate.allocInit(4, 131);call write~init~int(37, 131, 0, 1);call write~init~int(115, 131, 1, 1);call write~init~int(10, 131, 2, 1);call write~init~int(0, 131, 3, 1);call #Ultimate.allocInit(16, 132);call #Ultimate.allocInit(31, 133);call #Ultimate.allocInit(16, 134);call #Ultimate.allocInit(71, 135);call #Ultimate.allocInit(42, 136);call #Ultimate.allocInit(4, 137);call write~init~int(37, 137, 0, 1);call write~init~int(115, 137, 1, 1);call write~init~int(10, 137, 2, 1);call write~init~int(0, 137, 3, 1);call #Ultimate.allocInit(21, 138);call #Ultimate.allocInit(10, 139);call #Ultimate.allocInit(23, 140);call #Ultimate.allocInit(10, 141);call #Ultimate.allocInit(23, 142);call #Ultimate.allocInit(10, 143);call #Ultimate.allocInit(23, 144);~debug~0 := 0;~output_pva~0 := 0;~enable_rc~0 := 0;~#adapter_nr~0.base, ~#adapter_nr~0.offset := 145, 0;call #Ultimate.allocInit(16, 145);call write~init~int(-1, ~#adapter_nr~0.base, ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 2 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 4 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 6 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 8 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 10 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 12 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 14 + ~#adapter_nr~0.offset, 2);~#rc_keys~0.base, ~#rc_keys~0.offset := 146, 0;call #Ultimate.allocInit(52, 146);call write~init~int(116, ~#rc_keys~0.base, ~#rc_keys~0.offset, 2);call write~init~int(113, ~#rc_keys~0.base, 2 + ~#rc_keys~0.offset, 2);call write~init~int(2, ~#rc_keys~0.base, 4 + ~#rc_keys~0.offset, 2);call write~init~int(3, ~#rc_keys~0.base, 6 + ~#rc_keys~0.offset, 2);call write~init~int(4, ~#rc_keys~0.base, 8 + ~#rc_keys~0.offset, 2);call write~init~int(5, ~#rc_keys~0.base, 10 + ~#rc_keys~0.offset, 2);call write~init~int(6, ~#rc_keys~0.base, 12 + ~#rc_keys~0.offset, 2);call write~init~int(7, ~#rc_keys~0.base, 14 + ~#rc_keys~0.offset, 2);call write~init~int(8, ~#rc_keys~0.base, 16 + ~#rc_keys~0.offset, 2);call write~init~int(9, ~#rc_keys~0.base, 18 + ~#rc_keys~0.offset, 2);call write~init~int(10, ~#rc_keys~0.base, 20 + ~#rc_keys~0.offset, 2);call write~init~int(11, ~#rc_keys~0.base, 22 + ~#rc_keys~0.offset, 2);call write~init~int(402, ~#rc_keys~0.base, 24 + ~#rc_keys~0.offset, 2);call write~init~int(114, ~#rc_keys~0.base, 26 + ~#rc_keys~0.offset, 2);call write~init~int(352, ~#rc_keys~0.base, 28 + ~#rc_keys~0.offset, 2);call write~init~int(115, ~#rc_keys~0.base, 30 + ~#rc_keys~0.offset, 2);call write~init~int(403, ~#rc_keys~0.base, 32 + ~#rc_keys~0.offset, 2);call write~init~int(412, ~#rc_keys~0.base, 34 + ~#rc_keys~0.offset, 2);call write~init~int(1, ~#rc_keys~0.base, 36 + ~#rc_keys~0.offset, 2);call write~init~int(398, ~#rc_keys~0.base, 38 + ~#rc_keys~0.offset, 2);call write~init~int(399, ~#rc_keys~0.base, 40 + ~#rc_keys~0.offset, 2);call write~init~int(400, ~#rc_keys~0.base, 42 + ~#rc_keys~0.offset, 2);call write~init~int(401, ~#rc_keys~0.base, 44 + ~#rc_keys~0.offset, 2);call write~init~int(357, ~#rc_keys~0.base, 46 + ~#rc_keys~0.offset, 2);call write~init~int(50, ~#rc_keys~0.base, 48 + ~#rc_keys~0.offset, 2);call write~init~int(385, ~#rc_keys~0.base, 50 + ~#rc_keys~0.offset, 2);~#fe_config~0.base, ~#fe_config~0.offset := 147, 0;call #Ultimate.allocInit(8, 147);call write~init~$Pointer$(#funAddr~fe_send_command.base, #funAddr~fe_send_command.offset, ~#fe_config~0.base, ~#fe_config~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~LDV_IN_INTERRUPT~0 := 0;~ldv_mutex_iso_mutex_of_ttusb_dec~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_usb_mutex_of_ttusb_dec~0 := 0; {20537#true} is VALID [2022-02-20 21:49:13,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {20537#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet807#1, main_#t~switch808#1, main_#t~ret809#1, main_#t~nondet810#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_ttusb_dec_probe_38_p1~0#1.base, main_~var_ttusb_dec_probe_38_p1~0#1.offset, main_~res_ttusb_dec_probe_38~0#1, main_~ldv_s_ttusb_dec_driver_usb_driver~0#1, main_~tmp~32#1, main_~tmp___0~13#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_ttusb_dec_probe_38_p1~0#1.base, main_~var_ttusb_dec_probe_38_p1~0#1.offset;havoc main_~res_ttusb_dec_probe_38~0#1;havoc main_~ldv_s_ttusb_dec_driver_usb_driver~0#1;havoc main_~tmp~32#1;havoc main_~tmp___0~13#1;main_~ldv_s_ttusb_dec_driver_usb_driver~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_iso_mutex_of_ttusb_dec~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_usb_mutex_of_ttusb_dec~0 := 1; {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:49:13,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} assume { :end_inline_ldv_initialize } true; {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:49:13,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} assume -2147483648 <= main_#t~nondet810#1 && main_#t~nondet810#1 <= 2147483647;main_~tmp___0~13#1 := main_#t~nondet810#1;havoc main_#t~nondet810#1; {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:49:13,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(0 != main_~tmp___0~13#1 || 0 != main_~ldv_s_ttusb_dec_driver_usb_driver~0#1); {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:49:13,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} assume { :begin_inline_ldv_check_final_state } true; {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:49:13,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 1 == ~ldv_mutex_iso_mutex_of_ttusb_dec~0; {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:49:13,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 1 == ~ldv_mutex_lock~0; {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:49:13,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {20539#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(1 == ~ldv_mutex_mutex_of_device~0); {20538#false} is VALID [2022-02-20 21:49:13,164 INFO L272 TraceCheckUtils]: 9: Hoare triple {20538#false} call ldv_error(); {20538#false} is VALID [2022-02-20 21:49:13,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {20538#false} assume !false; {20538#false} is VALID [2022-02-20 21:49:13,164 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:49:13,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:49:13,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327190623] [2022-02-20 21:49:13,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327190623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:49:13,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:49:13,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:49:13,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867590750] [2022-02-20 21:49:13,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:49:13,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2022-02-20 21:49:13,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:49:13,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:49:13,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:49:13,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:49:13,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:49:13,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:49:13,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:49:13,182 INFO L87 Difference]: Start difference. First operand 1892 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:49:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:17,576 INFO L93 Difference]: Finished difference Result 1894 states and 2644 transitions. [2022-02-20 21:49:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:49:17,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2022-02-20 21:49:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:49:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:49:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1334 transitions. [2022-02-20 21:49:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:49:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1334 transitions. [2022-02-20 21:49:17,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1334 transitions. [2022-02-20 21:49:18,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1334 edges. 1334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:49:18,866 INFO L225 Difference]: With dead ends: 1894 [2022-02-20 21:49:18,867 INFO L226 Difference]: Without dead ends: 1891 [2022-02-20 21:49:18,867 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:49:18,868 INFO L933 BasicCegarLoop]: 1330 mSDtfsCounter, 1323 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1330 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:49:18,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1323 Valid, 1330 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:49:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2022-02-20 21:49:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1891. [2022-02-20 21:49:18,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:49:18,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1891 states. Second operand has 1891 states, 1398 states have (on average 1.3218884120171674) internal successors, (1848), 1427 states have internal predecessors, (1848), 395 states have call successors, (395), 99 states have call predecessors, (395), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:18,915 INFO L74 IsIncluded]: Start isIncluded. First operand 1891 states. Second operand has 1891 states, 1398 states have (on average 1.3218884120171674) internal successors, (1848), 1427 states have internal predecessors, (1848), 395 states have call successors, (395), 99 states have call predecessors, (395), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:18,919 INFO L87 Difference]: Start difference. First operand 1891 states. Second operand has 1891 states, 1398 states have (on average 1.3218884120171674) internal successors, (1848), 1427 states have internal predecessors, (1848), 395 states have call successors, (395), 99 states have call predecessors, (395), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:19,036 INFO L93 Difference]: Finished difference Result 1891 states and 2641 transitions. [2022-02-20 21:49:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2641 transitions. [2022-02-20 21:49:19,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:49:19,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:49:19,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 1891 states, 1398 states have (on average 1.3218884120171674) internal successors, (1848), 1427 states have internal predecessors, (1848), 395 states have call successors, (395), 99 states have call predecessors, (395), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) Second operand 1891 states. [2022-02-20 21:49:19,051 INFO L87 Difference]: Start difference. First operand has 1891 states, 1398 states have (on average 1.3218884120171674) internal successors, (1848), 1427 states have internal predecessors, (1848), 395 states have call successors, (395), 99 states have call predecessors, (395), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) Second operand 1891 states. [2022-02-20 21:49:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:19,169 INFO L93 Difference]: Finished difference Result 1891 states and 2641 transitions. [2022-02-20 21:49:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2641 transitions. [2022-02-20 21:49:19,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:49:19,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:49:19,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:49:19,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:49:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1398 states have (on average 1.3218884120171674) internal successors, (1848), 1427 states have internal predecessors, (1848), 395 states have call successors, (395), 99 states have call predecessors, (395), 97 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-02-20 21:49:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2641 transitions. [2022-02-20 21:49:19,368 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2641 transitions. Word has length 11 [2022-02-20 21:49:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:49:19,368 INFO L470 AbstractCegarLoop]: Abstraction has 1891 states and 2641 transitions. [2022-02-20 21:49:19,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:49:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2641 transitions. [2022-02-20 21:49:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 21:49:19,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:49:19,369 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:49:19,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:49:19,370 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:49:19,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:49:19,370 INFO L85 PathProgramCache]: Analyzing trace with hash 338609194, now seen corresponding path program 1 times [2022-02-20 21:49:19,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:49:19,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673933708] [2022-02-20 21:49:19,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:49:19,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:49:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:19,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {29623#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(85, 2);call #Ultimate.allocInit(110, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(38, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(32, 7);call #Ultimate.allocInit(21, 8);call #Ultimate.allocInit(17, 9);call #Ultimate.allocInit(21, 10);call #Ultimate.allocInit(44, 11);call #Ultimate.allocInit(21, 12);call #Ultimate.allocInit(4, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(10, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(23, 14);call #Ultimate.allocInit(31, 15);call #Ultimate.allocInit(23, 16);call #Ultimate.allocInit(14, 17);call #Ultimate.allocInit(23, 18);call #Ultimate.allocInit(8, 19);call #Ultimate.allocInit(2, 20);call write~init~int(10, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(43, 21);call #Ultimate.allocInit(23, 22);call #Ultimate.allocInit(42, 23);call #Ultimate.allocInit(23, 24);call #Ultimate.allocInit(13, 25);call #Ultimate.allocInit(23, 26);call #Ultimate.allocInit(8, 27);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);call #Ultimate.allocInit(4, 29);call write~init~int(37, 29, 0, 1);call write~init~int(115, 29, 1, 1);call write~init~int(10, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(24, 30);call #Ultimate.allocInit(4, 31);call write~init~int(37, 31, 0, 1);call write~init~int(115, 31, 1, 1);call write~init~int(10, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(19, 32);call #Ultimate.allocInit(35, 33);call #Ultimate.allocInit(22, 34);call #Ultimate.allocInit(34, 35);call #Ultimate.allocInit(22, 36);call #Ultimate.allocInit(29, 37);call #Ultimate.allocInit(22, 38);call #Ultimate.allocInit(35, 39);call #Ultimate.allocInit(25, 40);call #Ultimate.allocInit(34, 41);call #Ultimate.allocInit(25, 42);call #Ultimate.allocInit(45, 43);call #Ultimate.allocInit(25, 44);call #Ultimate.allocInit(35, 45);call #Ultimate.allocInit(28, 46);call #Ultimate.allocInit(39, 47);call #Ultimate.allocInit(28, 48);call #Ultimate.allocInit(19, 49);call #Ultimate.allocInit(22, 50);call #Ultimate.allocInit(4, 51);call write~init~int(37, 51, 0, 1);call write~init~int(115, 51, 1, 1);call write~init~int(10, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(21, 52);call #Ultimate.allocInit(4, 53);call write~init~int(37, 53, 0, 1);call write~init~int(115, 53, 1, 1);call write~init~int(10, 53, 2, 1);call write~init~int(0, 53, 3, 1);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(4, 55);call write~init~int(37, 55, 0, 1);call write~init~int(115, 55, 1, 1);call write~init~int(10, 55, 2, 1);call write~init~int(0, 55, 3, 1);call #Ultimate.allocInit(25, 56);call #Ultimate.allocInit(40, 57);call #Ultimate.allocInit(25, 58);call #Ultimate.allocInit(4, 59);call write~init~int(37, 59, 0, 1);call write~init~int(115, 59, 1, 1);call write~init~int(10, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(24, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(12, 62);call #Ultimate.allocInit(11, 63);call #Ultimate.allocInit(17, 64);call #Ultimate.allocInit(2, 65);call write~init~int(10, 65, 0, 1);call write~init~int(0, 65, 1, 1);call #Ultimate.allocInit(27, 66);call #Ultimate.allocInit(27, 67);call #Ultimate.allocInit(45, 68);call #Ultimate.allocInit(25, 69);call #Ultimate.allocInit(42, 70);call #Ultimate.allocInit(26, 71);call #Ultimate.allocInit(4, 72);call write~init~int(37, 72, 0, 1);call write~init~int(115, 72, 1, 1);call write~init~int(10, 72, 2, 1);call write~init~int(0, 72, 3, 1);call #Ultimate.allocInit(25, 73);call #Ultimate.allocInit(4, 74);call write~init~int(37, 74, 0, 1);call write~init~int(115, 74, 1, 1);call write~init~int(10, 74, 2, 1);call write~init~int(0, 74, 3, 1);call #Ultimate.allocInit(21, 75);call #Ultimate.allocInit(15, 76);call #Ultimate.allocInit(22, 77);call #Ultimate.allocInit(4, 78);call write~init~int(37, 78, 0, 1);call write~init~int(115, 78, 1, 1);call write~init~int(10, 78, 2, 1);call write~init~int(0, 78, 3, 1);call #Ultimate.allocInit(20, 79);call #Ultimate.allocInit(4, 80);call write~init~int(37, 80, 0, 1);call write~init~int(115, 80, 1, 1);call write~init~int(10, 80, 2, 1);call write~init~int(0, 80, 3, 1);call #Ultimate.allocInit(24, 81);call #Ultimate.allocInit(4, 82);call write~init~int(37, 82, 0, 1);call write~init~int(115, 82, 1, 1);call write~init~int(10, 82, 2, 1);call write~init~int(0, 82, 3, 1);call #Ultimate.allocInit(25, 83);call #Ultimate.allocInit(46, 84);call #Ultimate.allocInit(25, 85);call #Ultimate.allocInit(36, 86);call #Ultimate.allocInit(8, 87);call #Ultimate.allocInit(25, 88);call #Ultimate.allocInit(27, 89);call #Ultimate.allocInit(14, 90);call #Ultimate.allocInit(4, 91);call write~init~int(37, 91, 0, 1);call write~init~int(115, 91, 1, 1);call write~init~int(10, 91, 2, 1);call write~init~int(0, 91, 3, 1);call #Ultimate.allocInit(21, 92);call #Ultimate.allocInit(4, 93);call write~init~int(37, 93, 0, 1);call write~init~int(115, 93, 1, 1);call write~init~int(10, 93, 2, 1);call write~init~int(0, 93, 3, 1);call #Ultimate.allocInit(19, 94);call #Ultimate.allocInit(16, 95);call #Ultimate.allocInit(16, 96);call #Ultimate.allocInit(4, 97);call write~init~int(37, 97, 0, 1);call write~init~int(115, 97, 1, 1);call write~init~int(10, 97, 2, 1);call write~init~int(0, 97, 3, 1);call #Ultimate.allocInit(19, 98);call #Ultimate.allocInit(33, 99);call #Ultimate.allocInit(19, 100);call #Ultimate.allocInit(54, 101);call #Ultimate.allocInit(19, 102);call #Ultimate.allocInit(89, 103);call #Ultimate.allocInit(19, 104);call #Ultimate.allocInit(34, 105);call #Ultimate.allocInit(4, 106);call write~init~int(37, 106, 0, 1);call write~init~int(115, 106, 1, 1);call write~init~int(10, 106, 2, 1);call write~init~int(0, 106, 3, 1);call #Ultimate.allocInit(19, 107);call #Ultimate.allocInit(41, 108);call #Ultimate.allocInit(34, 109);call #Ultimate.allocInit(64, 110);call #Ultimate.allocInit(19, 111);call #Ultimate.allocInit(4, 112);call write~init~int(37, 112, 0, 1);call write~init~int(115, 112, 1, 1);call write~init~int(10, 112, 2, 1);call write~init~int(0, 112, 3, 1);call #Ultimate.allocInit(19, 113);call #Ultimate.allocInit(43, 114);call #Ultimate.allocInit(19, 115);call #Ultimate.allocInit(35, 116);call #Ultimate.allocInit(19, 117);call #Ultimate.allocInit(38, 118);call #Ultimate.allocInit(19, 119);call #Ultimate.allocInit(35, 120);call #Ultimate.allocInit(19, 121);call #Ultimate.allocInit(35, 122);call #Ultimate.allocInit(19, 123);call #Ultimate.allocInit(4, 124);call write~init~int(37, 124, 0, 1);call write~init~int(115, 124, 1, 1);call write~init~int(10, 124, 2, 1);call write~init~int(0, 124, 3, 1);call #Ultimate.allocInit(19, 125);call #Ultimate.allocInit(4, 126);call write~init~int(37, 126, 0, 1);call write~init~int(115, 126, 1, 1);call write~init~int(10, 126, 2, 1);call write~init~int(0, 126, 3, 1);call #Ultimate.allocInit(18, 127);call #Ultimate.allocInit(4, 128);call write~init~int(37, 128, 0, 1);call write~init~int(115, 128, 1, 1);call write~init~int(10, 128, 2, 1);call write~init~int(0, 128, 3, 1);call #Ultimate.allocInit(19, 129);call #Ultimate.allocInit(38, 130);call #Ultimate.allocInit(4, 131);call write~init~int(37, 131, 0, 1);call write~init~int(115, 131, 1, 1);call write~init~int(10, 131, 2, 1);call write~init~int(0, 131, 3, 1);call #Ultimate.allocInit(16, 132);call #Ultimate.allocInit(31, 133);call #Ultimate.allocInit(16, 134);call #Ultimate.allocInit(71, 135);call #Ultimate.allocInit(42, 136);call #Ultimate.allocInit(4, 137);call write~init~int(37, 137, 0, 1);call write~init~int(115, 137, 1, 1);call write~init~int(10, 137, 2, 1);call write~init~int(0, 137, 3, 1);call #Ultimate.allocInit(21, 138);call #Ultimate.allocInit(10, 139);call #Ultimate.allocInit(23, 140);call #Ultimate.allocInit(10, 141);call #Ultimate.allocInit(23, 142);call #Ultimate.allocInit(10, 143);call #Ultimate.allocInit(23, 144);~debug~0 := 0;~output_pva~0 := 0;~enable_rc~0 := 0;~#adapter_nr~0.base, ~#adapter_nr~0.offset := 145, 0;call #Ultimate.allocInit(16, 145);call write~init~int(-1, ~#adapter_nr~0.base, ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 2 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 4 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 6 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 8 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 10 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 12 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 14 + ~#adapter_nr~0.offset, 2);~#rc_keys~0.base, ~#rc_keys~0.offset := 146, 0;call #Ultimate.allocInit(52, 146);call write~init~int(116, ~#rc_keys~0.base, ~#rc_keys~0.offset, 2);call write~init~int(113, ~#rc_keys~0.base, 2 + ~#rc_keys~0.offset, 2);call write~init~int(2, ~#rc_keys~0.base, 4 + ~#rc_keys~0.offset, 2);call write~init~int(3, ~#rc_keys~0.base, 6 + ~#rc_keys~0.offset, 2);call write~init~int(4, ~#rc_keys~0.base, 8 + ~#rc_keys~0.offset, 2);call write~init~int(5, ~#rc_keys~0.base, 10 + ~#rc_keys~0.offset, 2);call write~init~int(6, ~#rc_keys~0.base, 12 + ~#rc_keys~0.offset, 2);call write~init~int(7, ~#rc_keys~0.base, 14 + ~#rc_keys~0.offset, 2);call write~init~int(8, ~#rc_keys~0.base, 16 + ~#rc_keys~0.offset, 2);call write~init~int(9, ~#rc_keys~0.base, 18 + ~#rc_keys~0.offset, 2);call write~init~int(10, ~#rc_keys~0.base, 20 + ~#rc_keys~0.offset, 2);call write~init~int(11, ~#rc_keys~0.base, 22 + ~#rc_keys~0.offset, 2);call write~init~int(402, ~#rc_keys~0.base, 24 + ~#rc_keys~0.offset, 2);call write~init~int(114, ~#rc_keys~0.base, 26 + ~#rc_keys~0.offset, 2);call write~init~int(352, ~#rc_keys~0.base, 28 + ~#rc_keys~0.offset, 2);call write~init~int(115, ~#rc_keys~0.base, 30 + ~#rc_keys~0.offset, 2);call write~init~int(403, ~#rc_keys~0.base, 32 + ~#rc_keys~0.offset, 2);call write~init~int(412, ~#rc_keys~0.base, 34 + ~#rc_keys~0.offset, 2);call write~init~int(1, ~#rc_keys~0.base, 36 + ~#rc_keys~0.offset, 2);call write~init~int(398, ~#rc_keys~0.base, 38 + ~#rc_keys~0.offset, 2);call write~init~int(399, ~#rc_keys~0.base, 40 + ~#rc_keys~0.offset, 2);call write~init~int(400, ~#rc_keys~0.base, 42 + ~#rc_keys~0.offset, 2);call write~init~int(401, ~#rc_keys~0.base, 44 + ~#rc_keys~0.offset, 2);call write~init~int(357, ~#rc_keys~0.base, 46 + ~#rc_keys~0.offset, 2);call write~init~int(50, ~#rc_keys~0.base, 48 + ~#rc_keys~0.offset, 2);call write~init~int(385, ~#rc_keys~0.base, 50 + ~#rc_keys~0.offset, 2);~#fe_config~0.base, ~#fe_config~0.offset := 147, 0;call #Ultimate.allocInit(8, 147);call write~init~$Pointer$(#funAddr~fe_send_command.base, #funAddr~fe_send_command.offset, ~#fe_config~0.base, ~#fe_config~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~LDV_IN_INTERRUPT~0 := 0;~ldv_mutex_iso_mutex_of_ttusb_dec~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_usb_mutex_of_ttusb_dec~0 := 0; {29623#true} is VALID [2022-02-20 21:49:19,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {29623#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet807#1, main_#t~switch808#1, main_#t~ret809#1, main_#t~nondet810#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_ttusb_dec_probe_38_p1~0#1.base, main_~var_ttusb_dec_probe_38_p1~0#1.offset, main_~res_ttusb_dec_probe_38~0#1, main_~ldv_s_ttusb_dec_driver_usb_driver~0#1, main_~tmp~32#1, main_~tmp___0~13#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_ttusb_dec_probe_38_p1~0#1.base, main_~var_ttusb_dec_probe_38_p1~0#1.offset;havoc main_~res_ttusb_dec_probe_38~0#1;havoc main_~ldv_s_ttusb_dec_driver_usb_driver~0#1;havoc main_~tmp~32#1;havoc main_~tmp___0~13#1;main_~ldv_s_ttusb_dec_driver_usb_driver~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_iso_mutex_of_ttusb_dec~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_usb_mutex_of_ttusb_dec~0 := 1; {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:49:19,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} assume { :end_inline_ldv_initialize } true; {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:49:19,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} assume -2147483648 <= main_#t~nondet810#1 && main_#t~nondet810#1 <= 2147483647;main_~tmp___0~13#1 := main_#t~nondet810#1;havoc main_#t~nondet810#1; {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:49:19,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} assume !(0 != main_~tmp___0~13#1 || 0 != main_~ldv_s_ttusb_dec_driver_usb_driver~0#1); {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:49:19,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} assume { :begin_inline_ldv_check_final_state } true; {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:49:19,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} assume 1 == ~ldv_mutex_iso_mutex_of_ttusb_dec~0; {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:49:19,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} assume 1 == ~ldv_mutex_lock~0; {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:49:19,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} assume 1 == ~ldv_mutex_mutex_of_device~0; {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} is VALID [2022-02-20 21:49:19,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {29625#(= ~ldv_mutex_usb_mutex_of_ttusb_dec~0 1)} assume !(1 == ~ldv_mutex_usb_mutex_of_ttusb_dec~0); {29624#false} is VALID [2022-02-20 21:49:19,456 INFO L272 TraceCheckUtils]: 10: Hoare triple {29624#false} call ldv_error(); {29624#false} is VALID [2022-02-20 21:49:19,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {29624#false} assume !false; {29624#false} is VALID [2022-02-20 21:49:19,457 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:49:19,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:49:19,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673933708] [2022-02-20 21:49:19,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673933708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:49:19,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:49:19,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:49:19,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864512663] [2022-02-20 21:49:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:49:19,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-20 21:49:19,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:49:19,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:49:19,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:49:19,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:49:19,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:49:19,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:49:19,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:49:19,476 INFO L87 Difference]: Start difference. First operand 1891 states and 2641 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:49:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:28,273 INFO L93 Difference]: Finished difference Result 5628 states and 7971 transitions. [2022-02-20 21:49:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:49:28,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-20 21:49:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:49:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:49:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4014 transitions. [2022-02-20 21:49:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:49:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4014 transitions. [2022-02-20 21:49:28,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4014 transitions. [2022-02-20 21:49:31,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4014 edges. 4014 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:49:31,758 INFO L225 Difference]: With dead ends: 5628 [2022-02-20 21:49:31,759 INFO L226 Difference]: Without dead ends: 3735 [2022-02-20 21:49:31,766 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:49:31,774 INFO L933 BasicCegarLoop]: 1630 mSDtfsCounter, 1328 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:49:31,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1328 Valid, 2940 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:49:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2022-02-20 21:49:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 3715. [2022-02-20 21:49:31,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:49:31,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3735 states. Second operand has 3715 states, 2757 states have (on average 1.323177366702938) internal successors, (3648), 2811 states have internal predecessors, (3648), 766 states have call successors, (766), 194 states have call predecessors, (766), 191 states have return successors, (830), 729 states have call predecessors, (830), 754 states have call successors, (830) [2022-02-20 21:49:31,879 INFO L74 IsIncluded]: Start isIncluded. First operand 3735 states. Second operand has 3715 states, 2757 states have (on average 1.323177366702938) internal successors, (3648), 2811 states have internal predecessors, (3648), 766 states have call successors, (766), 194 states have call predecessors, (766), 191 states have return successors, (830), 729 states have call predecessors, (830), 754 states have call successors, (830) [2022-02-20 21:49:31,887 INFO L87 Difference]: Start difference. First operand 3735 states. Second operand has 3715 states, 2757 states have (on average 1.323177366702938) internal successors, (3648), 2811 states have internal predecessors, (3648), 766 states have call successors, (766), 194 states have call predecessors, (766), 191 states have return successors, (830), 729 states have call predecessors, (830), 754 states have call successors, (830) [2022-02-20 21:49:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:32,316 INFO L93 Difference]: Finished difference Result 3735 states and 5263 transitions. [2022-02-20 21:49:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 5263 transitions. [2022-02-20 21:49:32,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:49:32,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:49:32,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 3715 states, 2757 states have (on average 1.323177366702938) internal successors, (3648), 2811 states have internal predecessors, (3648), 766 states have call successors, (766), 194 states have call predecessors, (766), 191 states have return successors, (830), 729 states have call predecessors, (830), 754 states have call successors, (830) Second operand 3735 states. [2022-02-20 21:49:32,353 INFO L87 Difference]: Start difference. First operand has 3715 states, 2757 states have (on average 1.323177366702938) internal successors, (3648), 2811 states have internal predecessors, (3648), 766 states have call successors, (766), 194 states have call predecessors, (766), 191 states have return successors, (830), 729 states have call predecessors, (830), 754 states have call successors, (830) Second operand 3735 states. [2022-02-20 21:49:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:32,880 INFO L93 Difference]: Finished difference Result 3735 states and 5263 transitions. [2022-02-20 21:49:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 5263 transitions. [2022-02-20 21:49:32,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:49:32,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:49:32,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:49:32,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:49:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3715 states, 2757 states have (on average 1.323177366702938) internal successors, (3648), 2811 states have internal predecessors, (3648), 766 states have call successors, (766), 194 states have call predecessors, (766), 191 states have return successors, (830), 729 states have call predecessors, (830), 754 states have call successors, (830) [2022-02-20 21:49:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3715 states to 3715 states and 5244 transitions. [2022-02-20 21:49:33,501 INFO L78 Accepts]: Start accepts. Automaton has 3715 states and 5244 transitions. Word has length 12 [2022-02-20 21:49:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:49:33,501 INFO L470 AbstractCegarLoop]: Abstraction has 3715 states and 5244 transitions. [2022-02-20 21:49:33,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:49:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3715 states and 5244 transitions. [2022-02-20 21:49:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-20 21:49:33,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:49:33,507 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:49:33,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:49:33,508 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:49:33,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:49:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2023814405, now seen corresponding path program 1 times [2022-02-20 21:49:33,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:49:33,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660168260] [2022-02-20 21:49:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:49:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:49:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 21:49:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:49:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:49:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647; {50162#true} is VALID [2022-02-20 21:49:33,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume !(0 != #t~nondet41#1);havoc #t~nondet41#1;#res#1.base, #res#1.offset := 0, 0; {50162#true} is VALID [2022-02-20 21:49:33,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50162#true} {50162#true} #2247#return; {50162#true} is VALID [2022-02-20 21:49:33,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {50162#true} is VALID [2022-02-20 21:49:33,714 INFO L272 TraceCheckUtils]: 1: Hoare triple {50162#true} call __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset := ldv_malloc(__kmalloc_~size#1); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647; {50162#true} is VALID [2022-02-20 21:49:33,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {50162#true} assume !(0 != #t~nondet41#1);havoc #t~nondet41#1;#res#1.base, #res#1.offset := 0, 0; {50162#true} is VALID [2022-02-20 21:49:33,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,719 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {50162#true} {50162#true} #2247#return; {50162#true} is VALID [2022-02-20 21:49:33,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {50162#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset;havoc __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset; {50162#true} is VALID [2022-02-20 21:49:33,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {50162#true} #t~ret45#1.base, #t~ret45#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret45#1.base, #t~ret45#1.offset;havoc #t~ret45#1.base, #t~ret45#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {50162#true} is VALID [2022-02-20 21:49:33,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,721 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {50162#true} {50162#true} #2241#return; {50162#true} is VALID [2022-02-20 21:49:33,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;~flags := #in~flags;havoc ~tmp~2.base, ~tmp~2.offset; {50162#true} is VALID [2022-02-20 21:49:33,722 INFO L272 TraceCheckUtils]: 1: Hoare triple {50162#true} call #t~ret46.base, #t~ret46.offset := kmalloc(~size, ~bitwiseOr(~flags, 32768)); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {50162#true} is VALID [2022-02-20 21:49:33,723 INFO L272 TraceCheckUtils]: 3: Hoare triple {50162#true} call __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset := ldv_malloc(__kmalloc_~size#1); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647; {50162#true} is VALID [2022-02-20 21:49:33,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {50162#true} assume !(0 != #t~nondet41#1);havoc #t~nondet41#1;#res#1.base, #res#1.offset := 0, 0; {50162#true} is VALID [2022-02-20 21:49:33,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,723 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {50162#true} {50162#true} #2247#return; {50162#true} is VALID [2022-02-20 21:49:33,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {50162#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset;havoc __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset; {50162#true} is VALID [2022-02-20 21:49:33,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {50162#true} #t~ret45#1.base, #t~ret45#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret45#1.base, #t~ret45#1.offset;havoc #t~ret45#1.base, #t~ret45#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {50162#true} is VALID [2022-02-20 21:49:33,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,724 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {50162#true} {50162#true} #2241#return; {50162#true} is VALID [2022-02-20 21:49:33,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {50162#true} ~tmp~2.base, ~tmp~2.offset := #t~ret46.base, #t~ret46.offset;havoc #t~ret46.base, #t~ret46.offset;#res.base, #res.offset := ~tmp~2.base, ~tmp~2.offset; {50162#true} is VALID [2022-02-20 21:49:33,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,725 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {50162#true} {50163#false} #2295#return; {50163#false} is VALID [2022-02-20 21:49:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-20 21:49:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {50162#true} ~intf#1.base, ~intf#1.offset := #in~intf#1.base, #in~intf#1.offset;~data#1.base, ~data#1.offset := #in~data#1.base, #in~data#1.offset;assume { :begin_inline_dev_set_drvdata } true;dev_set_drvdata_#in~arg0#1.base, dev_set_drvdata_#in~arg0#1.offset, dev_set_drvdata_#in~arg1#1.base, dev_set_drvdata_#in~arg1#1.offset := ~intf#1.base, 44 + ~intf#1.offset, ~data#1.base, ~data#1.offset;havoc dev_set_drvdata_#res#1;havoc dev_set_drvdata_#t~nondet842#1, dev_set_drvdata_~arg0#1.base, dev_set_drvdata_~arg0#1.offset, dev_set_drvdata_~arg1#1.base, dev_set_drvdata_~arg1#1.offset;dev_set_drvdata_~arg0#1.base, dev_set_drvdata_~arg0#1.offset := dev_set_drvdata_#in~arg0#1.base, dev_set_drvdata_#in~arg0#1.offset;dev_set_drvdata_~arg1#1.base, dev_set_drvdata_~arg1#1.offset := dev_set_drvdata_#in~arg1#1.base, dev_set_drvdata_#in~arg1#1.offset;assume -2147483648 <= dev_set_drvdata_#t~nondet842#1 && dev_set_drvdata_#t~nondet842#1 <= 2147483647;dev_set_drvdata_#res#1 := dev_set_drvdata_#t~nondet842#1;havoc dev_set_drvdata_#t~nondet842#1; {50162#true} is VALID [2022-02-20 21:49:33,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} #t~ret105#1 := dev_set_drvdata_#res#1;assume { :end_inline_dev_set_drvdata } true;assume -2147483648 <= #t~ret105#1 && #t~ret105#1 <= 2147483647;havoc #t~ret105#1; {50162#true} is VALID [2022-02-20 21:49:33,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50162#true} {50163#false} #2297#return; {50163#false} is VALID [2022-02-20 21:49:33,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:49:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {50162#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {50162#true} is VALID [2022-02-20 21:49:33,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50162#true} {50163#false} #2305#return; {50163#false} is VALID [2022-02-20 21:49:33,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 21:49:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {50162#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {50162#true} is VALID [2022-02-20 21:49:33,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50162#true} {50163#false} #2307#return; {50163#false} is VALID [2022-02-20 21:49:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:49:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {50162#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~endpoint := #in~endpoint;call #t~mem137 := read~int(~dev.base, ~dev.offset, 4);#res := (if (1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 0 == 32768 * ~endpoint then 256 * #t~mem137 else (if 0 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint) then 32768 * ~endpoint else (if (1 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint)) || ((1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 1 == 32768 * ~endpoint) then 1 else ~bitwiseOr(256 * #t~mem137, 32768 * ~endpoint))));havoc #t~mem137; {50162#true} is VALID [2022-02-20 21:49:33,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50162#true} {50163#false} #2309#return; {50163#false} is VALID [2022-02-20 21:49:33,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 21:49:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {50162#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~endpoint := #in~endpoint;call #t~mem137 := read~int(~dev.base, ~dev.offset, 4);#res := (if (1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 0 == 32768 * ~endpoint then 256 * #t~mem137 else (if 0 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint) then 32768 * ~endpoint else (if (1 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint)) || ((1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 1 == 32768 * ~endpoint) then 1 else ~bitwiseOr(256 * #t~mem137, 32768 * ~endpoint))));havoc #t~mem137; {50162#true} is VALID [2022-02-20 21:49:33,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50162#true} {50163#false} #2311#return; {50163#false} is VALID [2022-02-20 21:49:33,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 21:49:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {50162#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~endpoint := #in~endpoint;call #t~mem137 := read~int(~dev.base, ~dev.offset, 4);#res := (if (1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 0 == 32768 * ~endpoint then 256 * #t~mem137 else (if 0 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint) then 32768 * ~endpoint else (if (1 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint)) || ((1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 1 == 32768 * ~endpoint) then 1 else ~bitwiseOr(256 * #t~mem137, 32768 * ~endpoint))));havoc #t~mem137; {50162#true} is VALID [2022-02-20 21:49:33,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50162#true} {50163#false} #2313#return; {50163#false} is VALID [2022-02-20 21:49:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 21:49:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {50162#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~endpoint := #in~endpoint;call #t~mem137 := read~int(~dev.base, ~dev.offset, 4);#res := (if (1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 0 == 32768 * ~endpoint then 256 * #t~mem137 else (if 0 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint) then 32768 * ~endpoint else (if (1 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint)) || ((1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 1 == 32768 * ~endpoint) then 1 else ~bitwiseOr(256 * #t~mem137, 32768 * ~endpoint))));havoc #t~mem137; {50162#true} is VALID [2022-02-20 21:49:33,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50162#true} {50163#false} #2315#return; {50163#false} is VALID [2022-02-20 21:49:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-02-20 21:49:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {50162#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~endpoint := #in~endpoint;call #t~mem137 := read~int(~dev.base, ~dev.offset, 4);#res := (if (1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 0 == 32768 * ~endpoint then 256 * #t~mem137 else (if 0 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint) then 32768 * ~endpoint else (if (1 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint)) || ((1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 1 == 32768 * ~endpoint) then 1 else ~bitwiseOr(256 * #t~mem137, 32768 * ~endpoint))));havoc #t~mem137; {50162#true} is VALID [2022-02-20 21:49:33,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50162#true} {50163#false} #2317#return; {50163#false} is VALID [2022-02-20 21:49:33,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 21:49:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:49:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647; {50162#true} is VALID [2022-02-20 21:49:33,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume !(0 != #t~nondet41#1);havoc #t~nondet41#1;#res#1.base, #res#1.offset := 0, 0; {50162#true} is VALID [2022-02-20 21:49:33,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50162#true} {50162#true} #2293#return; {50162#true} is VALID [2022-02-20 21:49:33,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0;~arg1 := #in~arg1; {50162#true} is VALID [2022-02-20 21:49:33,853 INFO L272 TraceCheckUtils]: 1: Hoare triple {50162#true} call #t~ret860.base, #t~ret860.offset := ldv_malloc(184); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647; {50162#true} is VALID [2022-02-20 21:49:33,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {50162#true} assume !(0 != #t~nondet41#1);havoc #t~nondet41#1;#res#1.base, #res#1.offset := 0, 0; {50162#true} is VALID [2022-02-20 21:49:33,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,854 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {50162#true} {50162#true} #2293#return; {50162#true} is VALID [2022-02-20 21:49:33,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {50162#true} #res.base, #res.offset := #t~ret860.base, #t~ret860.offset;havoc #t~ret860.base, #t~ret860.offset; {50162#true} is VALID [2022-02-20 21:49:33,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,855 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {50162#true} {50163#false} #2319#return; {50163#false} is VALID [2022-02-20 21:49:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-02-20 21:49:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:49:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647; {50162#true} is VALID [2022-02-20 21:49:33,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume !(0 != #t~nondet41#1);havoc #t~nondet41#1;#res#1.base, #res#1.offset := 0, 0; {50162#true} is VALID [2022-02-20 21:49:33,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50162#true} {50162#true} #2247#return; {50162#true} is VALID [2022-02-20 21:49:33,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {50162#true} is VALID [2022-02-20 21:49:33,898 INFO L272 TraceCheckUtils]: 1: Hoare triple {50162#true} call __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset := ldv_malloc(__kmalloc_~size#1); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647; {50162#true} is VALID [2022-02-20 21:49:33,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {50162#true} assume !(0 != #t~nondet41#1);havoc #t~nondet41#1;#res#1.base, #res#1.offset := 0, 0; {50162#true} is VALID [2022-02-20 21:49:33,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,908 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {50162#true} {50162#true} #2247#return; {50162#true} is VALID [2022-02-20 21:49:33,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {50162#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset;havoc __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset; {50162#true} is VALID [2022-02-20 21:49:33,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {50162#true} #t~ret45#1.base, #t~ret45#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret45#1.base, #t~ret45#1.offset;havoc #t~ret45#1.base, #t~ret45#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {50162#true} is VALID [2022-02-20 21:49:33,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,909 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {50162#true} {50163#false} #2207#return; {50163#false} is VALID [2022-02-20 21:49:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-02-20 21:49:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {50162#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;assume -2147483648 <= #t~nondet852 && #t~nondet852 <= 2147483647;#res := #t~nondet852;havoc #t~nondet852; {50162#true} is VALID [2022-02-20 21:49:33,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50162#true} {50163#false} #2209#return; {50163#false} is VALID [2022-02-20 21:49:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-02-20 21:49:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:49:33,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {50162#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset;~arg3 := #in~arg3;~arg4.base, ~arg4.offset := #in~arg4.base, #in~arg4.offset;~arg5 := #in~arg5;assume -2147483648 <= #t~nondet861 && #t~nondet861 <= 2147483647;#res := #t~nondet861;havoc #t~nondet861; {50162#true} is VALID [2022-02-20 21:49:33,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50162#true} {50163#false} #2217#return; {50163#false} is VALID [2022-02-20 21:49:33,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {50162#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(85, 2);call #Ultimate.allocInit(110, 3);call #Ultimate.allocInit(10, 4);call #Ultimate.allocInit(38, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(32, 7);call #Ultimate.allocInit(21, 8);call #Ultimate.allocInit(17, 9);call #Ultimate.allocInit(21, 10);call #Ultimate.allocInit(44, 11);call #Ultimate.allocInit(21, 12);call #Ultimate.allocInit(4, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(10, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(23, 14);call #Ultimate.allocInit(31, 15);call #Ultimate.allocInit(23, 16);call #Ultimate.allocInit(14, 17);call #Ultimate.allocInit(23, 18);call #Ultimate.allocInit(8, 19);call #Ultimate.allocInit(2, 20);call write~init~int(10, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(43, 21);call #Ultimate.allocInit(23, 22);call #Ultimate.allocInit(42, 23);call #Ultimate.allocInit(23, 24);call #Ultimate.allocInit(13, 25);call #Ultimate.allocInit(23, 26);call #Ultimate.allocInit(8, 27);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);call #Ultimate.allocInit(4, 29);call write~init~int(37, 29, 0, 1);call write~init~int(115, 29, 1, 1);call write~init~int(10, 29, 2, 1);call write~init~int(0, 29, 3, 1);call #Ultimate.allocInit(24, 30);call #Ultimate.allocInit(4, 31);call write~init~int(37, 31, 0, 1);call write~init~int(115, 31, 1, 1);call write~init~int(10, 31, 2, 1);call write~init~int(0, 31, 3, 1);call #Ultimate.allocInit(19, 32);call #Ultimate.allocInit(35, 33);call #Ultimate.allocInit(22, 34);call #Ultimate.allocInit(34, 35);call #Ultimate.allocInit(22, 36);call #Ultimate.allocInit(29, 37);call #Ultimate.allocInit(22, 38);call #Ultimate.allocInit(35, 39);call #Ultimate.allocInit(25, 40);call #Ultimate.allocInit(34, 41);call #Ultimate.allocInit(25, 42);call #Ultimate.allocInit(45, 43);call #Ultimate.allocInit(25, 44);call #Ultimate.allocInit(35, 45);call #Ultimate.allocInit(28, 46);call #Ultimate.allocInit(39, 47);call #Ultimate.allocInit(28, 48);call #Ultimate.allocInit(19, 49);call #Ultimate.allocInit(22, 50);call #Ultimate.allocInit(4, 51);call write~init~int(37, 51, 0, 1);call write~init~int(115, 51, 1, 1);call write~init~int(10, 51, 2, 1);call write~init~int(0, 51, 3, 1);call #Ultimate.allocInit(21, 52);call #Ultimate.allocInit(4, 53);call write~init~int(37, 53, 0, 1);call write~init~int(115, 53, 1, 1);call write~init~int(10, 53, 2, 1);call write~init~int(0, 53, 3, 1);call #Ultimate.allocInit(24, 54);call #Ultimate.allocInit(4, 55);call write~init~int(37, 55, 0, 1);call write~init~int(115, 55, 1, 1);call write~init~int(10, 55, 2, 1);call write~init~int(0, 55, 3, 1);call #Ultimate.allocInit(25, 56);call #Ultimate.allocInit(40, 57);call #Ultimate.allocInit(25, 58);call #Ultimate.allocInit(4, 59);call write~init~int(37, 59, 0, 1);call write~init~int(115, 59, 1, 1);call write~init~int(10, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(24, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(12, 62);call #Ultimate.allocInit(11, 63);call #Ultimate.allocInit(17, 64);call #Ultimate.allocInit(2, 65);call write~init~int(10, 65, 0, 1);call write~init~int(0, 65, 1, 1);call #Ultimate.allocInit(27, 66);call #Ultimate.allocInit(27, 67);call #Ultimate.allocInit(45, 68);call #Ultimate.allocInit(25, 69);call #Ultimate.allocInit(42, 70);call #Ultimate.allocInit(26, 71);call #Ultimate.allocInit(4, 72);call write~init~int(37, 72, 0, 1);call write~init~int(115, 72, 1, 1);call write~init~int(10, 72, 2, 1);call write~init~int(0, 72, 3, 1);call #Ultimate.allocInit(25, 73);call #Ultimate.allocInit(4, 74);call write~init~int(37, 74, 0, 1);call write~init~int(115, 74, 1, 1);call write~init~int(10, 74, 2, 1);call write~init~int(0, 74, 3, 1);call #Ultimate.allocInit(21, 75);call #Ultimate.allocInit(15, 76);call #Ultimate.allocInit(22, 77);call #Ultimate.allocInit(4, 78);call write~init~int(37, 78, 0, 1);call write~init~int(115, 78, 1, 1);call write~init~int(10, 78, 2, 1);call write~init~int(0, 78, 3, 1);call #Ultimate.allocInit(20, 79);call #Ultimate.allocInit(4, 80);call write~init~int(37, 80, 0, 1);call write~init~int(115, 80, 1, 1);call write~init~int(10, 80, 2, 1);call write~init~int(0, 80, 3, 1);call #Ultimate.allocInit(24, 81);call #Ultimate.allocInit(4, 82);call write~init~int(37, 82, 0, 1);call write~init~int(115, 82, 1, 1);call write~init~int(10, 82, 2, 1);call write~init~int(0, 82, 3, 1);call #Ultimate.allocInit(25, 83);call #Ultimate.allocInit(46, 84);call #Ultimate.allocInit(25, 85);call #Ultimate.allocInit(36, 86);call #Ultimate.allocInit(8, 87);call #Ultimate.allocInit(25, 88);call #Ultimate.allocInit(27, 89);call #Ultimate.allocInit(14, 90);call #Ultimate.allocInit(4, 91);call write~init~int(37, 91, 0, 1);call write~init~int(115, 91, 1, 1);call write~init~int(10, 91, 2, 1);call write~init~int(0, 91, 3, 1);call #Ultimate.allocInit(21, 92);call #Ultimate.allocInit(4, 93);call write~init~int(37, 93, 0, 1);call write~init~int(115, 93, 1, 1);call write~init~int(10, 93, 2, 1);call write~init~int(0, 93, 3, 1);call #Ultimate.allocInit(19, 94);call #Ultimate.allocInit(16, 95);call #Ultimate.allocInit(16, 96);call #Ultimate.allocInit(4, 97);call write~init~int(37, 97, 0, 1);call write~init~int(115, 97, 1, 1);call write~init~int(10, 97, 2, 1);call write~init~int(0, 97, 3, 1);call #Ultimate.allocInit(19, 98);call #Ultimate.allocInit(33, 99);call #Ultimate.allocInit(19, 100);call #Ultimate.allocInit(54, 101);call #Ultimate.allocInit(19, 102);call #Ultimate.allocInit(89, 103);call #Ultimate.allocInit(19, 104);call #Ultimate.allocInit(34, 105);call #Ultimate.allocInit(4, 106);call write~init~int(37, 106, 0, 1);call write~init~int(115, 106, 1, 1);call write~init~int(10, 106, 2, 1);call write~init~int(0, 106, 3, 1);call #Ultimate.allocInit(19, 107);call #Ultimate.allocInit(41, 108);call #Ultimate.allocInit(34, 109);call #Ultimate.allocInit(64, 110);call #Ultimate.allocInit(19, 111);call #Ultimate.allocInit(4, 112);call write~init~int(37, 112, 0, 1);call write~init~int(115, 112, 1, 1);call write~init~int(10, 112, 2, 1);call write~init~int(0, 112, 3, 1);call #Ultimate.allocInit(19, 113);call #Ultimate.allocInit(43, 114);call #Ultimate.allocInit(19, 115);call #Ultimate.allocInit(35, 116);call #Ultimate.allocInit(19, 117);call #Ultimate.allocInit(38, 118);call #Ultimate.allocInit(19, 119);call #Ultimate.allocInit(35, 120);call #Ultimate.allocInit(19, 121);call #Ultimate.allocInit(35, 122);call #Ultimate.allocInit(19, 123);call #Ultimate.allocInit(4, 124);call write~init~int(37, 124, 0, 1);call write~init~int(115, 124, 1, 1);call write~init~int(10, 124, 2, 1);call write~init~int(0, 124, 3, 1);call #Ultimate.allocInit(19, 125);call #Ultimate.allocInit(4, 126);call write~init~int(37, 126, 0, 1);call write~init~int(115, 126, 1, 1);call write~init~int(10, 126, 2, 1);call write~init~int(0, 126, 3, 1);call #Ultimate.allocInit(18, 127);call #Ultimate.allocInit(4, 128);call write~init~int(37, 128, 0, 1);call write~init~int(115, 128, 1, 1);call write~init~int(10, 128, 2, 1);call write~init~int(0, 128, 3, 1);call #Ultimate.allocInit(19, 129);call #Ultimate.allocInit(38, 130);call #Ultimate.allocInit(4, 131);call write~init~int(37, 131, 0, 1);call write~init~int(115, 131, 1, 1);call write~init~int(10, 131, 2, 1);call write~init~int(0, 131, 3, 1);call #Ultimate.allocInit(16, 132);call #Ultimate.allocInit(31, 133);call #Ultimate.allocInit(16, 134);call #Ultimate.allocInit(71, 135);call #Ultimate.allocInit(42, 136);call #Ultimate.allocInit(4, 137);call write~init~int(37, 137, 0, 1);call write~init~int(115, 137, 1, 1);call write~init~int(10, 137, 2, 1);call write~init~int(0, 137, 3, 1);call #Ultimate.allocInit(21, 138);call #Ultimate.allocInit(10, 139);call #Ultimate.allocInit(23, 140);call #Ultimate.allocInit(10, 141);call #Ultimate.allocInit(23, 142);call #Ultimate.allocInit(10, 143);call #Ultimate.allocInit(23, 144);~debug~0 := 0;~output_pva~0 := 0;~enable_rc~0 := 0;~#adapter_nr~0.base, ~#adapter_nr~0.offset := 145, 0;call #Ultimate.allocInit(16, 145);call write~init~int(-1, ~#adapter_nr~0.base, ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 2 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 4 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 6 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 8 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 10 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 12 + ~#adapter_nr~0.offset, 2);call write~init~int(-1, ~#adapter_nr~0.base, 14 + ~#adapter_nr~0.offset, 2);~#rc_keys~0.base, ~#rc_keys~0.offset := 146, 0;call #Ultimate.allocInit(52, 146);call write~init~int(116, ~#rc_keys~0.base, ~#rc_keys~0.offset, 2);call write~init~int(113, ~#rc_keys~0.base, 2 + ~#rc_keys~0.offset, 2);call write~init~int(2, ~#rc_keys~0.base, 4 + ~#rc_keys~0.offset, 2);call write~init~int(3, ~#rc_keys~0.base, 6 + ~#rc_keys~0.offset, 2);call write~init~int(4, ~#rc_keys~0.base, 8 + ~#rc_keys~0.offset, 2);call write~init~int(5, ~#rc_keys~0.base, 10 + ~#rc_keys~0.offset, 2);call write~init~int(6, ~#rc_keys~0.base, 12 + ~#rc_keys~0.offset, 2);call write~init~int(7, ~#rc_keys~0.base, 14 + ~#rc_keys~0.offset, 2);call write~init~int(8, ~#rc_keys~0.base, 16 + ~#rc_keys~0.offset, 2);call write~init~int(9, ~#rc_keys~0.base, 18 + ~#rc_keys~0.offset, 2);call write~init~int(10, ~#rc_keys~0.base, 20 + ~#rc_keys~0.offset, 2);call write~init~int(11, ~#rc_keys~0.base, 22 + ~#rc_keys~0.offset, 2);call write~init~int(402, ~#rc_keys~0.base, 24 + ~#rc_keys~0.offset, 2);call write~init~int(114, ~#rc_keys~0.base, 26 + ~#rc_keys~0.offset, 2);call write~init~int(352, ~#rc_keys~0.base, 28 + ~#rc_keys~0.offset, 2);call write~init~int(115, ~#rc_keys~0.base, 30 + ~#rc_keys~0.offset, 2);call write~init~int(403, ~#rc_keys~0.base, 32 + ~#rc_keys~0.offset, 2);call write~init~int(412, ~#rc_keys~0.base, 34 + ~#rc_keys~0.offset, 2);call write~init~int(1, ~#rc_keys~0.base, 36 + ~#rc_keys~0.offset, 2);call write~init~int(398, ~#rc_keys~0.base, 38 + ~#rc_keys~0.offset, 2);call write~init~int(399, ~#rc_keys~0.base, 40 + ~#rc_keys~0.offset, 2);call write~init~int(400, ~#rc_keys~0.base, 42 + ~#rc_keys~0.offset, 2);call write~init~int(401, ~#rc_keys~0.base, 44 + ~#rc_keys~0.offset, 2);call write~init~int(357, ~#rc_keys~0.base, 46 + ~#rc_keys~0.offset, 2);call write~init~int(50, ~#rc_keys~0.base, 48 + ~#rc_keys~0.offset, 2);call write~init~int(385, ~#rc_keys~0.base, 50 + ~#rc_keys~0.offset, 2);~#fe_config~0.base, ~#fe_config~0.offset := 147, 0;call #Ultimate.allocInit(8, 147);call write~init~$Pointer$(#funAddr~fe_send_command.base, #funAddr~fe_send_command.offset, ~#fe_config~0.base, ~#fe_config~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~LDV_IN_INTERRUPT~0 := 0;~ldv_mutex_iso_mutex_of_ttusb_dec~0 := 0;~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0;~ldv_mutex_usb_mutex_of_ttusb_dec~0 := 0; {50164#(= 0 ~debug~0)} is VALID [2022-02-20 21:49:33,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {50164#(= 0 ~debug~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet807#1, main_#t~switch808#1, main_#t~ret809#1, main_#t~nondet810#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_ttusb_dec_probe_38_p1~0#1.base, main_~var_ttusb_dec_probe_38_p1~0#1.offset, main_~res_ttusb_dec_probe_38~0#1, main_~ldv_s_ttusb_dec_driver_usb_driver~0#1, main_~tmp~32#1, main_~tmp___0~13#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_ttusb_dec_probe_38_p1~0#1.base, main_~var_ttusb_dec_probe_38_p1~0#1.offset;havoc main_~res_ttusb_dec_probe_38~0#1;havoc main_~ldv_s_ttusb_dec_driver_usb_driver~0#1;havoc main_~tmp~32#1;havoc main_~tmp___0~13#1;main_~ldv_s_ttusb_dec_driver_usb_driver~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true;~ldv_mutex_iso_mutex_of_ttusb_dec~0 := 1;~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1;~ldv_mutex_usb_mutex_of_ttusb_dec~0 := 1; {50164#(= 0 ~debug~0)} is VALID [2022-02-20 21:49:33,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {50164#(= 0 ~debug~0)} assume { :end_inline_ldv_initialize } true; {50164#(= 0 ~debug~0)} is VALID [2022-02-20 21:49:33,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {50164#(= 0 ~debug~0)} assume -2147483648 <= main_#t~nondet810#1 && main_#t~nondet810#1 <= 2147483647;main_~tmp___0~13#1 := main_#t~nondet810#1;havoc main_#t~nondet810#1; {50164#(= 0 ~debug~0)} is VALID [2022-02-20 21:49:33,937 INFO L290 TraceCheckUtils]: 4: Hoare triple {50164#(= 0 ~debug~0)} assume 0 != main_~tmp___0~13#1 || 0 != main_~ldv_s_ttusb_dec_driver_usb_driver~0#1; {50164#(= 0 ~debug~0)} is VALID [2022-02-20 21:49:33,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {50164#(= 0 ~debug~0)} assume -2147483648 <= main_#t~nondet807#1 && main_#t~nondet807#1 <= 2147483647;main_~tmp~32#1 := main_#t~nondet807#1;havoc main_#t~nondet807#1;main_#t~switch808#1 := 0 == main_~tmp~32#1; {50164#(= 0 ~debug~0)} is VALID [2022-02-20 21:49:33,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {50164#(= 0 ~debug~0)} assume main_#t~switch808#1; {50164#(= 0 ~debug~0)} is VALID [2022-02-20 21:49:33,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {50164#(= 0 ~debug~0)} assume 0 == main_~ldv_s_ttusb_dec_driver_usb_driver~0#1;assume { :begin_inline_ttusb_dec_probe } true;ttusb_dec_probe_#in~intf#1.base, ttusb_dec_probe_#in~intf#1.offset, ttusb_dec_probe_#in~id#1.base, ttusb_dec_probe_#in~id#1.offset := main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_ttusb_dec_probe_38_p1~0#1.base, main_~var_ttusb_dec_probe_38_p1~0#1.offset;havoc ttusb_dec_probe_#res#1;havoc ttusb_dec_probe_#t~nondet769#1, ttusb_dec_probe_#t~ret770#1.base, ttusb_dec_probe_#t~ret770#1.offset, ttusb_dec_probe_#t~ret771#1.base, ttusb_dec_probe_#t~ret771#1.offset, ttusb_dec_probe_#t~nondet772#1, ttusb_dec_probe_#t~mem773#1, ttusb_dec_probe_#t~switch774#1, ttusb_dec_probe_#t~ret775#1, ttusb_dec_probe_#t~ret776#1, ttusb_dec_probe_#t~ret777#1, ttusb_dec_probe_#t~mem778#1, ttusb_dec_probe_#t~switch779#1, ttusb_dec_probe_#t~ret780#1.base, ttusb_dec_probe_#t~ret780#1.offset, ttusb_dec_probe_#t~ret781#1.base, ttusb_dec_probe_#t~ret781#1.offset, ttusb_dec_probe_#t~mem782#1.base, ttusb_dec_probe_#t~mem782#1.offset, ttusb_dec_probe_#t~nondet783#1, ttusb_dec_probe_#t~mem784#1.base, ttusb_dec_probe_#t~mem784#1.offset, ttusb_dec_probe_#t~mem785#1, ttusb_dec_probe_#t~mem786#1.base, ttusb_dec_probe_#t~mem786#1.offset, ttusb_dec_probe_#t~mem787#1, ttusb_dec_probe_#t~mem788#1.base, ttusb_dec_probe_#t~mem788#1.offset, ttusb_dec_probe_#t~ret789#1, ttusb_dec_probe_#t~nondet790#1, ttusb_dec_probe_#t~mem791#1.base, ttusb_dec_probe_#t~mem791#1.offset, ttusb_dec_probe_#t~mem792#1.base, ttusb_dec_probe_#t~mem792#1.offset, ttusb_dec_probe_#t~mem796#1.base, ttusb_dec_probe_#t~mem796#1.offset, ttusb_dec_probe_#t~mem797#1.base, ttusb_dec_probe_#t~mem797#1.offset, ttusb_dec_probe_#t~mem798#1.base, ttusb_dec_probe_#t~mem798#1.offset, ttusb_dec_probe_#t~ret799#1, ttusb_dec_probe_#t~ret800#1, ttusb_dec_probe_~intf#1.base, ttusb_dec_probe_~intf#1.offset, ttusb_dec_probe_~id#1.base, ttusb_dec_probe_~id#1.offset, ttusb_dec_probe_~udev~0#1.base, ttusb_dec_probe_~udev~0#1.offset, ttusb_dec_probe_~dec~10#1.base, ttusb_dec_probe_~dec~10#1.offset, ttusb_dec_probe_~tmp~30#1.base, ttusb_dec_probe_~tmp~30#1.offset, ttusb_dec_probe_~tmp___0~12#1, ttusb_dec_probe_~tmp___1~9#1, ttusb_dec_probe_~tmp___2~6#1;ttusb_dec_probe_~intf#1.base, ttusb_dec_probe_~intf#1.offset := ttusb_dec_probe_#in~intf#1.base, ttusb_dec_probe_#in~intf#1.offset;ttusb_dec_probe_~id#1.base, ttusb_dec_probe_~id#1.offset := ttusb_dec_probe_#in~id#1.base, ttusb_dec_probe_#in~id#1.offset;havoc ttusb_dec_probe_~udev~0#1.base, ttusb_dec_probe_~udev~0#1.offset;havoc ttusb_dec_probe_~dec~10#1.base, ttusb_dec_probe_~dec~10#1.offset;havoc ttusb_dec_probe_~tmp~30#1.base, ttusb_dec_probe_~tmp~30#1.offset;havoc ttusb_dec_probe_~tmp___0~12#1;havoc ttusb_dec_probe_~tmp___1~9#1;havoc ttusb_dec_probe_~tmp___2~6#1; {50164#(= 0 ~debug~0)} is VALID [2022-02-20 21:49:33,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {50164#(= 0 ~debug~0)} assume 0 != ~debug~0;havoc ttusb_dec_probe_#t~nondet769#1; {50163#false} is VALID [2022-02-20 21:49:33,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {50163#false} assume { :begin_inline_interface_to_usbdev } true;interface_to_usbdev_#in~intf#1.base, interface_to_usbdev_#in~intf#1.offset := ttusb_dec_probe_~intf#1.base, ttusb_dec_probe_~intf#1.offset;havoc interface_to_usbdev_#res#1.base, interface_to_usbdev_#res#1.offset;havoc interface_to_usbdev_#t~mem106#1.base, interface_to_usbdev_#t~mem106#1.offset, interface_to_usbdev_~intf#1.base, interface_to_usbdev_~intf#1.offset, interface_to_usbdev_~__mptr~0#1.base, interface_to_usbdev_~__mptr~0#1.offset;interface_to_usbdev_~intf#1.base, interface_to_usbdev_~intf#1.offset := interface_to_usbdev_#in~intf#1.base, interface_to_usbdev_#in~intf#1.offset;havoc interface_to_usbdev_~__mptr~0#1.base, interface_to_usbdev_~__mptr~0#1.offset;call interface_to_usbdev_#t~mem106#1.base, interface_to_usbdev_#t~mem106#1.offset := read~$Pointer$(interface_to_usbdev_~intf#1.base, 44 + interface_to_usbdev_~intf#1.offset, 8);interface_to_usbdev_~__mptr~0#1.base, interface_to_usbdev_~__mptr~0#1.offset := interface_to_usbdev_#t~mem106#1.base, interface_to_usbdev_#t~mem106#1.offset;havoc interface_to_usbdev_#t~mem106#1.base, interface_to_usbdev_#t~mem106#1.offset;interface_to_usbdev_#res#1.base, interface_to_usbdev_#res#1.offset := interface_to_usbdev_~__mptr~0#1.base, -226576 + interface_to_usbdev_~__mptr~0#1.offset; {50163#false} is VALID [2022-02-20 21:49:33,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {50163#false} ttusb_dec_probe_#t~ret770#1.base, ttusb_dec_probe_#t~ret770#1.offset := interface_to_usbdev_#res#1.base, interface_to_usbdev_#res#1.offset;assume { :end_inline_interface_to_usbdev } true;ttusb_dec_probe_~udev~0#1.base, ttusb_dec_probe_~udev~0#1.offset := ttusb_dec_probe_#t~ret770#1.base, ttusb_dec_probe_#t~ret770#1.offset;havoc ttusb_dec_probe_#t~ret770#1.base, ttusb_dec_probe_#t~ret770#1.offset; {50163#false} is VALID [2022-02-20 21:49:33,939 INFO L272 TraceCheckUtils]: 11: Hoare triple {50163#false} call ttusb_dec_probe_#t~ret771#1.base, ttusb_dec_probe_#t~ret771#1.offset := kzalloc(15656, 208); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;~flags := #in~flags;havoc ~tmp~2.base, ~tmp~2.offset; {50162#true} is VALID [2022-02-20 21:49:33,940 INFO L272 TraceCheckUtils]: 13: Hoare triple {50162#true} call #t~ret46.base, #t~ret46.offset := kmalloc(~size, ~bitwiseOr(~flags, 32768)); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {50162#true} is VALID [2022-02-20 21:49:33,941 INFO L272 TraceCheckUtils]: 15: Hoare triple {50162#true} call __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset := ldv_malloc(__kmalloc_~size#1); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647; {50162#true} is VALID [2022-02-20 21:49:33,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {50162#true} assume !(0 != #t~nondet41#1);havoc #t~nondet41#1;#res#1.base, #res#1.offset := 0, 0; {50162#true} is VALID [2022-02-20 21:49:33,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,941 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {50162#true} {50162#true} #2247#return; {50162#true} is VALID [2022-02-20 21:49:33,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {50162#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset;havoc __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset; {50162#true} is VALID [2022-02-20 21:49:33,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {50162#true} #t~ret45#1.base, #t~ret45#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret45#1.base, #t~ret45#1.offset;havoc #t~ret45#1.base, #t~ret45#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {50162#true} is VALID [2022-02-20 21:49:33,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,942 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {50162#true} {50162#true} #2241#return; {50162#true} is VALID [2022-02-20 21:49:33,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {50162#true} ~tmp~2.base, ~tmp~2.offset := #t~ret46.base, #t~ret46.offset;havoc #t~ret46.base, #t~ret46.offset;#res.base, #res.offset := ~tmp~2.base, ~tmp~2.offset; {50162#true} is VALID [2022-02-20 21:49:33,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,942 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {50162#true} {50163#false} #2295#return; {50163#false} is VALID [2022-02-20 21:49:33,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {50163#false} ttusb_dec_probe_~tmp~30#1.base, ttusb_dec_probe_~tmp~30#1.offset := ttusb_dec_probe_#t~ret771#1.base, ttusb_dec_probe_#t~ret771#1.offset;havoc ttusb_dec_probe_#t~ret771#1.base, ttusb_dec_probe_#t~ret771#1.offset;ttusb_dec_probe_~dec~10#1.base, ttusb_dec_probe_~dec~10#1.offset := ttusb_dec_probe_~tmp~30#1.base, ttusb_dec_probe_~tmp~30#1.offset; {50163#false} is VALID [2022-02-20 21:49:33,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {50163#false} assume !(0 == (ttusb_dec_probe_~dec~10#1.base + ttusb_dec_probe_~dec~10#1.offset) % 18446744073709551616); {50163#false} is VALID [2022-02-20 21:49:33,943 INFO L272 TraceCheckUtils]: 29: Hoare triple {50163#false} call usb_set_intfdata(ttusb_dec_probe_~intf#1.base, ttusb_dec_probe_~intf#1.offset, ttusb_dec_probe_~dec~10#1.base, ttusb_dec_probe_~dec~10#1.offset); {50162#true} is VALID [2022-02-20 21:49:33,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {50162#true} ~intf#1.base, ~intf#1.offset := #in~intf#1.base, #in~intf#1.offset;~data#1.base, ~data#1.offset := #in~data#1.base, #in~data#1.offset;assume { :begin_inline_dev_set_drvdata } true;dev_set_drvdata_#in~arg0#1.base, dev_set_drvdata_#in~arg0#1.offset, dev_set_drvdata_#in~arg1#1.base, dev_set_drvdata_#in~arg1#1.offset := ~intf#1.base, 44 + ~intf#1.offset, ~data#1.base, ~data#1.offset;havoc dev_set_drvdata_#res#1;havoc dev_set_drvdata_#t~nondet842#1, dev_set_drvdata_~arg0#1.base, dev_set_drvdata_~arg0#1.offset, dev_set_drvdata_~arg1#1.base, dev_set_drvdata_~arg1#1.offset;dev_set_drvdata_~arg0#1.base, dev_set_drvdata_~arg0#1.offset := dev_set_drvdata_#in~arg0#1.base, dev_set_drvdata_#in~arg0#1.offset;dev_set_drvdata_~arg1#1.base, dev_set_drvdata_~arg1#1.offset := dev_set_drvdata_#in~arg1#1.base, dev_set_drvdata_#in~arg1#1.offset;assume -2147483648 <= dev_set_drvdata_#t~nondet842#1 && dev_set_drvdata_#t~nondet842#1 <= 2147483647;dev_set_drvdata_#res#1 := dev_set_drvdata_#t~nondet842#1;havoc dev_set_drvdata_#t~nondet842#1; {50162#true} is VALID [2022-02-20 21:49:33,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {50162#true} #t~ret105#1 := dev_set_drvdata_#res#1;assume { :end_inline_dev_set_drvdata } true;assume -2147483648 <= #t~ret105#1 && #t~ret105#1 <= 2147483647;havoc #t~ret105#1; {50162#true} is VALID [2022-02-20 21:49:33,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,943 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {50162#true} {50163#false} #2297#return; {50163#false} is VALID [2022-02-20 21:49:33,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {50163#false} call ttusb_dec_probe_#t~mem773#1 := read~int(ttusb_dec_probe_~id#1.base, 4 + ttusb_dec_probe_~id#1.offset, 2);ttusb_dec_probe_#t~switch774#1 := 4102 == ttusb_dec_probe_#t~mem773#1 % 65536; {50163#false} is VALID [2022-02-20 21:49:33,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {50163#false} assume !ttusb_dec_probe_#t~switch774#1;ttusb_dec_probe_#t~switch774#1 := ttusb_dec_probe_#t~switch774#1 || 4104 == ttusb_dec_probe_#t~mem773#1 % 65536; {50163#false} is VALID [2022-02-20 21:49:33,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {50163#false} assume !ttusb_dec_probe_#t~switch774#1;ttusb_dec_probe_#t~switch774#1 := ttusb_dec_probe_#t~switch774#1 || 4105 == ttusb_dec_probe_#t~mem773#1 % 65536; {50163#false} is VALID [2022-02-20 21:49:33,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {50163#false} assume !ttusb_dec_probe_#t~switch774#1; {50163#false} is VALID [2022-02-20 21:49:33,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {50163#false} havoc ttusb_dec_probe_#t~mem773#1;havoc ttusb_dec_probe_#t~switch774#1; {50163#false} is VALID [2022-02-20 21:49:33,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {50163#false} call write~$Pointer$(ttusb_dec_probe_~udev~0#1.base, ttusb_dec_probe_~udev~0#1.offset, ttusb_dec_probe_~dec~10#1.base, 2012 + ttusb_dec_probe_~dec~10#1.offset, 8);assume { :begin_inline_ttusb_dec_init_usb } true;ttusb_dec_init_usb_#in~dec#1.base, ttusb_dec_init_usb_#in~dec#1.offset := ttusb_dec_probe_~dec~10#1.base, ttusb_dec_probe_~dec~10#1.offset;havoc ttusb_dec_init_usb_#res#1;havoc ttusb_dec_init_usb_#t~nondet614#1, ttusb_dec_init_usb_#t~mem615#1.base, ttusb_dec_init_usb_#t~mem615#1.offset, ttusb_dec_init_usb_#t~ret616#1, ttusb_dec_init_usb_#t~mem617#1.base, ttusb_dec_init_usb_#t~mem617#1.offset, ttusb_dec_init_usb_#t~ret618#1, ttusb_dec_init_usb_#t~mem619#1.base, ttusb_dec_init_usb_#t~mem619#1.offset, ttusb_dec_init_usb_#t~ret620#1, ttusb_dec_init_usb_#t~mem621#1.base, ttusb_dec_init_usb_#t~mem621#1.offset, ttusb_dec_init_usb_#t~ret622#1, ttusb_dec_init_usb_#t~mem623#1.base, ttusb_dec_init_usb_#t~mem623#1.offset, ttusb_dec_init_usb_#t~ret624#1, ttusb_dec_init_usb_#t~ret625#1.base, ttusb_dec_init_usb_#t~ret625#1.offset, ttusb_dec_init_usb_#t~mem626#1.base, ttusb_dec_init_usb_#t~mem626#1.offset, ttusb_dec_init_usb_#t~mem627#1.base, ttusb_dec_init_usb_#t~mem627#1.offset, ttusb_dec_init_usb_#t~ret628#1.base, ttusb_dec_init_usb_#t~ret628#1.offset, ttusb_dec_init_usb_#t~mem629#1.base, ttusb_dec_init_usb_#t~mem629#1.offset, ttusb_dec_init_usb_#t~mem630#1.base, ttusb_dec_init_usb_#t~mem630#1.offset, ttusb_dec_init_usb_#t~mem631#1.base, ttusb_dec_init_usb_#t~mem631#1.offset, ttusb_dec_init_usb_#t~mem632#1.base, ttusb_dec_init_usb_#t~mem632#1.offset, ttusb_dec_init_usb_#t~mem633#1, ttusb_dec_init_usb_#t~mem634#1.base, ttusb_dec_init_usb_#t~mem634#1.offset, ttusb_dec_init_usb_#t~mem635#1.base, ttusb_dec_init_usb_#t~mem635#1.offset, ttusb_dec_init_usb_#t~mem636#1, ttusb_dec_init_usb_#t~mem637#1.base, ttusb_dec_init_usb_#t~mem637#1.offset, ttusb_dec_init_usb_#t~mem638#1.base, ttusb_dec_init_usb_#t~mem638#1.offset, ttusb_dec_init_usb_#t~mem639#1, ttusb_dec_init_usb_#t~ret640#1, ttusb_dec_init_usb_~dec#1.base, ttusb_dec_init_usb_~dec#1.offset, ttusb_dec_init_usb_~#__key~1#1.base, ttusb_dec_init_usb_~#__key~1#1.offset, ttusb_dec_init_usb_~#__key___0~0#1.base, ttusb_dec_init_usb_~#__key___0~0#1.offset, ttusb_dec_init_usb_~tmp~27#1, ttusb_dec_init_usb_~tmp___0~10#1, ttusb_dec_init_usb_~tmp___1~7#1, ttusb_dec_init_usb_~tmp___2~4#1, ttusb_dec_init_usb_~tmp___3~1#1;ttusb_dec_init_usb_~dec#1.base, ttusb_dec_init_usb_~dec#1.offset := ttusb_dec_init_usb_#in~dec#1.base, ttusb_dec_init_usb_#in~dec#1.offset;call ttusb_dec_init_usb_~#__key~1#1.base, ttusb_dec_init_usb_~#__key~1#1.offset := #Ultimate.allocOnStack(8);call ttusb_dec_init_usb_~#__key___0~0#1.base, ttusb_dec_init_usb_~#__key___0~0#1.offset := #Ultimate.allocOnStack(8);havoc ttusb_dec_init_usb_~tmp~27#1;havoc ttusb_dec_init_usb_~tmp___0~10#1;havoc ttusb_dec_init_usb_~tmp___1~7#1;havoc ttusb_dec_init_usb_~tmp___2~4#1;havoc ttusb_dec_init_usb_~tmp___3~1#1; {50163#false} is VALID [2022-02-20 21:49:33,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {50163#false} assume 0 != ~debug~0;havoc ttusb_dec_init_usb_#t~nondet614#1; {50163#false} is VALID [2022-02-20 21:49:33,945 INFO L272 TraceCheckUtils]: 41: Hoare triple {50163#false} call __mutex_init(ttusb_dec_init_usb_~dec#1.base, 2045 + ttusb_dec_init_usb_~dec#1.offset, 95, 0, ttusb_dec_init_usb_~#__key~1#1.base, ttusb_dec_init_usb_~#__key~1#1.offset); {50162#true} is VALID [2022-02-20 21:49:33,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {50162#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {50162#true} is VALID [2022-02-20 21:49:33,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,945 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {50162#true} {50163#false} #2305#return; {50163#false} is VALID [2022-02-20 21:49:33,945 INFO L272 TraceCheckUtils]: 45: Hoare triple {50163#false} call __mutex_init(ttusb_dec_init_usb_~dec#1.base, 2277 + ttusb_dec_init_usb_~dec#1.offset, 96, 0, ttusb_dec_init_usb_~#__key___0~0#1.base, ttusb_dec_init_usb_~#__key___0~0#1.offset); {50162#true} is VALID [2022-02-20 21:49:33,945 INFO L290 TraceCheckUtils]: 46: Hoare triple {50162#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {50162#true} is VALID [2022-02-20 21:49:33,945 INFO L290 TraceCheckUtils]: 47: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,946 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {50162#true} {50163#false} #2307#return; {50163#false} is VALID [2022-02-20 21:49:33,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {50163#false} call ttusb_dec_init_usb_#t~mem615#1.base, ttusb_dec_init_usb_#t~mem615#1.offset := read~$Pointer$(ttusb_dec_init_usb_~dec#1.base, 2012 + ttusb_dec_init_usb_~dec#1.offset, 8); {50163#false} is VALID [2022-02-20 21:49:33,946 INFO L272 TraceCheckUtils]: 50: Hoare triple {50163#false} call ttusb_dec_init_usb_#t~ret616#1 := __create_pipe(ttusb_dec_init_usb_#t~mem615#1.base, ttusb_dec_init_usb_#t~mem615#1.offset, 3); {50162#true} is VALID [2022-02-20 21:49:33,946 INFO L290 TraceCheckUtils]: 51: Hoare triple {50162#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~endpoint := #in~endpoint;call #t~mem137 := read~int(~dev.base, ~dev.offset, 4);#res := (if (1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 0 == 32768 * ~endpoint then 256 * #t~mem137 else (if 0 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint) then 32768 * ~endpoint else (if (1 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint)) || ((1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 1 == 32768 * ~endpoint) then 1 else ~bitwiseOr(256 * #t~mem137, 32768 * ~endpoint))));havoc #t~mem137; {50162#true} is VALID [2022-02-20 21:49:33,946 INFO L290 TraceCheckUtils]: 52: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,946 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {50162#true} {50163#false} #2309#return; {50163#false} is VALID [2022-02-20 21:49:33,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {50163#false} ttusb_dec_init_usb_~tmp~27#1 := ttusb_dec_init_usb_#t~ret616#1;havoc ttusb_dec_init_usb_#t~mem615#1.base, ttusb_dec_init_usb_#t~mem615#1.offset;havoc ttusb_dec_init_usb_#t~ret616#1;call write~int(~bitwiseOr(ttusb_dec_init_usb_~tmp~27#1, 3221225472), ttusb_dec_init_usb_~dec#1.base, 2021 + ttusb_dec_init_usb_~dec#1.offset, 4);call ttusb_dec_init_usb_#t~mem617#1.base, ttusb_dec_init_usb_#t~mem617#1.offset := read~$Pointer$(ttusb_dec_init_usb_~dec#1.base, 2012 + ttusb_dec_init_usb_~dec#1.offset, 8); {50163#false} is VALID [2022-02-20 21:49:33,947 INFO L272 TraceCheckUtils]: 55: Hoare triple {50163#false} call ttusb_dec_init_usb_#t~ret618#1 := __create_pipe(ttusb_dec_init_usb_#t~mem617#1.base, ttusb_dec_init_usb_#t~mem617#1.offset, 4); {50162#true} is VALID [2022-02-20 21:49:33,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {50162#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~endpoint := #in~endpoint;call #t~mem137 := read~int(~dev.base, ~dev.offset, 4);#res := (if (1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 0 == 32768 * ~endpoint then 256 * #t~mem137 else (if 0 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint) then 32768 * ~endpoint else (if (1 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint)) || ((1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 1 == 32768 * ~endpoint) then 1 else ~bitwiseOr(256 * #t~mem137, 32768 * ~endpoint))));havoc #t~mem137; {50162#true} is VALID [2022-02-20 21:49:33,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,947 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {50162#true} {50163#false} #2311#return; {50163#false} is VALID [2022-02-20 21:49:33,947 INFO L290 TraceCheckUtils]: 59: Hoare triple {50163#false} ttusb_dec_init_usb_~tmp___0~10#1 := ttusb_dec_init_usb_#t~ret618#1;havoc ttusb_dec_init_usb_#t~mem617#1.base, ttusb_dec_init_usb_#t~mem617#1.offset;havoc ttusb_dec_init_usb_#t~ret618#1;call write~int(~bitwiseOr(ttusb_dec_init_usb_~tmp___0~10#1, 3221225600), ttusb_dec_init_usb_~dec#1.base, 2025 + ttusb_dec_init_usb_~dec#1.offset, 4);call ttusb_dec_init_usb_#t~mem619#1.base, ttusb_dec_init_usb_#t~mem619#1.offset := read~$Pointer$(ttusb_dec_init_usb_~dec#1.base, 2012 + ttusb_dec_init_usb_~dec#1.offset, 8); {50163#false} is VALID [2022-02-20 21:49:33,947 INFO L272 TraceCheckUtils]: 60: Hoare triple {50163#false} call ttusb_dec_init_usb_#t~ret620#1 := __create_pipe(ttusb_dec_init_usb_#t~mem619#1.base, ttusb_dec_init_usb_#t~mem619#1.offset, 8); {50162#true} is VALID [2022-02-20 21:49:33,947 INFO L290 TraceCheckUtils]: 61: Hoare triple {50162#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~endpoint := #in~endpoint;call #t~mem137 := read~int(~dev.base, ~dev.offset, 4);#res := (if (1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 0 == 32768 * ~endpoint then 256 * #t~mem137 else (if 0 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint) then 32768 * ~endpoint else (if (1 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint)) || ((1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 1 == 32768 * ~endpoint) then 1 else ~bitwiseOr(256 * #t~mem137, 32768 * ~endpoint))));havoc #t~mem137; {50162#true} is VALID [2022-02-20 21:49:33,948 INFO L290 TraceCheckUtils]: 62: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,948 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {50162#true} {50163#false} #2313#return; {50163#false} is VALID [2022-02-20 21:49:33,948 INFO L290 TraceCheckUtils]: 64: Hoare triple {50163#false} ttusb_dec_init_usb_~tmp___1~7#1 := ttusb_dec_init_usb_#t~ret620#1;havoc ttusb_dec_init_usb_#t~mem619#1.base, ttusb_dec_init_usb_#t~mem619#1.offset;havoc ttusb_dec_init_usb_#t~ret620#1;call write~int(~bitwiseOr(ttusb_dec_init_usb_~tmp___1~7#1, 128), ttusb_dec_init_usb_~dec#1.base, 2029 + ttusb_dec_init_usb_~dec#1.offset, 4);call ttusb_dec_init_usb_#t~mem621#1.base, ttusb_dec_init_usb_#t~mem621#1.offset := read~$Pointer$(ttusb_dec_init_usb_~dec#1.base, 2012 + ttusb_dec_init_usb_~dec#1.offset, 8); {50163#false} is VALID [2022-02-20 21:49:33,948 INFO L272 TraceCheckUtils]: 65: Hoare triple {50163#false} call ttusb_dec_init_usb_#t~ret622#1 := __create_pipe(ttusb_dec_init_usb_#t~mem621#1.base, ttusb_dec_init_usb_#t~mem621#1.offset, 7); {50162#true} is VALID [2022-02-20 21:49:33,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {50162#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~endpoint := #in~endpoint;call #t~mem137 := read~int(~dev.base, ~dev.offset, 4);#res := (if (1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 0 == 32768 * ~endpoint then 256 * #t~mem137 else (if 0 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint) then 32768 * ~endpoint else (if (1 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint)) || ((1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 1 == 32768 * ~endpoint) then 1 else ~bitwiseOr(256 * #t~mem137, 32768 * ~endpoint))));havoc #t~mem137; {50162#true} is VALID [2022-02-20 21:49:33,948 INFO L290 TraceCheckUtils]: 67: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,951 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {50162#true} {50163#false} #2315#return; {50163#false} is VALID [2022-02-20 21:49:33,951 INFO L290 TraceCheckUtils]: 69: Hoare triple {50163#false} call write~int(ttusb_dec_init_usb_#t~ret622#1, ttusb_dec_init_usb_~dec#1.base, 2033 + ttusb_dec_init_usb_~dec#1.offset, 4);havoc ttusb_dec_init_usb_#t~mem621#1.base, ttusb_dec_init_usb_#t~mem621#1.offset;havoc ttusb_dec_init_usb_#t~ret622#1;call ttusb_dec_init_usb_#t~mem623#1.base, ttusb_dec_init_usb_#t~mem623#1.offset := read~$Pointer$(ttusb_dec_init_usb_~dec#1.base, 2012 + ttusb_dec_init_usb_~dec#1.offset, 8); {50163#false} is VALID [2022-02-20 21:49:33,952 INFO L272 TraceCheckUtils]: 70: Hoare triple {50163#false} call ttusb_dec_init_usb_#t~ret624#1 := __create_pipe(ttusb_dec_init_usb_#t~mem623#1.base, ttusb_dec_init_usb_#t~mem623#1.offset, 10); {50162#true} is VALID [2022-02-20 21:49:33,952 INFO L290 TraceCheckUtils]: 71: Hoare triple {50162#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~endpoint := #in~endpoint;call #t~mem137 := read~int(~dev.base, ~dev.offset, 4);#res := (if (1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 0 == 32768 * ~endpoint then 256 * #t~mem137 else (if 0 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint) then 32768 * ~endpoint else (if (1 == 256 * #t~mem137 && (1 == 32768 * ~endpoint || 0 == 32768 * ~endpoint)) || ((1 == 256 * #t~mem137 || 0 == 256 * #t~mem137) && 1 == 32768 * ~endpoint) then 1 else ~bitwiseOr(256 * #t~mem137, 32768 * ~endpoint))));havoc #t~mem137; {50162#true} is VALID [2022-02-20 21:49:33,952 INFO L290 TraceCheckUtils]: 72: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,952 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {50162#true} {50163#false} #2317#return; {50163#false} is VALID [2022-02-20 21:49:33,952 INFO L290 TraceCheckUtils]: 74: Hoare triple {50163#false} ttusb_dec_init_usb_~tmp___2~4#1 := ttusb_dec_init_usb_#t~ret624#1;havoc ttusb_dec_init_usb_#t~mem623#1.base, ttusb_dec_init_usb_#t~mem623#1.offset;havoc ttusb_dec_init_usb_#t~ret624#1;call write~int(~bitwiseOr(ttusb_dec_init_usb_~tmp___2~4#1, 1073741952), ttusb_dec_init_usb_~dec#1.base, 2037 + ttusb_dec_init_usb_~dec#1.offset, 4); {50163#false} is VALID [2022-02-20 21:49:33,952 INFO L290 TraceCheckUtils]: 75: Hoare triple {50163#false} assume 0 != ~enable_rc~0; {50163#false} is VALID [2022-02-20 21:49:33,952 INFO L272 TraceCheckUtils]: 76: Hoare triple {50163#false} call ttusb_dec_init_usb_#t~ret625#1.base, ttusb_dec_init_usb_#t~ret625#1.offset := usb_alloc_urb(0, 208); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,953 INFO L290 TraceCheckUtils]: 77: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0;~arg1 := #in~arg1; {50162#true} is VALID [2022-02-20 21:49:33,953 INFO L272 TraceCheckUtils]: 78: Hoare triple {50162#true} call #t~ret860.base, #t~ret860.offset := ldv_malloc(184); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,953 INFO L290 TraceCheckUtils]: 79: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647; {50162#true} is VALID [2022-02-20 21:49:33,954 INFO L290 TraceCheckUtils]: 80: Hoare triple {50162#true} assume !(0 != #t~nondet41#1);havoc #t~nondet41#1;#res#1.base, #res#1.offset := 0, 0; {50162#true} is VALID [2022-02-20 21:49:33,954 INFO L290 TraceCheckUtils]: 81: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,954 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {50162#true} {50162#true} #2293#return; {50162#true} is VALID [2022-02-20 21:49:33,954 INFO L290 TraceCheckUtils]: 83: Hoare triple {50162#true} #res.base, #res.offset := #t~ret860.base, #t~ret860.offset;havoc #t~ret860.base, #t~ret860.offset; {50162#true} is VALID [2022-02-20 21:49:33,954 INFO L290 TraceCheckUtils]: 84: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,954 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {50162#true} {50163#false} #2319#return; {50163#false} is VALID [2022-02-20 21:49:33,954 INFO L290 TraceCheckUtils]: 86: Hoare triple {50163#false} call write~$Pointer$(ttusb_dec_init_usb_#t~ret625#1.base, ttusb_dec_init_usb_#t~ret625#1.offset, ttusb_dec_init_usb_~dec#1.base, 2209 + ttusb_dec_init_usb_~dec#1.offset, 8);havoc ttusb_dec_init_usb_#t~ret625#1.base, ttusb_dec_init_usb_#t~ret625#1.offset;call ttusb_dec_init_usb_#t~mem626#1.base, ttusb_dec_init_usb_#t~mem626#1.offset := read~$Pointer$(ttusb_dec_init_usb_~dec#1.base, 2209 + ttusb_dec_init_usb_~dec#1.offset, 8); {50163#false} is VALID [2022-02-20 21:49:33,955 INFO L290 TraceCheckUtils]: 87: Hoare triple {50163#false} assume 0 == (ttusb_dec_init_usb_#t~mem626#1.base + ttusb_dec_init_usb_#t~mem626#1.offset) % 18446744073709551616;havoc ttusb_dec_init_usb_#t~mem626#1.base, ttusb_dec_init_usb_#t~mem626#1.offset;ttusb_dec_init_usb_#res#1 := -12;call ULTIMATE.dealloc(ttusb_dec_init_usb_~#__key~1#1.base, ttusb_dec_init_usb_~#__key~1#1.offset);havoc ttusb_dec_init_usb_~#__key~1#1.base, ttusb_dec_init_usb_~#__key~1#1.offset;call ULTIMATE.dealloc(ttusb_dec_init_usb_~#__key___0~0#1.base, ttusb_dec_init_usb_~#__key___0~0#1.offset);havoc ttusb_dec_init_usb_~#__key___0~0#1.base, ttusb_dec_init_usb_~#__key___0~0#1.offset; {50163#false} is VALID [2022-02-20 21:49:33,955 INFO L290 TraceCheckUtils]: 88: Hoare triple {50163#false} ttusb_dec_probe_#t~ret775#1 := ttusb_dec_init_usb_#res#1;assume { :end_inline_ttusb_dec_init_usb } true;assume -2147483648 <= ttusb_dec_probe_#t~ret775#1 && ttusb_dec_probe_#t~ret775#1 <= 2147483647;ttusb_dec_probe_~tmp___0~12#1 := ttusb_dec_probe_#t~ret775#1;havoc ttusb_dec_probe_#t~ret775#1; {50163#false} is VALID [2022-02-20 21:49:33,955 INFO L290 TraceCheckUtils]: 89: Hoare triple {50163#false} assume !(0 != ttusb_dec_probe_~tmp___0~12#1);assume { :begin_inline_ttusb_dec_init_stb } true;ttusb_dec_init_stb_#in~dec#1.base, ttusb_dec_init_stb_#in~dec#1.offset := ttusb_dec_probe_~dec~10#1.base, ttusb_dec_probe_~dec~10#1.offset;havoc ttusb_dec_init_stb_#res#1;havoc ttusb_dec_init_stb_#t~nondet683#1, ttusb_dec_init_stb_#t~ret684#1, ttusb_dec_init_stb_#t~mem685#1, ttusb_dec_init_stb_#t~mem686#1, ttusb_dec_init_stb_#t~nondet687#1, ttusb_dec_init_stb_#t~nondet688#1, ttusb_dec_init_stb_#t~mem689#1, ttusb_dec_init_stb_#t~mem690#1, ttusb_dec_init_stb_#t~mem691#1, ttusb_dec_init_stb_#t~mem692#1, ttusb_dec_init_stb_#t~ret693#1, ttusb_dec_init_stb_#t~mem694#1, ttusb_dec_init_stb_#t~switch695#1, ttusb_dec_init_stb_#t~nondet696#1, ttusb_dec_init_stb_#t~mem697#1, ttusb_dec_init_stb_#t~mem698#1, ttusb_dec_init_stb_~dec#1.base, ttusb_dec_init_stb_~dec#1.offset, ttusb_dec_init_stb_~result~7#1, ttusb_dec_init_stb_~#mode~0#1.base, ttusb_dec_init_stb_~#mode~0#1.offset, ttusb_dec_init_stb_~#model~0#1.base, ttusb_dec_init_stb_~#model~0#1.offset, ttusb_dec_init_stb_~#version~0#1.base, ttusb_dec_init_stb_~#version~0#1.offset;ttusb_dec_init_stb_~dec#1.base, ttusb_dec_init_stb_~dec#1.offset := ttusb_dec_init_stb_#in~dec#1.base, ttusb_dec_init_stb_#in~dec#1.offset;havoc ttusb_dec_init_stb_~result~7#1;call ttusb_dec_init_stb_~#mode~0#1.base, ttusb_dec_init_stb_~#mode~0#1.offset := #Ultimate.allocOnStack(4);call ttusb_dec_init_stb_~#model~0#1.base, ttusb_dec_init_stb_~#model~0#1.offset := #Ultimate.allocOnStack(4);call ttusb_dec_init_stb_~#version~0#1.base, ttusb_dec_init_stb_~#version~0#1.offset := #Ultimate.allocOnStack(4);call write~int(0, ttusb_dec_init_stb_~#mode~0#1.base, ttusb_dec_init_stb_~#mode~0#1.offset, 4);call write~int(0, ttusb_dec_init_stb_~#model~0#1.base, ttusb_dec_init_stb_~#model~0#1.offset, 4);call write~int(0, ttusb_dec_init_stb_~#version~0#1.base, ttusb_dec_init_stb_~#version~0#1.offset, 4); {50163#false} is VALID [2022-02-20 21:49:33,955 INFO L290 TraceCheckUtils]: 90: Hoare triple {50163#false} assume 0 != ~debug~0;havoc ttusb_dec_init_stb_#t~nondet683#1; {50163#false} is VALID [2022-02-20 21:49:33,955 INFO L290 TraceCheckUtils]: 91: Hoare triple {50163#false} assume { :begin_inline_ttusb_dec_get_stb_state } true;ttusb_dec_get_stb_state_#in~dec#1.base, ttusb_dec_get_stb_state_#in~dec#1.offset, ttusb_dec_get_stb_state_#in~mode#1.base, ttusb_dec_get_stb_state_#in~mode#1.offset, ttusb_dec_get_stb_state_#in~model#1.base, ttusb_dec_get_stb_state_#in~model#1.offset, ttusb_dec_get_stb_state_#in~version#1.base, ttusb_dec_get_stb_state_#in~version#1.offset := ttusb_dec_init_stb_~dec#1.base, ttusb_dec_init_stb_~dec#1.offset, ttusb_dec_init_stb_~#mode~0#1.base, ttusb_dec_init_stb_~#mode~0#1.offset, ttusb_dec_init_stb_~#model~0#1.base, ttusb_dec_init_stb_~#model~0#1.offset, ttusb_dec_init_stb_~#version~0#1.base, ttusb_dec_init_stb_~#version~0#1.offset;havoc ttusb_dec_get_stb_state_#res#1;havoc ttusb_dec_get_stb_state_#t~nondet236#1, ttusb_dec_get_stb_state_#t~ret237#1, ttusb_dec_get_stb_state_#t~mem238#1, ttusb_dec_get_stb_state_#t~memcpy~res239#1.base, ttusb_dec_get_stb_state_#t~memcpy~res239#1.offset, ttusb_dec_get_stb_state_#t~memcpy~res240#1.base, ttusb_dec_get_stb_state_#t~memcpy~res240#1.offset, ttusb_dec_get_stb_state_#t~mem241#1, ttusb_dec_get_stb_state_#t~ret242#1, ttusb_dec_get_stb_state_#t~memcpy~res243#1.base, ttusb_dec_get_stb_state_#t~memcpy~res243#1.offset, ttusb_dec_get_stb_state_#t~memcpy~res244#1.base, ttusb_dec_get_stb_state_#t~memcpy~res244#1.offset, ttusb_dec_get_stb_state_#t~mem245#1, ttusb_dec_get_stb_state_#t~ret246#1, ttusb_dec_get_stb_state_#t~memcpy~res247#1.base, ttusb_dec_get_stb_state_#t~memcpy~res247#1.offset, ttusb_dec_get_stb_state_#t~memcpy~res248#1.base, ttusb_dec_get_stb_state_#t~memcpy~res248#1.offset, ttusb_dec_get_stb_state_#t~mem249#1, ttusb_dec_get_stb_state_#t~ret250#1, ttusb_dec_get_stb_state_~dec#1.base, ttusb_dec_get_stb_state_~dec#1.offset, ttusb_dec_get_stb_state_~mode#1.base, ttusb_dec_get_stb_state_~mode#1.offset, ttusb_dec_get_stb_state_~model#1.base, ttusb_dec_get_stb_state_~model#1.offset, ttusb_dec_get_stb_state_~version#1.base, ttusb_dec_get_stb_state_~version#1.offset, ttusb_dec_get_stb_state_~#c~0#1.base, ttusb_dec_get_stb_state_~#c~0#1.offset, ttusb_dec_get_stb_state_~#c_length~0#1.base, ttusb_dec_get_stb_state_~#c_length~0#1.offset, ttusb_dec_get_stb_state_~result~1#1, ttusb_dec_get_stb_state_~#tmp~12#1.base, ttusb_dec_get_stb_state_~#tmp~12#1.offset, ttusb_dec_get_stb_state_~__len~1#1, ttusb_dec_get_stb_state_~__ret~2#1.base, ttusb_dec_get_stb_state_~__ret~2#1.offset, ttusb_dec_get_stb_state_~tmp___0~3#1, ttusb_dec_get_stb_state_~__len___0~1#1, ttusb_dec_get_stb_state_~__ret___0~1#1.base, ttusb_dec_get_stb_state_~__ret___0~1#1.offset, ttusb_dec_get_stb_state_~tmp___1~3#1, ttusb_dec_get_stb_state_~__len___1~0#1, ttusb_dec_get_stb_state_~__ret___1~0#1.base, ttusb_dec_get_stb_state_~__ret___1~0#1.offset, ttusb_dec_get_stb_state_~tmp___2~1#1;ttusb_dec_get_stb_state_~dec#1.base, ttusb_dec_get_stb_state_~dec#1.offset := ttusb_dec_get_stb_state_#in~dec#1.base, ttusb_dec_get_stb_state_#in~dec#1.offset;ttusb_dec_get_stb_state_~mode#1.base, ttusb_dec_get_stb_state_~mode#1.offset := ttusb_dec_get_stb_state_#in~mode#1.base, ttusb_dec_get_stb_state_#in~mode#1.offset;ttusb_dec_get_stb_state_~model#1.base, ttusb_dec_get_stb_state_~model#1.offset := ttusb_dec_get_stb_state_#in~model#1.base, ttusb_dec_get_stb_state_#in~model#1.offset;ttusb_dec_get_stb_state_~version#1.base, ttusb_dec_get_stb_state_~version#1.offset := ttusb_dec_get_stb_state_#in~version#1.base, ttusb_dec_get_stb_state_#in~version#1.offset;call ttusb_dec_get_stb_state_~#c~0#1.base, ttusb_dec_get_stb_state_~#c~0#1.offset := #Ultimate.allocOnStack(60);call ttusb_dec_get_stb_state_~#c_length~0#1.base, ttusb_dec_get_stb_state_~#c_length~0#1.offset := #Ultimate.allocOnStack(4);havoc ttusb_dec_get_stb_state_~result~1#1;call ttusb_dec_get_stb_state_~#tmp~12#1.base, ttusb_dec_get_stb_state_~#tmp~12#1.offset := #Ultimate.allocOnStack(4);havoc ttusb_dec_get_stb_state_~__len~1#1;havoc ttusb_dec_get_stb_state_~__ret~2#1.base, ttusb_dec_get_stb_state_~__ret~2#1.offset;havoc ttusb_dec_get_stb_state_~tmp___0~3#1;havoc ttusb_dec_get_stb_state_~__len___0~1#1;havoc ttusb_dec_get_stb_state_~__ret___0~1#1.base, ttusb_dec_get_stb_state_~__ret___0~1#1.offset;havoc ttusb_dec_get_stb_state_~tmp___1~3#1;havoc ttusb_dec_get_stb_state_~__len___1~0#1;havoc ttusb_dec_get_stb_state_~__ret___1~0#1.base, ttusb_dec_get_stb_state_~__ret___1~0#1.offset;havoc ttusb_dec_get_stb_state_~tmp___2~1#1; {50163#false} is VALID [2022-02-20 21:49:33,955 INFO L290 TraceCheckUtils]: 92: Hoare triple {50163#false} assume 0 != ~debug~0;havoc ttusb_dec_get_stb_state_#t~nondet236#1; {50163#false} is VALID [2022-02-20 21:49:33,956 INFO L272 TraceCheckUtils]: 93: Hoare triple {50163#false} call ttusb_dec_get_stb_state_#t~ret237#1 := ttusb_dec_send_command(ttusb_dec_get_stb_state_~dec#1.base, ttusb_dec_get_stb_state_~dec#1.offset, 8, 0, 0, 0, ttusb_dec_get_stb_state_~#c_length~0#1.base, ttusb_dec_get_stb_state_~#c_length~0#1.offset, ttusb_dec_get_stb_state_~#c~0#1.base, ttusb_dec_get_stb_state_~#c~0#1.offset); {50163#false} is VALID [2022-02-20 21:49:33,956 INFO L290 TraceCheckUtils]: 94: Hoare triple {50163#false} ~dec#1.base, ~dec#1.offset := #in~dec#1.base, #in~dec#1.offset;~command#1 := #in~command#1;~param_length#1 := #in~param_length#1;~params#1.base, ~params#1.offset := #in~params#1.base, #in~params#1.offset;~result_length#1.base, ~result_length#1.offset := #in~result_length#1.base, #in~result_length#1.offset;~cmd_result#1.base, ~cmd_result#1.offset := #in~cmd_result#1.base, #in~cmd_result#1.offset;havoc ~result~0#1;call ~#actual_len~0#1.base, ~#actual_len~0#1.offset := #Ultimate.allocOnStack(4);havoc ~i~0#1;havoc ~b~0#1.base, ~b~0#1.offset;havoc ~tmp~11#1.base, ~tmp~11#1.offset;havoc ~__len~0#1;havoc ~__ret~1#1.base, ~__ret~1#1.offset;havoc ~__len___0~0#1;havoc ~__ret___0~0#1.base, ~__ret___0~0#1.offset; {50163#false} is VALID [2022-02-20 21:49:33,956 INFO L290 TraceCheckUtils]: 95: Hoare triple {50163#false} assume !(0 != ~debug~0); {50163#false} is VALID [2022-02-20 21:49:33,956 INFO L272 TraceCheckUtils]: 96: Hoare triple {50163#false} call #t~ret208#1.base, #t~ret208#1.offset := kmalloc(64, 208); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,956 INFO L290 TraceCheckUtils]: 97: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp___2~0#1.base, ~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ~size#1, ~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {50162#true} is VALID [2022-02-20 21:49:33,957 INFO L272 TraceCheckUtils]: 98: Hoare triple {50162#true} call __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset := ldv_malloc(__kmalloc_~size#1); {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:49:33,957 INFO L290 TraceCheckUtils]: 99: Hoare triple {50230#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume -2147483648 <= #t~nondet41#1 && #t~nondet41#1 <= 2147483647; {50162#true} is VALID [2022-02-20 21:49:33,957 INFO L290 TraceCheckUtils]: 100: Hoare triple {50162#true} assume !(0 != #t~nondet41#1);havoc #t~nondet41#1;#res#1.base, #res#1.offset := 0, 0; {50162#true} is VALID [2022-02-20 21:49:33,957 INFO L290 TraceCheckUtils]: 101: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,958 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {50162#true} {50162#true} #2247#return; {50162#true} is VALID [2022-02-20 21:49:33,958 INFO L290 TraceCheckUtils]: 103: Hoare triple {50162#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset;havoc __kmalloc_#t~ret44#1.base, __kmalloc_#t~ret44#1.offset; {50162#true} is VALID [2022-02-20 21:49:33,958 INFO L290 TraceCheckUtils]: 104: Hoare triple {50162#true} #t~ret45#1.base, #t~ret45#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;~tmp___2~0#1.base, ~tmp___2~0#1.offset := #t~ret45#1.base, #t~ret45#1.offset;havoc #t~ret45#1.base, #t~ret45#1.offset;#res#1.base, #res#1.offset := ~tmp___2~0#1.base, ~tmp___2~0#1.offset; {50162#true} is VALID [2022-02-20 21:49:33,958 INFO L290 TraceCheckUtils]: 105: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,958 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {50162#true} {50163#false} #2207#return; {50163#false} is VALID [2022-02-20 21:49:33,958 INFO L290 TraceCheckUtils]: 107: Hoare triple {50163#false} ~tmp~11#1.base, ~tmp~11#1.offset := #t~ret208#1.base, #t~ret208#1.offset;havoc #t~ret208#1.base, #t~ret208#1.offset;~b~0#1.base, ~b~0#1.offset := ~tmp~11#1.base, ~tmp~11#1.offset; {50163#false} is VALID [2022-02-20 21:49:33,958 INFO L290 TraceCheckUtils]: 108: Hoare triple {50163#false} assume !(0 == (~b~0#1.base + ~b~0#1.offset) % 18446744073709551616);assume { :begin_inline_ldv_mutex_lock_interruptible_6 } true;ldv_mutex_lock_interruptible_6_#in~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_6_#in~ldv_func_arg1#1.offset := ~dec#1.base, 2045 + ~dec#1.offset;havoc ldv_mutex_lock_interruptible_6_#res#1;havoc ldv_mutex_lock_interruptible_6_#t~ret813#1, ldv_mutex_lock_interruptible_6_#t~ret814#1, ldv_mutex_lock_interruptible_6_~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_6_~ldv_func_arg1#1.offset, ldv_mutex_lock_interruptible_6_~ldv_func_res~1#1, ldv_mutex_lock_interruptible_6_~tmp~34#1, ldv_mutex_lock_interruptible_6_~tmp___0~15#1;ldv_mutex_lock_interruptible_6_~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_6_~ldv_func_arg1#1.offset := ldv_mutex_lock_interruptible_6_#in~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_6_#in~ldv_func_arg1#1.offset;havoc ldv_mutex_lock_interruptible_6_~ldv_func_res~1#1;havoc ldv_mutex_lock_interruptible_6_~tmp~34#1;havoc ldv_mutex_lock_interruptible_6_~tmp___0~15#1; {50163#false} is VALID [2022-02-20 21:49:33,959 INFO L272 TraceCheckUtils]: 109: Hoare triple {50163#false} call ldv_mutex_lock_interruptible_6_#t~ret813#1 := mutex_lock_interruptible(ldv_mutex_lock_interruptible_6_~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_6_~ldv_func_arg1#1.offset); {50162#true} is VALID [2022-02-20 21:49:33,962 INFO L290 TraceCheckUtils]: 110: Hoare triple {50162#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;assume -2147483648 <= #t~nondet852 && #t~nondet852 <= 2147483647;#res := #t~nondet852;havoc #t~nondet852; {50162#true} is VALID [2022-02-20 21:49:33,963 INFO L290 TraceCheckUtils]: 111: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,963 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {50162#true} {50163#false} #2209#return; {50163#false} is VALID [2022-02-20 21:49:33,964 INFO L290 TraceCheckUtils]: 113: Hoare triple {50163#false} assume -2147483648 <= ldv_mutex_lock_interruptible_6_#t~ret813#1 && ldv_mutex_lock_interruptible_6_#t~ret813#1 <= 2147483647;ldv_mutex_lock_interruptible_6_~tmp~34#1 := ldv_mutex_lock_interruptible_6_#t~ret813#1;havoc ldv_mutex_lock_interruptible_6_#t~ret813#1;ldv_mutex_lock_interruptible_6_~ldv_func_res~1#1 := ldv_mutex_lock_interruptible_6_~tmp~34#1;assume { :begin_inline_ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec } true;ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#in~lock#1.base, ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#in~lock#1.offset := ldv_mutex_lock_interruptible_6_~ldv_func_arg1#1.base, ldv_mutex_lock_interruptible_6_~ldv_func_arg1#1.offset;havoc ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#res#1;havoc ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#t~nondet834#1, ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_~lock#1.base, ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_~lock#1.offset, ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_~nondetermined~9#1;ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_~lock#1.base, ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_~lock#1.offset := ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#in~lock#1.base, ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#in~lock#1.offset;havoc ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_~nondetermined~9#1; {50163#false} is VALID [2022-02-20 21:49:33,967 INFO L290 TraceCheckUtils]: 114: Hoare triple {50163#false} assume 1 == ~ldv_mutex_usb_mutex_of_ttusb_dec~0; {50163#false} is VALID [2022-02-20 21:49:33,968 INFO L290 TraceCheckUtils]: 115: Hoare triple {50163#false} assume -2147483648 <= ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#t~nondet834#1 && ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#t~nondet834#1 <= 2147483647;ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_~nondetermined~9#1 := ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#t~nondet834#1;havoc ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#t~nondet834#1; {50163#false} is VALID [2022-02-20 21:49:33,968 INFO L290 TraceCheckUtils]: 116: Hoare triple {50163#false} assume 0 != ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_~nondetermined~9#1;~ldv_mutex_usb_mutex_of_ttusb_dec~0 := 2;ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#res#1 := 0; {50163#false} is VALID [2022-02-20 21:49:33,968 INFO L290 TraceCheckUtils]: 117: Hoare triple {50163#false} ldv_mutex_lock_interruptible_6_#t~ret814#1 := ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec_#res#1;assume { :end_inline_ldv_mutex_lock_interruptible_usb_mutex_of_ttusb_dec } true;assume -2147483648 <= ldv_mutex_lock_interruptible_6_#t~ret814#1 && ldv_mutex_lock_interruptible_6_#t~ret814#1 <= 2147483647;ldv_mutex_lock_interruptible_6_~tmp___0~15#1 := ldv_mutex_lock_interruptible_6_#t~ret814#1;havoc ldv_mutex_lock_interruptible_6_#t~ret814#1;ldv_mutex_lock_interruptible_6_#res#1 := ldv_mutex_lock_interruptible_6_~tmp___0~15#1; {50163#false} is VALID [2022-02-20 21:49:33,968 INFO L290 TraceCheckUtils]: 118: Hoare triple {50163#false} #t~ret209#1 := ldv_mutex_lock_interruptible_6_#res#1;assume { :end_inline_ldv_mutex_lock_interruptible_6 } true;assume -2147483648 <= #t~ret209#1 && #t~ret209#1 <= 2147483647;~result~0#1 := #t~ret209#1;havoc #t~ret209#1; {50163#false} is VALID [2022-02-20 21:49:33,969 INFO L290 TraceCheckUtils]: 119: Hoare triple {50163#false} assume !(0 != ~result~0#1);call write~int(170, ~b~0#1.base, ~b~0#1.offset, 1);call #t~mem211#1 := read~int(~dec#1.base, 2020 + ~dec#1.offset, 1);call write~int(1 + #t~mem211#1 % 256, ~dec#1.base, 2020 + ~dec#1.offset, 1);havoc #t~mem211#1;call #t~mem212#1 := read~int(~dec#1.base, 2020 + ~dec#1.offset, 1);call write~int(#t~mem212#1, ~b~0#1.base, 1 + ~b~0#1.offset, 1);havoc #t~mem212#1;call write~int(~command#1, ~b~0#1.base, 2 + ~b~0#1.offset, 1);call write~int(~param_length#1, ~b~0#1.base, 3 + ~b~0#1.offset, 1); {50163#false} is VALID [2022-02-20 21:49:33,969 INFO L290 TraceCheckUtils]: 120: Hoare triple {50163#false} assume !(0 != (~params#1.base + ~params#1.offset) % 18446744073709551616); {50163#false} is VALID [2022-02-20 21:49:33,970 INFO L290 TraceCheckUtils]: 121: Hoare triple {50163#false} assume !(0 != ~debug~0); {50163#false} is VALID [2022-02-20 21:49:33,970 INFO L290 TraceCheckUtils]: 122: Hoare triple {50163#false} call #t~mem218#1.base, #t~mem218#1.offset := read~$Pointer$(~dec#1.base, 2012 + ~dec#1.offset, 8);call #t~mem219#1 := read~int(~dec#1.base, 2021 + ~dec#1.offset, 4); {50163#false} is VALID [2022-02-20 21:49:33,970 INFO L272 TraceCheckUtils]: 123: Hoare triple {50163#false} call #t~ret220#1 := usb_bulk_msg(#t~mem218#1.base, #t~mem218#1.offset, #t~mem219#1, ~b~0#1.base, ~b~0#1.offset, 64, ~#actual_len~0#1.base, ~#actual_len~0#1.offset, 1000); {50162#true} is VALID [2022-02-20 21:49:33,970 INFO L290 TraceCheckUtils]: 124: Hoare triple {50162#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset;~arg3 := #in~arg3;~arg4.base, ~arg4.offset := #in~arg4.base, #in~arg4.offset;~arg5 := #in~arg5;assume -2147483648 <= #t~nondet861 && #t~nondet861 <= 2147483647;#res := #t~nondet861;havoc #t~nondet861; {50162#true} is VALID [2022-02-20 21:49:33,970 INFO L290 TraceCheckUtils]: 125: Hoare triple {50162#true} assume true; {50162#true} is VALID [2022-02-20 21:49:33,972 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {50162#true} {50163#false} #2217#return; {50163#false} is VALID [2022-02-20 21:49:33,973 INFO L290 TraceCheckUtils]: 127: Hoare triple {50163#false} assume -2147483648 <= #t~ret220#1 && #t~ret220#1 <= 2147483647;~result~0#1 := #t~ret220#1;havoc #t~mem218#1.base, #t~mem218#1.offset;havoc #t~mem219#1;havoc #t~ret220#1; {50163#false} is VALID [2022-02-20 21:49:33,973 INFO L290 TraceCheckUtils]: 128: Hoare triple {50163#false} assume 0 != ~result~0#1;havoc #t~nondet221#1;assume { :begin_inline_ldv_mutex_unlock_7 } true;ldv_mutex_unlock_7_#in~ldv_func_arg1#1.base, ldv_mutex_unlock_7_#in~ldv_func_arg1#1.offset := ~dec#1.base, 2045 + ~dec#1.offset;havoc ldv_mutex_unlock_7_~ldv_func_arg1#1.base, ldv_mutex_unlock_7_~ldv_func_arg1#1.offset;ldv_mutex_unlock_7_~ldv_func_arg1#1.base, ldv_mutex_unlock_7_~ldv_func_arg1#1.offset := ldv_mutex_unlock_7_#in~ldv_func_arg1#1.base, ldv_mutex_unlock_7_#in~ldv_func_arg1#1.offset; {50163#false} is VALID [2022-02-20 21:49:33,973 INFO L272 TraceCheckUtils]: 129: Hoare triple {50163#false} call ldv_mutex_unlock_usb_mutex_of_ttusb_dec(ldv_mutex_unlock_7_~ldv_func_arg1#1.base, ldv_mutex_unlock_7_~ldv_func_arg1#1.offset); {50163#false} is VALID [2022-02-20 21:49:33,973 INFO L290 TraceCheckUtils]: 130: Hoare triple {50163#false} ~lock.base, ~lock.offset := #in~lock.base, #in~lock.offset; {50163#false} is VALID [2022-02-20 21:49:33,973 INFO L290 TraceCheckUtils]: 131: Hoare triple {50163#false} assume !(2 == ~ldv_mutex_usb_mutex_of_ttusb_dec~0); {50163#false} is VALID [2022-02-20 21:49:33,973 INFO L272 TraceCheckUtils]: 132: Hoare triple {50163#false} call ldv_error(); {50163#false} is VALID [2022-02-20 21:49:33,973 INFO L290 TraceCheckUtils]: 133: Hoare triple {50163#false} assume !false; {50163#false} is VALID [2022-02-20 21:49:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-20 21:49:33,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:49:33,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660168260] [2022-02-20 21:49:33,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660168260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:49:33,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:49:33,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:49:33,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605222816] [2022-02-20 21:49:33,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:49:33,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2022-02-20 21:49:33,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:49:33,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-02-20 21:49:34,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:49:34,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:49:34,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:49:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:49:34,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:49:34,056 INFO L87 Difference]: Start difference. First operand 3715 states and 5244 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-02-20 21:49:38,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 21:49:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:49:45,488 INFO L93 Difference]: Finished difference Result 7559 states and 10873 transitions. [2022-02-20 21:49:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:49:45,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2022-02-20 21:49:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:49:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-02-20 21:49:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2739 transitions. [2022-02-20 21:49:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-02-20 21:49:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2739 transitions. [2022-02-20 21:49:45,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 2739 transitions.