/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:04:18,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:04:18,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:04:18,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:04:18,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:04:18,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:04:18,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:04:18,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:04:18,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:04:18,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:04:18,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:04:18,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:04:18,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:04:18,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:04:18,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:04:18,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:04:18,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:04:18,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:04:18,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:04:18,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:04:18,594 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:04:18,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:04:18,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:04:18,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:04:18,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:04:18,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:04:18,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:04:18,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:04:18,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:04:18,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:04:18,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:04:18,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:04:18,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:04:18,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:04:18,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:04:18,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:04:18,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:04:18,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:04:18,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:04:18,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:04:18,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:04:18,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:04:18,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 18:04:18,619 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:04:18,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:04:18,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:04:18,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:04:18,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:04:18,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:04:18,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:04:18,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:04:18,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:04:18,621 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:04:18,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:04:18,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:04:18,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:04:18,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:04:18,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:04:18,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:04:18,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:04:18,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:04:18,621 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:04:18,621 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:04:18,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:04:18,622 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:04:18,622 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 18:04:18,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:04:18,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:04:18,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:04:18,788 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:04:18,789 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:04:18,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2022-04-15 18:04:18,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9122dd2b/b47676677a7f43c79ed56da32e57ae0b/FLAG074adfddd [2022-04-15 18:04:19,457 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:04:19,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2022-04-15 18:04:19,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9122dd2b/b47676677a7f43c79ed56da32e57ae0b/FLAG074adfddd [2022-04-15 18:04:19,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9122dd2b/b47676677a7f43c79ed56da32e57ae0b [2022-04-15 18:04:19,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:04:19,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:04:19,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:04:19,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:04:19,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:04:19,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:04:19" (1/1) ... [2022-04-15 18:04:19,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c73d460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:19, skipping insertion in model container [2022-04-15 18:04:19,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:04:19" (1/1) ... [2022-04-15 18:04:19,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:04:19,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:04:20,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c[90162,90175] [2022-04-15 18:04:20,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:04:20,999 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:04:21,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c[90162,90175] [2022-04-15 18:04:21,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:04:21,344 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:04:21,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:21 WrapperNode [2022-04-15 18:04:21,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:04:21,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:04:21,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:04:21,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:04:21,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:21" (1/1) ... [2022-04-15 18:04:21,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:21" (1/1) ... [2022-04-15 18:04:21,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:21" (1/1) ... [2022-04-15 18:04:21,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:21" (1/1) ... [2022-04-15 18:04:21,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:21" (1/1) ... [2022-04-15 18:04:21,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:21" (1/1) ... [2022-04-15 18:04:21,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:21" (1/1) ... [2022-04-15 18:04:21,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:04:21,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:04:21,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:04:21,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:04:21,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:21" (1/1) ... [2022-04-15 18:04:21,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:04:21,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:04:21,641 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-04-15 18:04:21,657 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-04-15 18:04:21,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:04:21,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:04:21,670 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:04:21,670 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2022-04-15 18:04:21,670 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-04-15 18:04:21,671 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-04-15 18:04:21,671 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-04-15 18:04:21,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-04-15 18:04:21,671 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-15 18:04:21,671 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-15 18:04:21,671 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-04-15 18:04:21,671 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2022-04-15 18:04:21,671 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-04-15 18:04:21,671 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-04-15 18:04:21,672 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-04-15 18:04:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-04-15 18:04:21,675 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-04-15 18:04:21,676 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-04-15 18:04:21,677 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-04-15 18:04:21,677 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-04-15 18:04:21,677 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-04-15 18:04:21,677 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-04-15 18:04:21,677 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-15 18:04:21,677 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-15 18:04:21,677 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-04-15 18:04:21,677 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-04-15 18:04:21,677 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-04-15 18:04:21,677 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-04-15 18:04:21,677 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-04-15 18:04:21,678 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-04-15 18:04:21,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-15 18:04:21,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-04-15 18:04:21,678 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-15 18:04:21,678 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-04-15 18:04:21,679 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-15 18:04:21,679 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-04-15 18:04:21,679 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-04-15 18:04:21,679 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-04-15 18:04:21,679 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-04-15 18:04:21,679 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-04-15 18:04:21,680 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-04-15 18:04:21,680 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-04-15 18:04:21,680 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-04-15 18:04:21,680 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-04-15 18:04:21,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-15 18:04:21,680 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-04-15 18:04:21,680 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 18:04:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:04:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:04:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:04:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:04:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 18:04:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:04:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 18:04:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 18:04:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 18:04:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 18:04:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-04-15 18:04:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-04-15 18:04:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-04-15 18:04:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2022-04-15 18:04:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-04-15 18:04:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-04-15 18:04:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-15 18:04:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-04-15 18:04:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-04-15 18:04:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-04-15 18:04:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-04-15 18:04:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-04-15 18:04:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-04-15 18:04:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-04-15 18:04:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-04-15 18:04:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-04-15 18:04:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-04-15 18:04:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-04-15 18:04:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-04-15 18:04:21,685 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-04-15 18:04:21,687 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-04-15 18:04:21,687 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-15 18:04:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2022-04-15 18:04:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-04-15 18:04:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 18:04:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 18:04:22,139 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:04:22,141 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:04:22,156 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:22,185 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:22,185 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:22,186 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:22,193 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:22,193 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:22,199 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:22,205 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:22,205 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:22,205 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:22,238 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:22,239 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:22,240 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:27,318 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-15 18:04:27,318 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-15 18:04:27,336 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:27,343 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:27,343 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:27,344 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:27,352 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:27,353 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:27,353 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:27,365 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:27,365 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:27,365 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:27,380 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:27,381 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:27,384 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:31,533 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 18:04:31,533 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 18:04:31,587 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:31,702 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2022-04-15 18:04:31,703 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2022-04-15 18:04:31,708 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:31,713 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:31,713 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:31,713 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:31,734 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-15 18:04:31,734 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-15 18:04:31,735 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:31,739 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:31,739 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:31,739 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:31,745 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:31,745 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:31,758 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:31,763 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:31,763 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:31,763 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:31,767 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:31,767 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:32,112 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:35,152 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 18:04:35,152 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 18:04:35,159 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:41,584 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-04-15 18:04:41,584 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-04-15 18:04:41,593 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:41,619 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-15 18:04:41,620 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-15 18:04:41,636 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:41,641 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:41,641 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:41,686 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:41,768 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume false; [2022-04-15 18:04:41,769 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !false; [2022-04-15 18:04:41,892 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:41,897 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:41,897 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:41,959 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:41,963 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:41,963 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:41,964 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:47,198 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-15 18:04:47,198 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-15 18:04:47,202 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:47,222 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-04-15 18:04:47,222 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-04-15 18:04:47,229 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:47,239 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-15 18:04:47,239 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-15 18:04:47,247 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:47,251 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:47,251 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:47,641 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:47,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-04-15 18:04:47,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-04-15 18:04:47,684 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: #res := 0; [2022-04-15 18:04:47,684 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:47,689 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 18:04:47,689 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 18:04:47,750 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 18:04:51,034 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 18:04:51,035 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 18:04:51,091 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:04:51,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:04:51,104 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-04-15 18:04:51,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:04:51 BoogieIcfgContainer [2022-04-15 18:04:51,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:04:51,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:04:51,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:04:51,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:04:51,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:04:19" (1/3) ... [2022-04-15 18:04:51,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732d8291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:04:51, skipping insertion in model container [2022-04-15 18:04:51,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:04:21" (2/3) ... [2022-04-15 18:04:51,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732d8291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:04:51, skipping insertion in model container [2022-04-15 18:04:51,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:04:51" (3/3) ... [2022-04-15 18:04:51,114 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-1.c [2022-04-15 18:04:51,117 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:04:51,117 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:04:51,161 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:04:51,166 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 18:04:51,166 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:04:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 1261 states, 960 states have (on average 1.5177083333333334) internal successors, (1457), 990 states have internal predecessors, (1457), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) [2022-04-15 18:04:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 18:04:51,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:04:51,223 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:04:51,224 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:04:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:04:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1165007651, now seen corresponding path program 1 times [2022-04-15 18:04:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:51,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715189660] [2022-04-15 18:04:51,242 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:04:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1165007651, now seen corresponding path program 2 times [2022-04-15 18:04:51,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:04:51,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174483618] [2022-04-15 18:04:51,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:04:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:04:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:51,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:04:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:51,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {1273#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1264#true} is VALID [2022-04-15 18:04:51,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-15 18:04:51,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#true} {1264#true} #4308#return; {1264#true} is VALID [2022-04-15 18:04:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:04:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:04:51,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:04:51,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume true; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:04:51,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1272#(= ~s~0 ~UNLOADED~0)} {1264#true} #4174#return; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:04:51,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {1264#true} call ULTIMATE.init(); {1273#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:04:51,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {1273#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1264#true} is VALID [2022-04-15 18:04:51,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-15 18:04:51,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1264#true} {1264#true} #4308#return; {1264#true} is VALID [2022-04-15 18:04:51,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {1264#true} call #t~ret1021 := main(); {1264#true} is VALID [2022-04-15 18:04:51,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {1264#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {1264#true} is VALID [2022-04-15 18:04:51,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {1264#true} assume !(~a~0 % 18446744073709551616 < 93); {1264#true} is VALID [2022-04-15 18:04:51,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {1264#true} ~a~0 := 0; {1264#true} is VALID [2022-04-15 18:04:51,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#true} assume !(~a~0 % 18446744073709551616 < 68); {1264#true} is VALID [2022-04-15 18:04:51,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {1264#true} ~a~0 := 0; {1264#true} is VALID [2022-04-15 18:04:51,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#true} assume !(~a~0 % 18446744073709551616 < 904); {1264#true} is VALID [2022-04-15 18:04:51,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {1264#true} is VALID [2022-04-15 18:04:51,750 INFO L272 TraceCheckUtils]: 12: Hoare triple {1264#true} call _BLAST_init(); {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:04:51,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {1274#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:04:51,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume true; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:04:51,751 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1272#(= ~s~0 ~UNLOADED~0)} {1264#true} #4174#return; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:04:51,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(~status~15 >= 0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:04:51,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:04:51,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 18:04:51,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {1265#false} is VALID [2022-04-15 18:04:51,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {1265#false} assume !(-1 == ~status~15); {1265#false} is VALID [2022-04-15 18:04:51,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {1265#false} assume !(~s~0 != ~SKIP2~0); {1265#false} is VALID [2022-04-15 18:04:51,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {1265#false} assume !(1 == ~pended~0); {1265#false} is VALID [2022-04-15 18:04:51,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {1265#false} assume ~s~0 == ~DC~0; {1265#false} is VALID [2022-04-15 18:04:51,753 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#false} call errorFn(); {1265#false} is VALID [2022-04-15 18:04:51,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {1265#false} assume !false; {1265#false} is VALID [2022-04-15 18:04:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:04:51,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:04:51,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174483618] [2022-04-15 18:04:51,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174483618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:51,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:51,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:04:51,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:04:51,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715189660] [2022-04-15 18:04:51,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715189660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:04:51,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:04:51,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 18:04:51,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424975861] [2022-04-15 18:04:51,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:04:51,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-04-15 18:04:51,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:04:51,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 18:04:51,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:04:51,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 18:04:51,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:04:51,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 18:04:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 18:04:51,826 INFO L87 Difference]: Start difference. First operand has 1261 states, 960 states have (on average 1.5177083333333334) internal successors, (1457), 990 states have internal predecessors, (1457), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 18:05:04,073 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-04-15 18:05:08,747 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:14,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:22,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:24,556 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-04-15 18:05:29,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:31,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:33,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:41,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:43,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:45,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:47,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:05:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:47,827 INFO L93 Difference]: Finished difference Result 1537 states and 2438 transitions. [2022-04-15 18:05:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 18:05:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-04-15 18:05:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:05:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 18:05:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2438 transitions. [2022-04-15 18:05:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 18:05:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2438 transitions. [2022-04-15 18:05:47,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2438 transitions. [2022-04-15 18:05:50,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2438 edges. 2438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:05:50,644 INFO L225 Difference]: With dead ends: 1537 [2022-04-15 18:05:50,644 INFO L226 Difference]: Without dead ends: 842 [2022-04-15 18:05:50,650 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 18:05:50,652 INFO L913 BasicCegarLoop]: 930 mSDtfsCounter, 484 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 187 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:05:50,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 1302 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1970 Invalid, 8 Unknown, 0 Unchecked, 30.3s Time] [2022-04-15 18:05:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-04-15 18:05:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 679. [2022-04-15 18:05:50,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:05:50,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 18:05:50,777 INFO L74 IsIncluded]: Start isIncluded. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 18:05:50,778 INFO L87 Difference]: Start difference. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 18:05:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:50,822 INFO L93 Difference]: Finished difference Result 842 states and 1272 transitions. [2022-04-15 18:05:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1272 transitions. [2022-04-15 18:05:50,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:50,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:50,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 842 states. [2022-04-15 18:05:50,836 INFO L87 Difference]: Start difference. First operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 842 states. [2022-04-15 18:05:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:05:50,871 INFO L93 Difference]: Finished difference Result 842 states and 1272 transitions. [2022-04-15 18:05:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1272 transitions. [2022-04-15 18:05:50,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:05:50,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:05:50,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:05:50,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:05:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-15 18:05:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 991 transitions. [2022-04-15 18:05:50,906 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 991 transitions. Word has length 26 [2022-04-15 18:05:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:05:50,907 INFO L478 AbstractCegarLoop]: Abstraction has 679 states and 991 transitions. [2022-04-15 18:05:50,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 18:05:50,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 679 states and 991 transitions. [2022-04-15 18:05:51,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 991 edges. 991 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:05:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 991 transitions. [2022-04-15 18:05:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 18:05:51,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:05:51,995 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:05:51,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:05:51,995 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:05:51,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:05:51,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1118603387, now seen corresponding path program 1 times [2022-04-15 18:05:51,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:51,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [315808127] [2022-04-15 18:05:51,996 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:05:51,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1118603387, now seen corresponding path program 2 times [2022-04-15 18:05:51,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:05:51,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465747779] [2022-04-15 18:05:51,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:05:51,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:05:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:52,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:05:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:52,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {7410#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7398#true} is VALID [2022-04-15 18:05:52,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-15 18:05:52,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7398#true} {7398#true} #4308#return; {7398#true} is VALID [2022-04-15 18:05:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:05:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:52,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7398#true} is VALID [2022-04-15 18:05:52,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-15 18:05:52,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7398#true} {7398#true} #4174#return; {7398#true} is VALID [2022-04-15 18:05:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 18:05:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:05:52,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {7412#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {7409#(= ~s~0 ~NP~0)} assume true; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7409#(= ~s~0 ~NP~0)} {7398#true} #4176#return; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {7398#true} call ULTIMATE.init(); {7410#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:05:52,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7398#true} is VALID [2022-04-15 18:05:52,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-15 18:05:52,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7398#true} {7398#true} #4308#return; {7398#true} is VALID [2022-04-15 18:05:52,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {7398#true} call #t~ret1021 := main(); {7398#true} is VALID [2022-04-15 18:05:52,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {7398#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {7398#true} is VALID [2022-04-15 18:05:52,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {7398#true} assume !(~a~0 % 18446744073709551616 < 93); {7398#true} is VALID [2022-04-15 18:05:52,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#true} ~a~0 := 0; {7398#true} is VALID [2022-04-15 18:05:52,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {7398#true} assume !(~a~0 % 18446744073709551616 < 68); {7398#true} is VALID [2022-04-15 18:05:52,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {7398#true} ~a~0 := 0; {7398#true} is VALID [2022-04-15 18:05:52,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {7398#true} assume !(~a~0 % 18446744073709551616 < 904); {7398#true} is VALID [2022-04-15 18:05:52,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {7398#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {7398#true} is VALID [2022-04-15 18:05:52,250 INFO L272 TraceCheckUtils]: 12: Hoare triple {7398#true} call _BLAST_init(); {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:05:52,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {7411#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7398#true} is VALID [2022-04-15 18:05:52,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-15 18:05:52,251 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7398#true} {7398#true} #4174#return; {7398#true} is VALID [2022-04-15 18:05:52,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {7398#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {7398#true} is VALID [2022-04-15 18:05:52,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {7398#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {7398#true} is VALID [2022-04-15 18:05:52,251 INFO L272 TraceCheckUtils]: 18: Hoare triple {7398#true} call stub_driver_init(); {7412#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:05:52,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {7412#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {7409#(= ~s~0 ~NP~0)} assume true; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,252 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7409#(= ~s~0 ~NP~0)} {7398#true} #4176#return; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !!(~status~15 >= 0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(2 == ~__BLAST_NONDET___0~0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(3 == ~__BLAST_NONDET___0~0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {7409#(= ~s~0 ~NP~0)} assume 4 == ~__BLAST_NONDET___0~0; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,254 INFO L272 TraceCheckUtils]: 26: Hoare triple {7409#(= ~s~0 ~NP~0)} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {7409#(= ~s~0 ~NP~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:05:52,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {7399#false} is VALID [2022-04-15 18:05:52,255 INFO L272 TraceCheckUtils]: 29: Hoare triple {7399#false} call errorFn(); {7399#false} is VALID [2022-04-15 18:05:52,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {7399#false} assume !false; {7399#false} is VALID [2022-04-15 18:05:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:05:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:05:52,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465747779] [2022-04-15 18:05:52,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465747779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:52,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:52,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:05:52,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:05:52,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [315808127] [2022-04-15 18:05:52,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [315808127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:05:52,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:05:52,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:05:52,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590603106] [2022-04-15 18:05:52,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:05:52,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-04-15 18:05:52,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:05:52,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:05:52,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:05:52,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 18:05:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:05:52,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 18:05:52,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:05:52,285 INFO L87 Difference]: Start difference. First operand 679 states and 991 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:06:07,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:06:21,268 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-04-15 18:06:25,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:06:29,427 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:06:31,434 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-04-15 18:06:33,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:06:37,127 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-04-15 18:06:38,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:06:41,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:06:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:42,245 INFO L93 Difference]: Finished difference Result 1457 states and 2151 transitions. [2022-04-15 18:06:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 18:06:42,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-04-15 18:06:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:06:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:06:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2022-04-15 18:06:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:06:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2022-04-15 18:06:42,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 2151 transitions. [2022-04-15 18:06:44,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2151 edges. 2151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:06:44,736 INFO L225 Difference]: With dead ends: 1457 [2022-04-15 18:06:44,736 INFO L226 Difference]: Without dead ends: 1180 [2022-04-15 18:06:44,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:06:44,738 INFO L913 BasicCegarLoop]: 1222 mSDtfsCounter, 1461 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 2664 mSolverCounterSat, 356 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 2664 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:06:44,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 1957 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 2664 Invalid, 6 Unknown, 0 Unchecked, 24.3s Time] [2022-04-15 18:06:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-04-15 18:06:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 991. [2022-04-15 18:06:44,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:06:44,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 18:06:44,807 INFO L74 IsIncluded]: Start isIncluded. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 18:06:44,808 INFO L87 Difference]: Start difference. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 18:06:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:44,857 INFO L93 Difference]: Finished difference Result 1180 states and 1750 transitions. [2022-04-15 18:06:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1750 transitions. [2022-04-15 18:06:44,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:44,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:44,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1180 states. [2022-04-15 18:06:44,864 INFO L87 Difference]: Start difference. First operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1180 states. [2022-04-15 18:06:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:06:44,913 INFO L93 Difference]: Finished difference Result 1180 states and 1750 transitions. [2022-04-15 18:06:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1750 transitions. [2022-04-15 18:06:44,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:06:44,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:06:44,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:06:44,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:06:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-15 18:06:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1448 transitions. [2022-04-15 18:06:44,983 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1448 transitions. Word has length 31 [2022-04-15 18:06:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:06:44,983 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1448 transitions. [2022-04-15 18:06:44,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:06:44,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1448 transitions. [2022-04-15 18:06:46,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1448 edges. 1448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:06:46,737 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1448 transitions. [2022-04-15 18:06:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 18:06:46,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:06:46,738 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:06:46,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:06:46,738 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:06:46,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:06:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash 425780201, now seen corresponding path program 1 times [2022-04-15 18:06:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:06:46,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1196966753] [2022-04-15 18:06:46,739 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:06:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash 425780201, now seen corresponding path program 2 times [2022-04-15 18:06:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:06:46,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408971189] [2022-04-15 18:06:46,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:06:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:06:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:06:46,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:06:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:06:46,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {14689#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14677#true} is VALID [2022-04-15 18:06:46,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 18:06:46,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4308#return; {14677#true} is VALID [2022-04-15 18:06:46,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:06:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:06:46,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14677#true} is VALID [2022-04-15 18:06:46,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 18:06:46,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4174#return; {14677#true} is VALID [2022-04-15 18:06:46,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 18:06:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:06:46,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {14691#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {14677#true} is VALID [2022-04-15 18:06:46,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 18:06:46,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4176#return; {14677#true} is VALID [2022-04-15 18:06:46,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {14677#true} call ULTIMATE.init(); {14689#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:06:46,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {14689#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14677#true} is VALID [2022-04-15 18:06:46,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 18:06:46,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14677#true} {14677#true} #4308#return; {14677#true} is VALID [2022-04-15 18:06:46,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {14677#true} call #t~ret1021 := main(); {14677#true} is VALID [2022-04-15 18:06:46,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {14677#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {14677#true} is VALID [2022-04-15 18:06:46,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {14677#true} assume !(~a~0 % 18446744073709551616 < 93); {14677#true} is VALID [2022-04-15 18:06:46,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {14677#true} ~a~0 := 0; {14677#true} is VALID [2022-04-15 18:06:46,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {14677#true} assume !(~a~0 % 18446744073709551616 < 68); {14677#true} is VALID [2022-04-15 18:06:46,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {14677#true} ~a~0 := 0; {14677#true} is VALID [2022-04-15 18:06:46,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {14677#true} assume !(~a~0 % 18446744073709551616 < 904); {14677#true} is VALID [2022-04-15 18:06:46,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {14677#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {14677#true} is VALID [2022-04-15 18:06:46,982 INFO L272 TraceCheckUtils]: 12: Hoare triple {14677#true} call _BLAST_init(); {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:06:46,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {14690#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14677#true} is VALID [2022-04-15 18:06:46,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 18:06:46,982 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14677#true} {14677#true} #4174#return; {14677#true} is VALID [2022-04-15 18:06:46,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {14677#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {14677#true} is VALID [2022-04-15 18:06:46,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {14677#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {14677#true} is VALID [2022-04-15 18:06:46,983 INFO L272 TraceCheckUtils]: 18: Hoare triple {14677#true} call stub_driver_init(); {14691#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:06:46,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {14691#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {14677#true} is VALID [2022-04-15 18:06:46,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 18:06:46,985 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14677#true} {14677#true} #4176#return; {14677#true} is VALID [2022-04-15 18:06:46,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {14677#true} assume !!(~status~15 >= 0); {14677#true} is VALID [2022-04-15 18:06:46,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {14677#true} assume !(2 == ~__BLAST_NONDET___0~0); {14677#true} is VALID [2022-04-15 18:06:46,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {14677#true} assume 3 == ~__BLAST_NONDET___0~0; {14677#true} is VALID [2022-04-15 18:06:46,986 INFO L272 TraceCheckUtils]: 25: Hoare triple {14677#true} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {14677#true} is VALID [2022-04-15 18:06:46,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {14677#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14677#true} is VALID [2022-04-15 18:06:46,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {14677#true} assume !(0 == #t~mem130 % 256);havoc #t~mem130;call #t~mem131 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14677#true} is VALID [2022-04-15 18:06:46,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {14677#true} assume 22 == #t~mem131 % 256;havoc #t~mem131; {14677#true} is VALID [2022-04-15 18:06:46,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {14677#true} call #t~mem133 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {14677#true} is VALID [2022-04-15 18:06:46,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {14677#true} assume !(1 != #t~mem133);havoc #t~mem133;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem135.base, #t~mem135.offset;havoc #t~mem135.base, #t~mem135.offset; {14677#true} is VALID [2022-04-15 18:06:46,990 INFO L272 TraceCheckUtils]: 31: Hoare triple {14677#true} call #t~ret136 := KeWaitForSingleObject(~deviceExtension~1.base, 32 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {14677#true} is VALID [2022-04-15 18:06:46,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {14677#true} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet1006 && #t~nondet1006 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet1006;havoc #t~nondet1006; {14677#true} is VALID [2022-04-15 18:06:47,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {14677#true} assume !(~s~0 == ~MPR3~0); {14688#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:06:47,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {14688#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {14688#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:06:47,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {14688#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {14678#false} is VALID [2022-04-15 18:06:47,001 INFO L272 TraceCheckUtils]: 36: Hoare triple {14678#false} call errorFn(); {14678#false} is VALID [2022-04-15 18:06:47,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {14678#false} assume !false; {14678#false} is VALID [2022-04-15 18:06:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:06:47,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:06:47,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408971189] [2022-04-15 18:06:47,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408971189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:06:47,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:06:47,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:06:47,001 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:06:47,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1196966753] [2022-04-15 18:06:47,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1196966753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:06:47,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:06:47,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:06:47,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149213571] [2022-04-15 18:06:47,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:06:47,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-04-15 18:06:47,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:06:47,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:06:47,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:06:47,030 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 18:06:47,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:06:47,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 18:06:47,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:06:47,033 INFO L87 Difference]: Start difference. First operand 991 states and 1448 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:07:05,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:13,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:15,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:23,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:26,190 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:33,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:35,544 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-04-15 18:07:39,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:44,307 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-04-15 18:07:50,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:07:55,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:00,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:02,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:07,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:13,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:18,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:20,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:08:21,617 INFO L93 Difference]: Finished difference Result 2293 states and 3447 transitions. [2022-04-15 18:08:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 18:08:21,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-04-15 18:08:21,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:08:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:08:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2367 transitions. [2022-04-15 18:08:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:08:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2367 transitions. [2022-04-15 18:08:21,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2367 transitions. [2022-04-15 18:08:24,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2367 edges. 2367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:08:25,338 INFO L225 Difference]: With dead ends: 2293 [2022-04-15 18:08:25,338 INFO L226 Difference]: Without dead ends: 1837 [2022-04-15 18:08:25,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:08:25,356 INFO L913 BasicCegarLoop]: 1375 mSDtfsCounter, 1581 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 517 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.5s IncrementalHoareTripleChecker+Time [2022-04-15 18:08:25,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1633 Valid, 2171 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2327 Invalid, 13 Unknown, 0 Unchecked, 42.5s Time] [2022-04-15 18:08:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2022-04-15 18:08:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1172. [2022-04-15 18:08:25,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:08:25,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 18:08:25,544 INFO L74 IsIncluded]: Start isIncluded. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 18:08:25,546 INFO L87 Difference]: Start difference. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 18:08:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:08:25,754 INFO L93 Difference]: Finished difference Result 1837 states and 2756 transitions. [2022-04-15 18:08:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2756 transitions. [2022-04-15 18:08:25,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:08:25,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:08:25,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1837 states. [2022-04-15 18:08:25,796 INFO L87 Difference]: Start difference. First operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1837 states. [2022-04-15 18:08:26,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:08:26,015 INFO L93 Difference]: Finished difference Result 1837 states and 2756 transitions. [2022-04-15 18:08:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2756 transitions. [2022-04-15 18:08:26,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:08:26,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:08:26,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:08:26,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:08:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-15 18:08:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1733 transitions. [2022-04-15 18:08:26,194 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1733 transitions. Word has length 38 [2022-04-15 18:08:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:08:26,196 INFO L478 AbstractCegarLoop]: Abstraction has 1172 states and 1733 transitions. [2022-04-15 18:08:26,196 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:08:26,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1172 states and 1733 transitions. [2022-04-15 18:08:28,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1733 edges. 1733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:08:28,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1733 transitions. [2022-04-15 18:08:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 18:08:28,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:08:28,793 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:08:28,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:08:28,794 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:08:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:08:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash 76033968, now seen corresponding path program 1 times [2022-04-15 18:08:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:08:28,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [330183724] [2022-04-15 18:08:28,794 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:08:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash 76033968, now seen corresponding path program 2 times [2022-04-15 18:08:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:08:28,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737912462] [2022-04-15 18:08:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:08:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:08:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:08:29,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:08:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:08:29,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {25316#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {25303#true} is VALID [2022-04-15 18:08:29,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {25303#true} assume true; {25303#true} is VALID [2022-04-15 18:08:29,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25303#true} {25303#true} #4308#return; {25303#true} is VALID [2022-04-15 18:08:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:08:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:08:29,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:08:29,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume true; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:08:29,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25311#(not (= ~MPR3~0 ~NP~0))} {25303#true} #4174#return; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:08:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 18:08:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:08:29,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {25318#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:08:29,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {25319#(= ~s~0 ~NP~0)} assume true; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:08:29,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25319#(= ~s~0 ~NP~0)} {25311#(not (= ~MPR3~0 ~NP~0))} #4176#return; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {25303#true} call ULTIMATE.init(); {25316#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:08:29,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {25316#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {25303#true} is VALID [2022-04-15 18:08:29,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {25303#true} assume true; {25303#true} is VALID [2022-04-15 18:08:29,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25303#true} {25303#true} #4308#return; {25303#true} is VALID [2022-04-15 18:08:29,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {25303#true} call #t~ret1021 := main(); {25303#true} is VALID [2022-04-15 18:08:29,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {25303#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {25303#true} is VALID [2022-04-15 18:08:29,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {25303#true} assume !(~a~0 % 18446744073709551616 < 93); {25303#true} is VALID [2022-04-15 18:08:29,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {25303#true} ~a~0 := 0; {25303#true} is VALID [2022-04-15 18:08:29,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {25303#true} assume !(~a~0 % 18446744073709551616 < 68); {25303#true} is VALID [2022-04-15 18:08:29,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {25303#true} ~a~0 := 0; {25303#true} is VALID [2022-04-15 18:08:29,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {25303#true} assume !(~a~0 % 18446744073709551616 < 904); {25303#true} is VALID [2022-04-15 18:08:29,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {25303#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {25303#true} is VALID [2022-04-15 18:08:29,263 INFO L272 TraceCheckUtils]: 12: Hoare triple {25303#true} call _BLAST_init(); {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:08:29,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {25317#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:08:29,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume true; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:08:29,265 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {25311#(not (= ~MPR3~0 ~NP~0))} {25303#true} #4174#return; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:08:29,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:08:29,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 18:08:29,266 INFO L272 TraceCheckUtils]: 18: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} call stub_driver_init(); {25318#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:08:29,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {25318#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:08:29,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {25319#(= ~s~0 ~NP~0)} assume true; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-15 18:08:29,267 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25319#(= ~s~0 ~NP~0)} {25311#(not (= ~MPR3~0 ~NP~0))} #4176#return; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !!(~status~15 >= 0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(2 == ~__BLAST_NONDET___0~0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume 3 == ~__BLAST_NONDET___0~0; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,268 INFO L272 TraceCheckUtils]: 25: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(0 == #t~mem130 % 256);havoc #t~mem130;call #t~mem131 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume 22 == #t~mem131 % 256;havoc #t~mem131; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~mem133 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(1 != #t~mem133);havoc #t~mem133;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem135.base, #t~mem135.offset;havoc #t~mem135.base, #t~mem135.offset; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,271 INFO L272 TraceCheckUtils]: 31: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~ret136 := KeWaitForSingleObject(~deviceExtension~1.base, 32 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet1006 && #t~nondet1006 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet1006;havoc #t~nondet1006; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 18:08:29,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {25304#false} is VALID [2022-04-15 18:08:29,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {25304#false} assume !(1 == ~setEventCalled~0); {25304#false} is VALID [2022-04-15 18:08:29,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {25304#false} assume !(1 == ~customIrp~0); {25304#false} is VALID [2022-04-15 18:08:29,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {25304#false} assume ~s~0 == ~MPR3~0; {25304#false} is VALID [2022-04-15 18:08:29,272 INFO L272 TraceCheckUtils]: 37: Hoare triple {25304#false} call errorFn(); {25304#false} is VALID [2022-04-15 18:08:29,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {25304#false} assume !false; {25304#false} is VALID [2022-04-15 18:08:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:08:29,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:08:29,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737912462] [2022-04-15 18:08:29,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737912462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:08:29,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:08:29,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 18:08:29,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:08:29,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [330183724] [2022-04-15 18:08:29,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [330183724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:08:29,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:08:29,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 18:08:29,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871111618] [2022-04-15 18:08:29,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:08:29,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-04-15 18:08:29,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:08:29,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 18:08:29,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:08:29,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 18:08:29,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:08:29,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 18:08:29,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:08:29,340 INFO L87 Difference]: Start difference. First operand 1172 states and 1733 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 18:08:55,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:08:57,357 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:02,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:09,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:12,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:16,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:19,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:26,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:28,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:30,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:09:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:09:34,116 INFO L93 Difference]: Finished difference Result 2221 states and 3345 transitions. [2022-04-15 18:09:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 18:09:34,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-04-15 18:09:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:09:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 18:09:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2779 transitions. [2022-04-15 18:09:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 18:09:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2779 transitions. [2022-04-15 18:09:34,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 2779 transitions. [2022-04-15 18:09:37,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2779 edges. 2779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:09:37,404 INFO L225 Difference]: With dead ends: 2221 [2022-04-15 18:09:37,404 INFO L226 Difference]: Without dead ends: 1514 [2022-04-15 18:09:37,406 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-04-15 18:09:37,407 INFO L913 BasicCegarLoop]: 1366 mSDtfsCounter, 3775 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 1386 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3806 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2022-04-15 18:09:37,407 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3806 Valid, 2600 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 1619 Invalid, 6 Unknown, 0 Unchecked, 27.3s Time] [2022-04-15 18:09:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-04-15 18:09:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1166. [2022-04-15 18:09:37,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:09:37,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 18:09:37,533 INFO L74 IsIncluded]: Start isIncluded. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 18:09:37,535 INFO L87 Difference]: Start difference. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 18:09:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:09:37,606 INFO L93 Difference]: Finished difference Result 1514 states and 2268 transitions. [2022-04-15 18:09:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2268 transitions. [2022-04-15 18:09:37,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:09:37,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:09:37,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1514 states. [2022-04-15 18:09:37,613 INFO L87 Difference]: Start difference. First operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1514 states. [2022-04-15 18:09:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:09:37,686 INFO L93 Difference]: Finished difference Result 1514 states and 2268 transitions. [2022-04-15 18:09:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2268 transitions. [2022-04-15 18:09:37,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:09:37,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:09:37,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:09:37,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:09:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-15 18:09:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1721 transitions. [2022-04-15 18:09:37,757 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1721 transitions. Word has length 39 [2022-04-15 18:09:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:09:37,757 INFO L478 AbstractCegarLoop]: Abstraction has 1166 states and 1721 transitions. [2022-04-15 18:09:37,757 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 18:09:37,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1166 states and 1721 transitions. [2022-04-15 18:09:40,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:09:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1721 transitions. [2022-04-15 18:09:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 18:09:40,423 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:09:40,423 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:09:40,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 18:09:40,423 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:09:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:09:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash -610227898, now seen corresponding path program 1 times [2022-04-15 18:09:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:09:40,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2145262247] [2022-04-15 18:09:40,424 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:09:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash -610227898, now seen corresponding path program 2 times [2022-04-15 18:09:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:09:40,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771743845] [2022-04-15 18:09:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:09:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:09:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:09:40,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:09:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:09:40,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {35153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {35141#true} is VALID [2022-04-15 18:09:40,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-15 18:09:40,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35141#true} {35141#true} #4308#return; {35141#true} is VALID [2022-04-15 18:09:40,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:09:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:09:40,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {35141#true} is VALID [2022-04-15 18:09:40,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-15 18:09:40,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35141#true} {35141#true} #4174#return; {35141#true} is VALID [2022-04-15 18:09:40,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 18:09:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:09:40,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {35155#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {35152#(= ~compRegistered~0 0)} assume true; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35152#(= ~compRegistered~0 0)} {35141#true} #4176#return; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {35141#true} call ULTIMATE.init(); {35153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:09:40,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {35153#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {35141#true} is VALID [2022-04-15 18:09:40,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-15 18:09:40,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35141#true} {35141#true} #4308#return; {35141#true} is VALID [2022-04-15 18:09:40,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {35141#true} call #t~ret1021 := main(); {35141#true} is VALID [2022-04-15 18:09:40,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {35141#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {35141#true} is VALID [2022-04-15 18:09:40,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {35141#true} assume !(~a~0 % 18446744073709551616 < 93); {35141#true} is VALID [2022-04-15 18:09:40,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {35141#true} ~a~0 := 0; {35141#true} is VALID [2022-04-15 18:09:40,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {35141#true} assume !(~a~0 % 18446744073709551616 < 68); {35141#true} is VALID [2022-04-15 18:09:40,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {35141#true} ~a~0 := 0; {35141#true} is VALID [2022-04-15 18:09:40,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {35141#true} assume !(~a~0 % 18446744073709551616 < 904); {35141#true} is VALID [2022-04-15 18:09:40,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {35141#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {35141#true} is VALID [2022-04-15 18:09:40,670 INFO L272 TraceCheckUtils]: 12: Hoare triple {35141#true} call _BLAST_init(); {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:09:40,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {35154#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {35141#true} is VALID [2022-04-15 18:09:40,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-15 18:09:40,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35141#true} {35141#true} #4174#return; {35141#true} is VALID [2022-04-15 18:09:40,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {35141#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {35141#true} is VALID [2022-04-15 18:09:40,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {35141#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {35141#true} is VALID [2022-04-15 18:09:40,671 INFO L272 TraceCheckUtils]: 18: Hoare triple {35141#true} call stub_driver_init(); {35155#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:09:40,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {35155#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {35152#(= ~compRegistered~0 0)} assume true; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,675 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35152#(= ~compRegistered~0 0)} {35141#true} #4176#return; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {35152#(= ~compRegistered~0 0)} assume !!(~status~15 >= 0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {35152#(= ~compRegistered~0 0)} assume !(2 == ~__BLAST_NONDET___0~0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {35152#(= ~compRegistered~0 0)} assume !(3 == ~__BLAST_NONDET___0~0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {35152#(= ~compRegistered~0 0)} assume 4 == ~__BLAST_NONDET___0~0; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,677 INFO L272 TraceCheckUtils]: 26: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {35152#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {35152#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,678 INFO L272 TraceCheckUtils]: 30: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {35152#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 18:09:40,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {35152#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {35142#false} is VALID [2022-04-15 18:09:40,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {35142#false} assume 0 == ~routine~0; {35142#false} is VALID [2022-04-15 18:09:40,679 INFO L272 TraceCheckUtils]: 34: Hoare triple {35142#false} call #t~ret1012 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~1.base, ~lcontext~1.offset); {35142#false} is VALID [2022-04-15 18:09:40,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {35142#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {35142#false} is VALID [2022-04-15 18:09:40,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {35142#false} assume 0 != ~myIrp_PendingReturned~0; {35142#false} is VALID [2022-04-15 18:09:40,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {35142#false} assume !(0 == ~pended~0); {35142#false} is VALID [2022-04-15 18:09:40,679 INFO L272 TraceCheckUtils]: 38: Hoare triple {35142#false} call errorFn(); {35142#false} is VALID [2022-04-15 18:09:40,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {35142#false} assume !false; {35142#false} is VALID [2022-04-15 18:09:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:09:40,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:09:40,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771743845] [2022-04-15 18:09:40,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771743845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:09:40,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:09:40,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:09:40,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:09:40,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2145262247] [2022-04-15 18:09:40,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2145262247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:09:40,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:09:40,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:09:40,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581742979] [2022-04-15 18:09:40,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:09:40,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-15 18:09:40,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:09:40,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:09:40,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:09:40,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 18:09:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:09:40,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 18:09:40,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:09:40,713 INFO L87 Difference]: Start difference. First operand 1166 states and 1721 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:09:56,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:01,718 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-04-15 18:10:06,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:14,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:16,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:18,567 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:25,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:29,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:31,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:31,440 INFO L93 Difference]: Finished difference Result 2067 states and 3010 transitions. [2022-04-15 18:10:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 18:10:31,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-15 18:10:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:10:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:10:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2022-04-15 18:10:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:10:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2022-04-15 18:10:31,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 1796 transitions. [2022-04-15 18:10:33,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1796 edges. 1796 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:10:33,641 INFO L225 Difference]: With dead ends: 2067 [2022-04-15 18:10:33,641 INFO L226 Difference]: Without dead ends: 1899 [2022-04-15 18:10:33,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:10:33,643 INFO L913 BasicCegarLoop]: 1110 mSDtfsCounter, 1448 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 337 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2022-04-15 18:10:33,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1492 Valid, 1790 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1505 Invalid, 6 Unknown, 0 Unchecked, 21.6s Time] [2022-04-15 18:10:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-15 18:10:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1631. [2022-04-15 18:10:33,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:10:33,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:10:33,782 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:10:33,784 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:10:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:33,891 INFO L93 Difference]: Finished difference Result 1899 states and 2785 transitions. [2022-04-15 18:10:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2785 transitions. [2022-04-15 18:10:33,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:10:33,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:10:33,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1899 states. [2022-04-15 18:10:33,899 INFO L87 Difference]: Start difference. First operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1899 states. [2022-04-15 18:10:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:10:34,012 INFO L93 Difference]: Finished difference Result 1899 states and 2785 transitions. [2022-04-15 18:10:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2785 transitions. [2022-04-15 18:10:34,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:10:34,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:10:34,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:10:34,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:10:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:10:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2392 transitions. [2022-04-15 18:10:34,162 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2392 transitions. Word has length 40 [2022-04-15 18:10:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:10:34,162 INFO L478 AbstractCegarLoop]: Abstraction has 1631 states and 2392 transitions. [2022-04-15 18:10:34,162 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:10:34,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1631 states and 2392 transitions. [2022-04-15 18:10:37,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2392 edges. 2392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:10:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2392 transitions. [2022-04-15 18:10:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 18:10:37,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:10:37,500 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:10:37,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 18:10:37,500 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:10:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:10:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash -305283800, now seen corresponding path program 1 times [2022-04-15 18:10:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:10:37,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [750082389] [2022-04-15 18:10:37,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:10:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash -305283800, now seen corresponding path program 2 times [2022-04-15 18:10:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:10:37,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132544304] [2022-04-15 18:10:37,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:10:37,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:10:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:10:37,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:10:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:10:37,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {46370#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {46358#true} is VALID [2022-04-15 18:10:37,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 18:10:37,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4308#return; {46358#true} is VALID [2022-04-15 18:10:37,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:10:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:10:37,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {46358#true} is VALID [2022-04-15 18:10:37,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 18:10:37,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4174#return; {46358#true} is VALID [2022-04-15 18:10:37,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 18:10:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:10:37,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {46372#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {46358#true} is VALID [2022-04-15 18:10:37,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 18:10:37,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4176#return; {46358#true} is VALID [2022-04-15 18:10:37,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {46358#true} call ULTIMATE.init(); {46370#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:10:37,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {46370#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {46358#true} is VALID [2022-04-15 18:10:37,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 18:10:37,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46358#true} {46358#true} #4308#return; {46358#true} is VALID [2022-04-15 18:10:37,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {46358#true} call #t~ret1021 := main(); {46358#true} is VALID [2022-04-15 18:10:37,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {46358#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {46358#true} is VALID [2022-04-15 18:10:37,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {46358#true} assume !(~a~0 % 18446744073709551616 < 93); {46358#true} is VALID [2022-04-15 18:10:37,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {46358#true} ~a~0 := 0; {46358#true} is VALID [2022-04-15 18:10:37,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {46358#true} assume !(~a~0 % 18446744073709551616 < 68); {46358#true} is VALID [2022-04-15 18:10:37,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {46358#true} ~a~0 := 0; {46358#true} is VALID [2022-04-15 18:10:37,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {46358#true} assume !(~a~0 % 18446744073709551616 < 904); {46358#true} is VALID [2022-04-15 18:10:37,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {46358#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {46358#true} is VALID [2022-04-15 18:10:37,717 INFO L272 TraceCheckUtils]: 12: Hoare triple {46358#true} call _BLAST_init(); {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:10:37,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {46371#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {46358#true} is VALID [2022-04-15 18:10:37,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 18:10:37,717 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {46358#true} {46358#true} #4174#return; {46358#true} is VALID [2022-04-15 18:10:37,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {46358#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {46358#true} is VALID [2022-04-15 18:10:37,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {46358#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {46358#true} is VALID [2022-04-15 18:10:37,718 INFO L272 TraceCheckUtils]: 18: Hoare triple {46358#true} call stub_driver_init(); {46372#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:10:37,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {46372#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {46358#true} is VALID [2022-04-15 18:10:37,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 18:10:37,718 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {46358#true} {46358#true} #4176#return; {46358#true} is VALID [2022-04-15 18:10:37,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {46358#true} assume !!(~status~15 >= 0); {46358#true} is VALID [2022-04-15 18:10:37,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {46358#true} assume !(2 == ~__BLAST_NONDET___0~0); {46358#true} is VALID [2022-04-15 18:10:37,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {46358#true} assume !(3 == ~__BLAST_NONDET___0~0); {46358#true} is VALID [2022-04-15 18:10:37,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {46358#true} assume 4 == ~__BLAST_NONDET___0~0; {46358#true} is VALID [2022-04-15 18:10:37,719 INFO L272 TraceCheckUtils]: 26: Hoare triple {46358#true} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {46358#true} is VALID [2022-04-15 18:10:37,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {46358#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {46358#true} is VALID [2022-04-15 18:10:37,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {46358#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:10:37,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:10:37,726 INFO L272 TraceCheckUtils]: 30: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:10:37,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:10:37,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:10:37,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume 0 == ~__BLAST_NONDET___0~17; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:10:37,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} ~returnVal~0 := 0; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:10:37,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:10:37,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:10:37,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {46359#false} is VALID [2022-04-15 18:10:37,729 INFO L272 TraceCheckUtils]: 38: Hoare triple {46359#false} call errorFn(); {46359#false} is VALID [2022-04-15 18:10:37,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {46359#false} assume !false; {46359#false} is VALID [2022-04-15 18:10:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:10:37,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:10:37,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132544304] [2022-04-15 18:10:37,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132544304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:10:37,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:10:37,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:10:37,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:10:37,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [750082389] [2022-04-15 18:10:37,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [750082389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:10:37,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:10:37,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 18:10:37,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884179162] [2022-04-15 18:10:37,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:10:37,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-15 18:10:37,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:10:37,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:10:37,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:10:37,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 18:10:37,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:10:37,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 18:10:37,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 18:10:37,756 INFO L87 Difference]: Start difference. First operand 1631 states and 2392 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:10:48,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:10:54,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:01,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:07,778 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:09,816 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:14,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:18,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:20,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:23,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:30,254 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-04-15 18:11:32,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:34,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:39,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:43,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:49,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:52,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:54,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:11:57,003 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-04-15 18:11:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:11:57,809 INFO L93 Difference]: Finished difference Result 1768 states and 2618 transitions. [2022-04-15 18:11:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 18:11:57,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-04-15 18:11:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:11:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:11:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1234 transitions. [2022-04-15 18:11:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:11:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1234 transitions. [2022-04-15 18:11:57,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 1234 transitions. [2022-04-15 18:11:59,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1234 edges. 1234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:11:59,708 INFO L225 Difference]: With dead ends: 1768 [2022-04-15 18:11:59,708 INFO L226 Difference]: Without dead ends: 1764 [2022-04-15 18:11:59,709 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:11:59,711 INFO L913 BasicCegarLoop]: 904 mSDtfsCounter, 939 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 360 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2022-04-15 18:11:59,711 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [963 Valid, 1479 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1627 Invalid, 11 Unknown, 0 Unchecked, 40.4s Time] [2022-04-15 18:11:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-04-15 18:12:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1630. [2022-04-15 18:12:00,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:12:00,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:12:00,049 INFO L74 IsIncluded]: Start isIncluded. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:12:00,051 INFO L87 Difference]: Start difference. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:12:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:00,203 INFO L93 Difference]: Finished difference Result 1764 states and 2613 transitions. [2022-04-15 18:12:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2613 transitions. [2022-04-15 18:12:00,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:00,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:00,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1764 states. [2022-04-15 18:12:00,212 INFO L87 Difference]: Start difference. First operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1764 states. [2022-04-15 18:12:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:12:00,308 INFO L93 Difference]: Finished difference Result 1764 states and 2613 transitions. [2022-04-15 18:12:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2613 transitions. [2022-04-15 18:12:00,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:12:00,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:12:00,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:12:00,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:12:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-15 18:12:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2389 transitions. [2022-04-15 18:12:00,458 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2389 transitions. Word has length 40 [2022-04-15 18:12:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:12:00,471 INFO L478 AbstractCegarLoop]: Abstraction has 1630 states and 2389 transitions. [2022-04-15 18:12:00,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 18:12:00,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1630 states and 2389 transitions. [2022-04-15 18:12:04,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2389 edges. 2389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2389 transitions. [2022-04-15 18:12:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 18:12:04,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:12:04,384 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:12:04,384 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 18:12:04,384 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:12:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:12:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2118625593, now seen corresponding path program 1 times [2022-04-15 18:12:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:04,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980759280] [2022-04-15 18:12:04,385 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:12:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2118625593, now seen corresponding path program 2 times [2022-04-15 18:12:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:12:04,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248758190] [2022-04-15 18:12:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:12:04,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:12:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:12:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:04,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {56722#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56704#true} is VALID [2022-04-15 18:12:04,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 18:12:04,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4308#return; {56704#true} is VALID [2022-04-15 18:12:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:12:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:04,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56704#true} is VALID [2022-04-15 18:12:04,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 18:12:04,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4174#return; {56704#true} is VALID [2022-04-15 18:12:04,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 18:12:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:04,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {56724#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {56704#true} is VALID [2022-04-15 18:12:04,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 18:12:04,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4176#return; {56704#true} is VALID [2022-04-15 18:12:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 18:12:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:12:04,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {56704#true} is VALID [2022-04-15 18:12:04,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1031 := 0; {56704#true} is VALID [2022-04-15 18:12:04,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {56704#true} assume !(#t~loopctr1031 % 18446744073709551616 < size % 18446744073709551616); {56704#true} is VALID [2022-04-15 18:12:04,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {56704#true} assume #res.base == dest.base && #res.offset == dest.offset; {56704#true} is VALID [2022-04-15 18:12:04,885 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {56704#true} {56704#true} #4356#return; {56704#true} is VALID [2022-04-15 18:12:04,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {56704#true} call ULTIMATE.init(); {56722#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:12:04,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {56722#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56704#true} is VALID [2022-04-15 18:12:04,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 18:12:04,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56704#true} {56704#true} #4308#return; {56704#true} is VALID [2022-04-15 18:12:04,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {56704#true} call #t~ret1021 := main(); {56704#true} is VALID [2022-04-15 18:12:04,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {56704#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {56704#true} is VALID [2022-04-15 18:12:04,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {56704#true} assume !(~a~0 % 18446744073709551616 < 93); {56704#true} is VALID [2022-04-15 18:12:04,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {56704#true} ~a~0 := 0; {56704#true} is VALID [2022-04-15 18:12:04,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {56704#true} assume !(~a~0 % 18446744073709551616 < 68); {56704#true} is VALID [2022-04-15 18:12:04,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {56704#true} ~a~0 := 0; {56704#true} is VALID [2022-04-15 18:12:04,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {56704#true} assume !(~a~0 % 18446744073709551616 < 904); {56704#true} is VALID [2022-04-15 18:12:04,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {56704#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {56704#true} is VALID [2022-04-15 18:12:04,889 INFO L272 TraceCheckUtils]: 12: Hoare triple {56704#true} call _BLAST_init(); {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:12:04,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {56723#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56704#true} is VALID [2022-04-15 18:12:04,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 18:12:04,889 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56704#true} {56704#true} #4174#return; {56704#true} is VALID [2022-04-15 18:12:04,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {56704#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {56704#true} is VALID [2022-04-15 18:12:04,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {56704#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {56704#true} is VALID [2022-04-15 18:12:04,890 INFO L272 TraceCheckUtils]: 18: Hoare triple {56704#true} call stub_driver_init(); {56724#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:12:04,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {56724#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {56704#true} is VALID [2022-04-15 18:12:04,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 18:12:04,890 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {56704#true} {56704#true} #4176#return; {56704#true} is VALID [2022-04-15 18:12:04,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {56704#true} assume !!(~status~15 >= 0); {56704#true} is VALID [2022-04-15 18:12:04,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {56704#true} assume !(2 == ~__BLAST_NONDET___0~0); {56704#true} is VALID [2022-04-15 18:12:04,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {56704#true} assume 3 == ~__BLAST_NONDET___0~0; {56704#true} is VALID [2022-04-15 18:12:04,891 INFO L272 TraceCheckUtils]: 25: Hoare triple {56704#true} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {56704#true} is VALID [2022-04-15 18:12:04,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {56704#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {56704#true} is VALID [2022-04-15 18:12:04,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {56704#true} assume 0 == #t~mem130 % 256;havoc #t~mem130; {56704#true} is VALID [2022-04-15 18:12:04,891 INFO L272 TraceCheckUtils]: 28: Hoare triple {56704#true} call #t~ret132 := CdAudioStartDevice(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56704#true} is VALID [2022-04-15 18:12:04,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {56704#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~0.base, ~deviceExtension~0.offset;havoc ~status~2;call ~#srb~0.base, ~#srb~0.offset := #Ultimate.allocOnStack(57);havoc ~cdb~0.base, ~cdb~0.offset;havoc ~inquiryDataPtr~0.base, ~inquiryDataPtr~0.offset;havoc ~attempt~0;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;havoc ~tmp___1~0;havoc ~tmp___2~0;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~tmp___11~0;havoc ~tmp___12~0;havoc ~tmp___13~0;havoc ~tmp___14~0;havoc ~tmp___15~0;call ~#deviceParameterHandle~1.base, ~#deviceParameterHandle~1.offset := #Ultimate.allocOnStack(8);call ~#keyValue~0.base, ~#keyValue~0.offset := #Ultimate.allocOnStack(8);call #t~mem64.base, #t~mem64.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~0.base, ~deviceExtension~0.offset := #t~mem64.base, #t~mem64.offset;havoc #t~mem64.base, #t~mem64.offset; {56704#true} is VALID [2022-04-15 18:12:04,892 INFO L272 TraceCheckUtils]: 30: Hoare triple {56704#true} call #t~ret65 := CdAudioForwardIrpSynchronous(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56704#true} is VALID [2022-04-15 18:12:04,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {56704#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~15.base, ~deviceExtension~15.offset;call ~#event~2.base, ~#event~2.offset := #Ultimate.allocOnStack(28);havoc ~status~14;havoc ~irpSp~2.base, ~irpSp~2.offset;havoc ~nextIrpSp~1.base, ~nextIrpSp~1.offset;havoc ~irpSp___0~1.base, ~irpSp___0~1.offset;call #t~mem945.base, #t~mem945.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~15.base, ~deviceExtension~15.offset := #t~mem945.base, #t~mem945.offset;havoc #t~mem945.base, #t~mem945.offset;call #t~mem946.base, #t~mem946.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~2.base, ~irpSp~2.offset := #t~mem946.base, #t~mem946.offset;havoc #t~mem946.base, #t~mem946.offset;call #t~mem947.base, #t~mem947.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpSp~1.base, ~nextIrpSp~1.offset := #t~mem947.base, #t~mem947.offset - 68;havoc #t~mem947.base, #t~mem947.offset; {56704#true} is VALID [2022-04-15 18:12:04,893 INFO L272 TraceCheckUtils]: 32: Hoare triple {56704#true} call #t~memcpy~res948.base, #t~memcpy~res948.offset := #Ultimate.C_memcpy(~nextIrpSp~1.base, ~nextIrpSp~1.offset, ~irpSp~2.base, ~irpSp~2.offset, 52); {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 18:12:04,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {56704#true} is VALID [2022-04-15 18:12:04,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {56704#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1031 := 0; {56704#true} is VALID [2022-04-15 18:12:04,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {56704#true} assume !(#t~loopctr1031 % 18446744073709551616 < size % 18446744073709551616); {56704#true} is VALID [2022-04-15 18:12:04,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {56704#true} assume #res.base == dest.base && #res.offset == dest.offset; {56704#true} is VALID [2022-04-15 18:12:04,893 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {56704#true} {56704#true} #4356#return; {56704#true} is VALID [2022-04-15 18:12:04,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {56704#true} havoc #t~memcpy~res948.base, #t~memcpy~res948.offset;call write~int(0, ~nextIrpSp~1.base, 3 + ~nextIrpSp~1.offset, 1); {56704#true} is VALID [2022-04-15 18:12:04,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {56704#true} assume !(~s~0 != ~NP~0); {56704#true} is VALID [2022-04-15 18:12:04,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {56704#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset; {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 18:12:04,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} call #t~mem949.base, #t~mem949.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp___0~1.base, ~irpSp___0~1.offset := #t~mem949.base, #t~mem949.offset - 68;havoc #t~mem949.base, #t~mem949.offset;call write~$Pointer$(#funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset, ~irpSp___0~1.base, 52 + ~irpSp___0~1.offset, 8);call write~$Pointer$(~#event~2.base, ~#event~2.offset, ~irpSp___0~1.base, 60 + ~irpSp___0~1.offset, 8);call write~int(0, ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(64, ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call #t~mem950 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem950 % 256, 128), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem950;call #t~mem951 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem951 % 256, 32), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem951;call #t~mem952.base, #t~mem952.offset := read~$Pointer$(~deviceExtension~15.base, ~deviceExtension~15.offset, 8); {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 18:12:04,899 INFO L272 TraceCheckUtils]: 42: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} call #t~ret953 := IofCallDriver(#t~mem952.base, #t~mem952.offset, ~Irp.base, ~Irp.offset); {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 18:12:04,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet999;havoc #t~nondet999;havoc ~returnVal2~0;assume -2147483648 <= #t~nondet1000 && #t~nondet1000 <= 2147483647;~compRetStatus~0 := #t~nondet1000;havoc #t~nondet1000;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 18:12:04,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} assume 0 != ~compRegistered~0; {56721#(not (= ~routine~0 0))} is VALID [2022-04-15 18:12:04,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {56721#(not (= ~routine~0 0))} assume 0 == ~routine~0; {56705#false} is VALID [2022-04-15 18:12:04,900 INFO L272 TraceCheckUtils]: 46: Hoare triple {56705#false} call #t~ret1001 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {56705#false} is VALID [2022-04-15 18:12:04,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {56705#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {56705#false} is VALID [2022-04-15 18:12:04,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {56705#false} assume 0 != ~myIrp_PendingReturned~0; {56705#false} is VALID [2022-04-15 18:12:04,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {56705#false} assume !(0 == ~pended~0); {56705#false} is VALID [2022-04-15 18:12:04,900 INFO L272 TraceCheckUtils]: 50: Hoare triple {56705#false} call errorFn(); {56705#false} is VALID [2022-04-15 18:12:04,900 INFO L290 TraceCheckUtils]: 51: Hoare triple {56705#false} assume !false; {56705#false} is VALID [2022-04-15 18:12:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:12:04,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:12:04,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248758190] [2022-04-15 18:12:04,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248758190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:04,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:04,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 18:12:04,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:12:04,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980759280] [2022-04-15 18:12:04,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980759280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:12:04,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:12:04,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 18:12:04,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726157369] [2022-04-15 18:12:04,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:12:04,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-04-15 18:12:04,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:12:04,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 18:12:04,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:12:04,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 18:12:04,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:12:04,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 18:12:04,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 18:12:04,986 INFO L87 Difference]: Start difference. First operand 1630 states and 2389 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 18:12:14,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:33,491 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-04-15 18:12:35,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:39,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:44,295 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-04-15 18:12:53,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:12:55,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:03,764 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-04-15 18:13:07,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:09,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:13,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:15,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:17,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:23,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:30,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:32,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:37,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:39,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:42,995 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-04-15 18:13:45,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:51,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:53,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:13:55,486 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-04-15 18:13:58,312 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:00,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:02,427 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:05,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:08,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:09,253 INFO L93 Difference]: Finished difference Result 2734 states and 4044 transitions. [2022-04-15 18:14:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 18:14:09,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-04-15 18:14:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:14:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 18:14:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2103 transitions. [2022-04-15 18:14:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 18:14:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2103 transitions. [2022-04-15 18:14:09,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 2103 transitions. [2022-04-15 18:14:12,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:12,212 INFO L225 Difference]: With dead ends: 2734 [2022-04-15 18:14:12,212 INFO L226 Difference]: Without dead ends: 1596 [2022-04-15 18:14:12,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-04-15 18:14:12,238 INFO L913 BasicCegarLoop]: 922 mSDtfsCounter, 2060 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 3242 mSolverCounterSat, 1015 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 4277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1015 IncrementalHoareTripleChecker+Valid, 3242 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.8s IncrementalHoareTripleChecker+Time [2022-04-15 18:14:12,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2086 Valid, 1659 Invalid, 4277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1015 Valid, 3242 Invalid, 20 Unknown, 0 Unchecked, 71.8s Time] [2022-04-15 18:14:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-04-15 18:14:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1203. [2022-04-15 18:14:12,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:14:12,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:14:12,448 INFO L74 IsIncluded]: Start isIncluded. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:14:12,449 INFO L87 Difference]: Start difference. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:14:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:12,631 INFO L93 Difference]: Finished difference Result 1596 states and 2399 transitions. [2022-04-15 18:14:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2399 transitions. [2022-04-15 18:14:12,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:14:12,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:14:12,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1596 states. [2022-04-15 18:14:12,637 INFO L87 Difference]: Start difference. First operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1596 states. [2022-04-15 18:14:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:14:12,756 INFO L93 Difference]: Finished difference Result 1596 states and 2399 transitions. [2022-04-15 18:14:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2399 transitions. [2022-04-15 18:14:12,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:14:12,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:14:12,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:14:12,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:14:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:14:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1742 transitions. [2022-04-15 18:14:12,863 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1742 transitions. Word has length 52 [2022-04-15 18:14:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:14:12,863 INFO L478 AbstractCegarLoop]: Abstraction has 1203 states and 1742 transitions. [2022-04-15 18:14:12,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 18:14:12,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1203 states and 1742 transitions. [2022-04-15 18:14:16,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1742 edges. 1742 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1742 transitions. [2022-04-15 18:14:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 18:14:16,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:14:16,687 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:14:16,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 18:14:16,687 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:14:16,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:14:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash 975245132, now seen corresponding path program 1 times [2022-04-15 18:14:16,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:16,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1393009454] [2022-04-15 18:14:16,688 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:14:16,688 INFO L85 PathProgramCache]: Analyzing trace with hash 975245132, now seen corresponding path program 2 times [2022-04-15 18:14:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:14:16,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826650803] [2022-04-15 18:14:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:14:16,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:14:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:16,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:14:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:16,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {67836#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:16,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume true; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:16,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67824#(= ~myIrp_PendingReturned~0 0)} {67819#true} #4308#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:16,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:14:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:16,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67819#true} is VALID [2022-04-15 18:14:16,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-15 18:14:16,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4174#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 18:14:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:17,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {67838#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {67819#true} is VALID [2022-04-15 18:14:17,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-15 18:14:17,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4176#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 18:14:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:14:17,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {67819#true} is VALID [2022-04-15 18:14:17,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1031 := 0; {67819#true} is VALID [2022-04-15 18:14:17,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {67819#true} assume !(#t~loopctr1031 % 18446744073709551616 < size % 18446744073709551616); {67819#true} is VALID [2022-04-15 18:14:17,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {67819#true} assume #res.base == dest.base && #res.offset == dest.offset; {67819#true} is VALID [2022-04-15 18:14:17,081 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4056#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {67819#true} call ULTIMATE.init(); {67836#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:14:17,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {67836#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume true; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67824#(= ~myIrp_PendingReturned~0 0)} {67819#true} #4308#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret1021 := main(); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 18446744073709551616 < 93); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 18446744073709551616 < 68); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 18446744073709551616 < 904); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,086 INFO L272 TraceCheckUtils]: 12: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call _BLAST_init(); {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:14:17,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {67837#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67819#true} is VALID [2022-04-15 18:14:17,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-15 18:14:17,087 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4174#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,103 INFO L272 TraceCheckUtils]: 18: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call stub_driver_init(); {67838#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:14:17,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {67838#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {67819#true} is VALID [2022-04-15 18:14:17,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-15 18:14:17,105 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4176#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !!(~status~15 >= 0); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 2 == ~__BLAST_NONDET___0~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,110 INFO L272 TraceCheckUtils]: 24: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret978 := CdAudioDeviceControl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~3.base, ~deviceExtension~3.offset;havoc ~status~4;call #t~mem159.base, #t~mem159.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~3.base, ~deviceExtension~3.offset := #t~mem159.base, #t~mem159.offset;havoc #t~mem159.base, #t~mem159.offset;call #t~mem160 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(2 == #t~mem160 % 256);havoc #t~mem160;call #t~mem161 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(3 == #t~mem161 % 256);havoc #t~mem161;call #t~mem162 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(1 == #t~mem162 % 256);havoc #t~mem162;call #t~mem163 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 7 == #t~mem163 % 256;havoc #t~mem163; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,113 INFO L272 TraceCheckUtils]: 30: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret167 := CdAudioHPCdrDeviceControl(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~currentIrpStack~7.base, ~currentIrpStack~7.offset;havoc ~nextIrpStack~0.base, ~nextIrpStack~0.offset;havoc ~deviceExtension~14.base, ~deviceExtension~14.offset;havoc ~irpSp~1.base, ~irpSp~1.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;havoc ~tmp~14;havoc ~tmp___0~8;call #t~mem932.base, #t~mem932.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~currentIrpStack~7.base, ~currentIrpStack~7.offset := #t~mem932.base, #t~mem932.offset;havoc #t~mem932.base, #t~mem932.offset;call #t~mem933.base, #t~mem933.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpStack~0.base, ~nextIrpStack~0.offset := #t~mem933.base, #t~mem933.offset - 68;havoc #t~mem933.base, #t~mem933.offset;call #t~mem934.base, #t~mem934.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~14.base, ~deviceExtension~14.offset := #t~mem934.base, #t~mem934.offset;havoc #t~mem934.base, #t~mem934.offset;call #t~mem935 := read~int(~currentIrpStack~7.base, 20 + ~currentIrpStack~7.offset, 8); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume #t~mem935 % 18446744073709551616 == ~bitwiseOr(~bitwiseOr(131072, 16384), 56) % 18446744073709551616;havoc #t~mem935;call #t~mem936.base, #t~mem936.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~1.base, ~irpSp~1.offset := #t~mem936.base, #t~mem936.offset;havoc #t~mem936.base, #t~mem936.offset;call #t~mem937.base, #t~mem937.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem937.base, #t~mem937.offset - 68;havoc #t~mem937.base, #t~mem937.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,115 INFO L272 TraceCheckUtils]: 33: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~memcpy~res938.base, #t~memcpy~res938.offset := #Ultimate.C_memcpy(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~1.base, ~irpSp~1.offset, 52); {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 18:14:17,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {67819#true} is VALID [2022-04-15 18:14:17,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {67819#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1031 := 0; {67819#true} is VALID [2022-04-15 18:14:17,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {67819#true} assume !(#t~loopctr1031 % 18446744073709551616 < size % 18446744073709551616); {67819#true} is VALID [2022-04-15 18:14:17,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {67819#true} assume #res.base == dest.base && #res.offset == dest.offset; {67819#true} is VALID [2022-04-15 18:14:17,116 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4056#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,117 INFO L290 TraceCheckUtils]: 39: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} havoc #t~memcpy~res938.base, #t~memcpy~res938.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,117 INFO L290 TraceCheckUtils]: 40: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~s~0 != ~NP~0); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 0;~compFptr~0.base, ~compFptr~0.offset := #funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,118 INFO L290 TraceCheckUtils]: 42: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~mem939.base, #t~mem939.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem939.base, #t~mem939.offset - 68;havoc #t~mem939.base, #t~mem939.offset;call write~$Pointer$(#funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset, ~irpSp___0~0.base, 52 + ~irpSp___0~0.offset, 8);call write~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, ~irpSp___0~0.base, 60 + ~irpSp___0~0.offset, 8);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem940 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem940 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem940;call #t~mem941 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem941 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem941;call #t~mem942.base, #t~mem942.offset := read~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, 8); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,118 INFO L272 TraceCheckUtils]: 43: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret943 := IofCallDriver(#t~mem942.base, #t~mem942.offset, ~Irp.base, ~Irp.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet999;havoc #t~nondet999;havoc ~returnVal2~0;assume -2147483648 <= #t~nondet1000 && #t~nondet1000 <= 2147483647;~compRetStatus~0 := #t~nondet1000;havoc #t~nondet1000;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~compRegistered~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,119 INFO L290 TraceCheckUtils]: 46: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~routine~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,120 INFO L272 TraceCheckUtils]: 47: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret1001 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 18:14:17,120 INFO L290 TraceCheckUtils]: 49: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~myIrp_PendingReturned~0; {67820#false} is VALID [2022-04-15 18:14:17,120 INFO L290 TraceCheckUtils]: 50: Hoare triple {67820#false} assume !(0 == ~pended~0); {67820#false} is VALID [2022-04-15 18:14:17,120 INFO L272 TraceCheckUtils]: 51: Hoare triple {67820#false} call errorFn(); {67820#false} is VALID [2022-04-15 18:14:17,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {67820#false} assume !false; {67820#false} is VALID [2022-04-15 18:14:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:14:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:14:17,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826650803] [2022-04-15 18:14:17,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826650803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:17,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:17,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 18:14:17,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:14:17,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1393009454] [2022-04-15 18:14:17,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1393009454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:14:17,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:14:17,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 18:14:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587422345] [2022-04-15 18:14:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:14:17,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2022-04-15 18:14:17,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:14:17,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 18:14:17,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:14:17,169 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 18:14:17,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:14:17,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 18:14:17,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 18:14:17,170 INFO L87 Difference]: Start difference. First operand 1203 states and 1742 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 18:14:31,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:37,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:41,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:45,067 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-04-15 18:14:50,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:56,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:14:59,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:01,749 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:05,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:12,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:14,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:27,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:30,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:32,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:15:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:32,972 INFO L93 Difference]: Finished difference Result 2154 states and 3211 transitions. [2022-04-15 18:15:32,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 18:15:32,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2022-04-15 18:15:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:15:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 18:15:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1904 transitions. [2022-04-15 18:15:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 18:15:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1904 transitions. [2022-04-15 18:15:33,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 1904 transitions. [2022-04-15 18:15:35,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1904 edges. 1904 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:35,508 INFO L225 Difference]: With dead ends: 2154 [2022-04-15 18:15:35,508 INFO L226 Difference]: Without dead ends: 1486 [2022-04-15 18:15:35,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-15 18:15:35,511 INFO L913 BasicCegarLoop]: 761 mSDtfsCounter, 1797 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 741 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2022-04-15 18:15:35,511 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1856 Valid, 1170 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 1770 Invalid, 8 Unknown, 0 Unchecked, 34.9s Time] [2022-04-15 18:15:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2022-04-15 18:15:35,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1200. [2022-04-15 18:15:35,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:15:35,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:15:35,662 INFO L74 IsIncluded]: Start isIncluded. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:15:35,663 INFO L87 Difference]: Start difference. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:15:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:35,729 INFO L93 Difference]: Finished difference Result 1486 states and 2244 transitions. [2022-04-15 18:15:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2244 transitions. [2022-04-15 18:15:35,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:35,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:35,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1486 states. [2022-04-15 18:15:35,735 INFO L87 Difference]: Start difference. First operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1486 states. [2022-04-15 18:15:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:15:35,802 INFO L93 Difference]: Finished difference Result 1486 states and 2244 transitions. [2022-04-15 18:15:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2244 transitions. [2022-04-15 18:15:35,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:15:35,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:15:35,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:15:35,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:15:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-15 18:15:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1731 transitions. [2022-04-15 18:15:35,874 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1731 transitions. Word has length 53 [2022-04-15 18:15:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:15:35,874 INFO L478 AbstractCegarLoop]: Abstraction has 1200 states and 1731 transitions. [2022-04-15 18:15:35,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 18:15:35,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1200 states and 1731 transitions. [2022-04-15 18:15:39,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1731 edges. 1731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1731 transitions. [2022-04-15 18:15:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 18:15:39,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:15:39,016 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:15:39,016 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 18:15:39,016 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:15:39,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:15:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash -990249866, now seen corresponding path program 1 times [2022-04-15 18:15:39,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:39,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1051936628] [2022-04-15 18:15:39,017 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:15:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash -990249866, now seen corresponding path program 2 times [2022-04-15 18:15:39,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:15:39,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063157735] [2022-04-15 18:15:39,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:15:39,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:15:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:39,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:15:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:39,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {77562#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {77535#true} is VALID [2022-04-15 18:15:39,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-15 18:15:39,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77535#true} {77535#true} #4308#return; {77535#true} is VALID [2022-04-15 18:15:39,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:15:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:39,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume true; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77543#(not (= ~SKIP1~0 ~NP~0))} {77535#true} #4174#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 18:15:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:39,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {77564#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {77535#true} is VALID [2022-04-15 18:15:39,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-15 18:15:39,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77535#true} {77543#(not (= ~SKIP1~0 ~NP~0))} #4176#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 18:15:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:39,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 18:15:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:15:39,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,305 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:39,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {77535#true} is VALID [2022-04-15 18:15:39,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:15:39,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:15:39,307 INFO L272 TraceCheckUtils]: 3: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:15:39,307 INFO L290 TraceCheckUtils]: 4: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,310 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:39,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume -9223372036854775808 <= #t~ret960 && #t~ret960 <= 9223372036854775807;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:39,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume true; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:39,311 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {77575#(= ~SKIP1~0 ~NP~0)} {77543#(not (= ~SKIP1~0 ~NP~0))} #4182#return; {77536#false} is VALID [2022-04-15 18:15:39,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {77535#true} call ULTIMATE.init(); {77562#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:15:39,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {77562#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {77535#true} is VALID [2022-04-15 18:15:39,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-15 18:15:39,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77535#true} {77535#true} #4308#return; {77535#true} is VALID [2022-04-15 18:15:39,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {77535#true} call #t~ret1021 := main(); {77535#true} is VALID [2022-04-15 18:15:39,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {77535#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {77535#true} is VALID [2022-04-15 18:15:39,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {77535#true} assume !(~a~0 % 18446744073709551616 < 93); {77535#true} is VALID [2022-04-15 18:15:39,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {77535#true} ~a~0 := 0; {77535#true} is VALID [2022-04-15 18:15:39,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {77535#true} assume !(~a~0 % 18446744073709551616 < 68); {77535#true} is VALID [2022-04-15 18:15:39,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {77535#true} ~a~0 := 0; {77535#true} is VALID [2022-04-15 18:15:39,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {77535#true} assume !(~a~0 % 18446744073709551616 < 904); {77535#true} is VALID [2022-04-15 18:15:39,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {77535#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {77535#true} is VALID [2022-04-15 18:15:39,314 INFO L272 TraceCheckUtils]: 12: Hoare triple {77535#true} call _BLAST_init(); {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:15:39,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {77563#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume true; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,315 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {77543#(not (= ~SKIP1~0 ~NP~0))} {77535#true} #4174#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,316 INFO L272 TraceCheckUtils]: 18: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {77564#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:15:39,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {77564#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {77535#true} is VALID [2022-04-15 18:15:39,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-15 18:15:39,317 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {77535#true} {77543#(not (= ~SKIP1~0 ~NP~0))} #4176#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !!(~status~15 >= 0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !(2 == ~__BLAST_NONDET___0~0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !(3 == ~__BLAST_NONDET___0~0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume 4 == ~__BLAST_NONDET___0~0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 18:15:39,318 INFO L272 TraceCheckUtils]: 26: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:15:39,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {77535#true} is VALID [2022-04-15 18:15:39,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {77535#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:15:39,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 18:15:39,320 INFO L272 TraceCheckUtils]: 30: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:15:39,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {77565#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 18:15:39,323 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:39,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume -9223372036854775808 <= #t~ret960 && #t~ret960 <= 9223372036854775807;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:39,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume true; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 18:15:39,324 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {77575#(= ~SKIP1~0 ~NP~0)} {77543#(not (= ~SKIP1~0 ~NP~0))} #4182#return; {77536#false} is VALID [2022-04-15 18:15:39,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {77536#false} assume -9223372036854775808 <= #t~ret980 && #t~ret980 <= 9223372036854775807;~status~15 := #t~ret980;havoc #t~ret980; {77536#false} is VALID [2022-04-15 18:15:39,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {77536#false} assume 0 != ~we_should_unload~0; {77536#false} is VALID [2022-04-15 18:15:39,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-15 18:15:39,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-15 18:15:39,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {77536#false} assume !(~s~0 == ~UNLOADED~0); {77536#false} is VALID [2022-04-15 18:15:39,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {77536#false} assume !(-1 == ~status~15); {77536#false} is VALID [2022-04-15 18:15:39,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {77536#false} assume !(~s~0 != ~SKIP2~0); {77536#false} is VALID [2022-04-15 18:15:39,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-15 18:15:39,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {77536#false} assume ~s~0 == ~DC~0; {77536#false} is VALID [2022-04-15 18:15:39,324 INFO L272 TraceCheckUtils]: 51: Hoare triple {77536#false} call errorFn(); {77536#false} is VALID [2022-04-15 18:15:39,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {77536#false} assume !false; {77536#false} is VALID [2022-04-15 18:15:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:15:39,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:15:39,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063157735] [2022-04-15 18:15:39,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063157735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:39,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:39,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 18:15:39,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:15:39,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1051936628] [2022-04-15 18:15:39,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1051936628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:15:39,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:15:39,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 18:15:39,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900889452] [2022-04-15 18:15:39,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:15:39,326 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2022-04-15 18:15:39,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:15:39,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 18:15:39,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:15:39,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 18:15:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:15:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 18:15:39,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 18:15:39,363 INFO L87 Difference]: Start difference. First operand 1200 states and 1731 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 18:16:06,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:15,628 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-04-15 18:16:17,679 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-04-15 18:16:19,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:21,755 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:31,318 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-04-15 18:16:33,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:35,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:41,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:42,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:45,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:47,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:53,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:16:56,626 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-04-15 18:17:10,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:22,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:24,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:26,713 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-04-15 18:17:30,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:33,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:45,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:49,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:51,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:52,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:56,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:17:59,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:01,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:04,414 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-04-15 18:18:08,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 18:18:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:12,540 INFO L93 Difference]: Finished difference Result 1832 states and 2719 transitions. [2022-04-15 18:18:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 18:18:12,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2022-04-15 18:18:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:18:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 18:18:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1922 transitions. [2022-04-15 18:18:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 18:18:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1922 transitions. [2022-04-15 18:18:12,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 1922 transitions. [2022-04-15 18:18:15,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1922 edges. 1922 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:15,345 INFO L225 Difference]: With dead ends: 1832 [2022-04-15 18:18:15,345 INFO L226 Difference]: Without dead ends: 1772 [2022-04-15 18:18:15,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2022-04-15 18:18:15,346 INFO L913 BasicCegarLoop]: 1062 mSDtfsCounter, 2903 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 4434 mSolverCounterSat, 1366 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2936 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 5821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1366 IncrementalHoareTripleChecker+Valid, 4434 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.6s IncrementalHoareTripleChecker+Time [2022-04-15 18:18:15,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2936 Valid, 2828 Invalid, 5821 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1366 Valid, 4434 Invalid, 21 Unknown, 0 Unchecked, 74.6s Time] [2022-04-15 18:18:15,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2022-04-15 18:18:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1272. [2022-04-15 18:18:15,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:18:15,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-15 18:18:15,530 INFO L74 IsIncluded]: Start isIncluded. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-15 18:18:15,531 INFO L87 Difference]: Start difference. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-15 18:18:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:15,626 INFO L93 Difference]: Finished difference Result 1772 states and 2639 transitions. [2022-04-15 18:18:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2639 transitions. [2022-04-15 18:18:15,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:18:15,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:18:15,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1772 states. [2022-04-15 18:18:15,633 INFO L87 Difference]: Start difference. First operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1772 states. [2022-04-15 18:18:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:18:15,735 INFO L93 Difference]: Finished difference Result 1772 states and 2639 transitions. [2022-04-15 18:18:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2639 transitions. [2022-04-15 18:18:15,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:18:15,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:18:15,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:18:15,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:18:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-15 18:18:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1819 transitions. [2022-04-15 18:18:15,810 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1819 transitions. Word has length 53 [2022-04-15 18:18:15,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:18:15,810 INFO L478 AbstractCegarLoop]: Abstraction has 1272 states and 1819 transitions. [2022-04-15 18:18:15,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 18:18:15,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1272 states and 1819 transitions. [2022-04-15 18:18:19,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1819 edges. 1819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1819 transitions. [2022-04-15 18:18:19,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 18:18:19,100 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:18:19,100 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:18:19,100 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 18:18:19,101 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:18:19,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:18:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1812095217, now seen corresponding path program 1 times [2022-04-15 18:18:19,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:19,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1920448417] [2022-04-15 18:18:19,101 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:18:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1812095217, now seen corresponding path program 2 times [2022-04-15 18:18:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:18:19,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145613469] [2022-04-15 18:18:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:18:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:18:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:19,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:18:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:19,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {87399#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {87367#true} is VALID [2022-04-15 18:18:19,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-15 18:18:19,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87367#true} {87367#true} #4308#return; {87367#true} is VALID [2022-04-15 18:18:19,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 18:18:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:19,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 18:18:19,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume true; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 18:18:19,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} {87367#true} #4174#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 18:18:19,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 18:18:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:19,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {87401#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {87367#true} is VALID [2022-04-15 18:18:19,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-15 18:18:19,377 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87367#true} {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} #4176#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 18:18:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 18:18:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 18:18:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:18:19,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-15 18:18:19,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-15 18:18:19,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-15 18:18:19,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-15 18:18:19,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-15 18:18:19,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-15 18:18:19,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,452 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {87367#true} is VALID [2022-04-15 18:18:19,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {87367#true} is VALID [2022-04-15 18:18:19,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {87367#true} is VALID [2022-04-15 18:18:19,453 INFO L272 TraceCheckUtils]: 3: Hoare triple {87367#true} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:18:19,453 INFO L290 TraceCheckUtils]: 4: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-15 18:18:19,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-15 18:18:19,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-15 18:18:19,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-15 18:18:19,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-15 18:18:19,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-15 18:18:19,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,455 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume -9223372036854775808 <= #t~ret960 && #t~ret960 <= 9223372036854775807;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,457 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87380#(not (= ~SKIP2~0 ~DC~0))} #4182#return; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 18:18:19,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {87367#true} call ULTIMATE.init(); {87399#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:18:19,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {87399#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} #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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {87367#true} is VALID [2022-04-15 18:18:19,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-15 18:18:19,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87367#true} {87367#true} #4308#return; {87367#true} is VALID [2022-04-15 18:18:19,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {87367#true} call #t~ret1021 := main(); {87367#true} is VALID [2022-04-15 18:18:19,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet961 && #t~nondet961 <= 9223372036854775807;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem967.base, 204 + #t~mem967.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {87367#true} is VALID [2022-04-15 18:18:19,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume !(~a~0 % 18446744073709551616 < 93); {87367#true} is VALID [2022-04-15 18:18:19,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {87367#true} ~a~0 := 0; {87367#true} is VALID [2022-04-15 18:18:19,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {87367#true} assume !(~a~0 % 18446744073709551616 < 68); {87367#true} is VALID [2022-04-15 18:18:19,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {87367#true} ~a~0 := 0; {87367#true} is VALID [2022-04-15 18:18:19,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {87367#true} assume !(~a~0 % 18446744073709551616 < 904); {87367#true} is VALID [2022-04-15 18:18:19,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {87367#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {87367#true} is VALID [2022-04-15 18:18:19,460 INFO L272 TraceCheckUtils]: 12: Hoare triple {87367#true} call _BLAST_init(); {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:18:19,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {87400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 18:18:19,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume true; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 18:18:19,461 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} {87367#true} #4174#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 18:18:19,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 18:18:19,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 18:18:19,463 INFO L272 TraceCheckUtils]: 18: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} call stub_driver_init(); {87401#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:18:19,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {87401#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {87367#true} is VALID [2022-04-15 18:18:19,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-15 18:18:19,463 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {87367#true} {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} #4176#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 18:18:19,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume !!(~status~15 >= 0); {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 18:18:19,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume !(2 == ~__BLAST_NONDET___0~0); {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} is VALID [2022-04-15 18:18:19,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} assume !(3 == ~__BLAST_NONDET___0~0); {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} is VALID [2022-04-15 18:18:19,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} assume 4 == ~__BLAST_NONDET___0~0; {87380#(not (= ~SKIP2~0 ~DC~0))} is VALID [2022-04-15 18:18:19,465 INFO L272 TraceCheckUtils]: 26: Hoare triple {87380#(not (= ~SKIP2~0 ~DC~0))} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:18:19,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {87367#true} is VALID [2022-04-15 18:18:19,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {87367#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {87367#true} is VALID [2022-04-15 18:18:19,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {87367#true} call #t~mem956 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem957.base, 68 + #t~mem957.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {87367#true} is VALID [2022-04-15 18:18:19,466 INFO L272 TraceCheckUtils]: 30: Hoare triple {87367#true} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 18:18:19,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {87402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-15 18:18:19,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-15 18:18:19,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-15 18:18:19,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-15 18:18:19,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-15 18:18:19,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-15 18:18:19,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,468 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume -9223372036854775808 <= #t~ret960 && #t~ret960 <= 9223372036854775807;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 18:18:19,470 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87380#(not (= ~SKIP2~0 ~DC~0))} #4182#return; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 18:18:19,470 INFO L290 TraceCheckUtils]: 44: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume -9223372036854775808 <= #t~ret980 && #t~ret980 <= 9223372036854775807;~status~15 := #t~ret980;havoc #t~ret980; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 18:18:19,470 INFO L290 TraceCheckUtils]: 45: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume 0 != ~we_should_unload~0; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 18:18:19,470 INFO L290 TraceCheckUtils]: 46: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 18:18:19,471 INFO L290 TraceCheckUtils]: 47: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 18:18:19,471 INFO L290 TraceCheckUtils]: 48: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(~s~0 == ~UNLOADED~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 18:18:19,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(-1 == ~status~15); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 18:18:19,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(~s~0 != ~SKIP2~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 18:18:19,472 INFO L290 TraceCheckUtils]: 51: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 18:18:19,472 INFO L290 TraceCheckUtils]: 52: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume ~s~0 == ~DC~0; {87368#false} is VALID [2022-04-15 18:18:19,472 INFO L272 TraceCheckUtils]: 53: Hoare triple {87368#false} call errorFn(); {87368#false} is VALID [2022-04-15 18:18:19,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {87368#false} assume !false; {87368#false} is VALID [2022-04-15 18:18:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 18:18:19,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:18:19,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145613469] [2022-04-15 18:18:19,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145613469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:19,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:19,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 18:18:19,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:18:19,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1920448417] [2022-04-15 18:18:19,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1920448417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:18:19,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:18:19,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 18:18:19,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277217567] [2022-04-15 18:18:19,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:18:19,474 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-04-15 18:18:19,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:18:19,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 18:18:19,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:18:19,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 18:18:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:18:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 18:18:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 18:18:19,522 INFO L87 Difference]: Start difference. First operand 1272 states and 1819 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5)