./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 158aa30053f80b6c80bcbeac6f52ce0f8b5c03af85b763fe7e9897c790504a73 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:40:01,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:40:01,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:40:01,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:40:01,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:40:01,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:40:01,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:40:01,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:40:01,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:40:01,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:40:01,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:40:01,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:40:01,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:40:01,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:40:01,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:40:01,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:40:01,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:40:01,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:40:01,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:40:01,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:40:01,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:40:01,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:40:01,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:40:01,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:40:01,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:40:01,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:40:01,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:40:01,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:40:01,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:40:01,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:40:01,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:40:01,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:40:01,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:40:01,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:40:01,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:40:01,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:40:01,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:40:01,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:40:01,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:40:01,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:40:01,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:40:01,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:40:01,861 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:40:01,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:40:01,861 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:40:01,861 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:40:01,862 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:40:01,862 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:40:01,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:40:01,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:40:01,863 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:40:01,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:40:01,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:40:01,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:40:01,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:40:01,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:40:01,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:40:01,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:40:01,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:40:01,867 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:40:01,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:40:01,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:40:01,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:40:01,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:40:01,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:40:01,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:40:01,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:40:01,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:40:01,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:40:01,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:40:01,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:40:01,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:40:01,869 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:40:01,870 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:40:01,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:40:01,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 158aa30053f80b6c80bcbeac6f52ce0f8b5c03af85b763fe7e9897c790504a73 [2022-02-20 14:40:02,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:40:02,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:40:02,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:40:02,121 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:40:02,122 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:40:02,123 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c [2022-02-20 14:40:02,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f786059/2e2888abb80346dc9e185e391a77eed2/FLAG2f60a53a7 [2022-02-20 14:40:02,826 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:40:02,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c [2022-02-20 14:40:02,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f786059/2e2888abb80346dc9e185e391a77eed2/FLAG2f60a53a7 [2022-02-20 14:40:03,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f786059/2e2888abb80346dc9e185e391a77eed2 [2022-02-20 14:40:03,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:40:03,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:40:03,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:40:03,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:40:03,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:40:03,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:40:03" (1/1) ... [2022-02-20 14:40:03,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f90c4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:03, skipping insertion in model container [2022-02-20 14:40:03,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:40:03" (1/1) ... [2022-02-20 14:40:03,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:40:03,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:40:03,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c[90200,90213] [2022-02-20 14:40:04,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:40:04,604 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:40:04,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c[90200,90213] [2022-02-20 14:40:04,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:40:05,026 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:40:05,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05 WrapperNode [2022-02-20 14:40:05,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:40:05,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:40:05,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:40:05,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:40:05,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05" (1/1) ... [2022-02-20 14:40:05,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05" (1/1) ... [2022-02-20 14:40:05,261 INFO L137 Inliner]: procedures = 121, calls = 2189, calls flagged for inlining = 23, calls inlined = 19, statements flattened = 2294 [2022-02-20 14:40:05,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:40:05,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:40:05,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:40:05,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:40:05,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05" (1/1) ... [2022-02-20 14:40:05,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05" (1/1) ... [2022-02-20 14:40:05,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05" (1/1) ... [2022-02-20 14:40:05,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05" (1/1) ... [2022-02-20 14:40:05,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05" (1/1) ... [2022-02-20 14:40:05,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05" (1/1) ... [2022-02-20 14:40:05,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05" (1/1) ... [2022-02-20 14:40:05,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:40:05,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:40:05,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:40:05,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:40:05,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05" (1/1) ... [2022-02-20 14:40:05,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:40:05,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:40:05,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:40:05,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:40:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 14:40:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 14:40:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 14:40:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:40:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-02-20 14:40:05,481 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-02-20 14:40:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-02-20 14:40:05,481 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-02-20 14:40:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:40:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-02-20 14:40:05,481 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-02-20 14:40:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-02-20 14:40:05,482 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-02-20 14:40:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-02-20 14:40:05,482 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-02-20 14:40:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 14:40:05,482 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 14:40:05,482 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-02-20 14:40:05,482 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-02-20 14:40:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-02-20 14:40:05,483 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-02-20 14:40:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:40:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-02-20 14:40:05,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-02-20 14:40:05,483 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-02-20 14:40:05,483 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-02-20 14:40:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:40:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 14:40:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:40:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-02-20 14:40:05,484 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-02-20 14:40:05,484 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 14:40:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 14:40:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-02-20 14:40:05,485 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-02-20 14:40:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-02-20 14:40:05,485 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-02-20 14:40:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:40:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-02-20 14:40:05,486 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-02-20 14:40:05,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-02-20 14:40:05,486 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-02-20 14:40:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-02-20 14:40:05,487 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-02-20 14:40:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:40:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-02-20 14:40:05,487 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-02-20 14:40:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 14:40:05,487 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-02-20 14:40:05,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-02-20 14:40:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:40:05,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:40:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-02-20 14:40:05,488 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-02-20 14:40:05,887 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:40:05,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:40:06,093 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:06,111 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-02-20 14:40:06,116 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-02-20 14:40:06,681 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:06,717 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-02-20 14:40:06,717 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-02-20 14:40:06,748 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:06,750 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:06,752 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:06,767 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:06,778 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:06,785 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:17,035 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume false; [2022-02-20 14:40:17,035 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##259: assume !false; [2022-02-20 14:40:17,035 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume false; [2022-02-20 14:40:17,035 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume !false; [2022-02-20 14:40:17,036 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: CdAudioPnp_#res#1 := 0; [2022-02-20 14:40:17,036 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-02-20 14:40:17,036 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-02-20 14:40:17,036 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-02-20 14:40:17,036 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-02-20 14:40:17,036 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-02-20 14:40:17,036 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2022-02-20 14:40:17,036 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2022-02-20 14:40:17,036 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-02-20 14:40:17,077 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:17,082 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-20 14:40:17,082 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-20 14:40:17,097 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:40:17,118 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:40:17,119 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:40:17,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:40:17 BoogieIcfgContainer [2022-02-20 14:40:17,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:40:17,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:40:17,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:40:17,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:40:17,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:40:03" (1/3) ... [2022-02-20 14:40:17,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cc421a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:40:17, skipping insertion in model container [2022-02-20 14:40:17,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:05" (2/3) ... [2022-02-20 14:40:17,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cc421a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:40:17, skipping insertion in model container [2022-02-20 14:40:17,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:40:17" (3/3) ... [2022-02-20 14:40:17,129 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-2.c [2022-02-20 14:40:17,134 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:40:17,134 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:40:17,187 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:40:17,197 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:40:17,197 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:40:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 617 states, 483 states have (on average 1.525879917184265) internal successors, (737), 502 states have internal predecessors, (737), 113 states have call successors, (113), 19 states have call predecessors, (113), 19 states have return successors, (113), 108 states have call predecessors, (113), 113 states have call successors, (113) [2022-02-20 14:40:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:40:17,245 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:17,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:17,246 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:17,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1346091919, now seen corresponding path program 1 times [2022-02-20 14:40:17,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:17,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542766080] [2022-02-20 14:40:17,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:17,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:17,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {620#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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);~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; {620#true} is VALID [2022-02-20 14:40:17,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet964#1, main_#t~nondet965#1, main_#t~nondet966#1, main_#t~nondet967#1, main_#t~malloc968#1.base, main_#t~malloc968#1.offset, main_#t~malloc969#1.base, main_#t~malloc969#1.offset, main_#t~mem970#1.base, main_#t~mem970#1.offset, main_#t~malloc971#1.base, main_#t~malloc971#1.offset, main_#t~ret972#1, main_#t~ret973#1, main_#t~ret974#1, main_~d~0#1.Type, main_~d~0#1.Size, main_~d~0#1.DeviceObject.base, main_~d~0#1.DeviceObject.offset, main_~d~0#1.Flags, main_~d~0#1.DriverStart.base, main_~d~0#1.DriverStart.offset, main_~d~0#1.DriverSize, main_~d~0#1.DriverSection.base, main_~d~0#1.DriverSection.offset, main_~d~0#1.DriverExtension.base, main_~d~0#1.DriverExtension.offset, main_~d~0#1.DriverName.Length, main_~d~0#1.DriverName.MaximumLength, main_~d~0#1.DriverName.Buffer.base, main_~d~0#1.DriverName.Buffer.offset, main_~d~0#1.HardwareDatabase.base, main_~d~0#1.HardwareDatabase.offset, main_~d~0#1.FastIoDispatch.base, main_~d~0#1.FastIoDispatch.offset, main_~d~0#1.DriverInit.base, main_~d~0#1.DriverInit.offset, main_~d~0#1.DriverStartIo.base, main_~d~0#1.DriverStartIo.offset, main_~d~0#1.DriverUnload.base, main_~d~0#1.DriverUnload.offset, main_~d~0#1.MajorFunction.base, main_~d~0#1.MajorFunction.offset, main_~status~15#1, main_~#irp~1#1.base, main_~#irp~1#1.offset, main_~we_should_unload~0#1, main_~__BLAST_NONDET___0~0#1, main_~irp_choice~0#1, main_~#devobj~0#1.base, main_~#devobj~0#1.offset;havoc main_~d~0#1.Type, main_~d~0#1.Size, main_~d~0#1.DeviceObject.base, main_~d~0#1.DeviceObject.offset, main_~d~0#1.Flags, main_~d~0#1.DriverStart.base, main_~d~0#1.DriverStart.offset, main_~d~0#1.DriverSize, main_~d~0#1.DriverSection.base, main_~d~0#1.DriverSection.offset, main_~d~0#1.DriverExtension.base, main_~d~0#1.DriverExtension.offset, main_~d~0#1.DriverName.Length, main_~d~0#1.DriverName.MaximumLength, main_~d~0#1.DriverName.Buffer.base, main_~d~0#1.DriverName.Buffer.offset, main_~d~0#1.HardwareDatabase.base, main_~d~0#1.HardwareDatabase.offset, main_~d~0#1.FastIoDispatch.base, main_~d~0#1.FastIoDispatch.offset, main_~d~0#1.DriverInit.base, main_~d~0#1.DriverInit.offset, main_~d~0#1.DriverStartIo.base, main_~d~0#1.DriverStartIo.offset, main_~d~0#1.DriverUnload.base, main_~d~0#1.DriverUnload.offset, main_~d~0#1.MajorFunction.base, main_~d~0#1.MajorFunction.offset;assume -2147483648 <= main_#t~nondet964#1 && main_#t~nondet964#1 <= 2147483647;main_~status~15#1 := main_#t~nondet964#1;havoc main_#t~nondet964#1;call main_~#irp~1#1.base, main_~#irp~1#1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= main_#t~nondet965#1 && main_#t~nondet965#1 <= 2147483647;main_~we_should_unload~0#1 := main_#t~nondet965#1;havoc main_#t~nondet965#1;assume -2147483648 <= main_#t~nondet966#1 && main_#t~nondet966#1 <= 2147483647;main_~__BLAST_NONDET___0~0#1 := main_#t~nondet966#1;havoc main_#t~nondet966#1;assume -2147483648 <= main_#t~nondet967#1 && main_#t~nondet967#1 <= 2147483647;main_~irp_choice~0#1 := main_#t~nondet967#1;havoc main_#t~nondet967#1;call main_~#devobj~0#1.base, main_~#devobj~0#1.offset := #Ultimate.allocOnStack(175);call main_#t~malloc968#1.base, main_#t~malloc968#1.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(main_#t~malloc968#1.base, main_#t~malloc968#1.offset, main_~#devobj~0#1.base, 40 + main_~#devobj~0#1.offset, 4);havoc main_#t~malloc968#1.base, main_#t~malloc968#1.offset;call main_#t~malloc969#1.base, main_#t~malloc969#1.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(main_#t~malloc969#1.base, main_#t~malloc969#1.offset, main_~#irp~1#1.base, 96 + main_~#irp~1#1.offset, 4);havoc main_#t~malloc969#1.base, main_#t~malloc969#1.offset;call main_#t~mem970#1.base, main_#t~mem970#1.offset := read~$Pointer$(main_~#irp~1#1.base, 96 + main_~#irp~1#1.offset, 4);call write~$Pointer$(main_#t~mem970#1.base, 108 + main_#t~mem970#1.offset, main_~#irp~1#1.base, 96 + main_~#irp~1#1.offset, 4);havoc main_#t~mem970#1.base, main_#t~mem970#1.offset;call main_#t~malloc971#1.base, main_#t~malloc971#1.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(main_#t~malloc971#1.base, main_#t~malloc971#1.offset, main_~#irp~1#1.base, 12 + main_~#irp~1#1.offset, 4);havoc main_#t~malloc971#1.base, main_#t~malloc971#1.offset;~pirp~0.base, ~pirp~0.offset := main_~#irp~1#1.base, main_~#irp~1#1.offset;assume { :begin_inline__BLAST_init } true;~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; {622#(= ~s~0 ~UNLOADED~0)} is VALID [2022-02-20 14:40:17,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#(= ~s~0 ~UNLOADED~0)} assume { :end_inline__BLAST_init } true; {622#(= ~s~0 ~UNLOADED~0)} is VALID [2022-02-20 14:40:17,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {622#(= ~s~0 ~UNLOADED~0)} assume !(main_~status~15#1 >= 0); {622#(= ~s~0 ~UNLOADED~0)} is VALID [2022-02-20 14:40:17,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {622#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {622#(= ~s~0 ~UNLOADED~0)} is VALID [2022-02-20 14:40:17,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {622#(= ~s~0 ~UNLOADED~0)} is VALID [2022-02-20 14:40:17,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {622#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {621#false} is VALID [2022-02-20 14:40:17,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#false} assume !(-1 == main_~status~15#1); {621#false} is VALID [2022-02-20 14:40:17,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#false} assume !(~s~0 != ~SKIP2~0); {621#false} is VALID [2022-02-20 14:40:17,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {621#false} assume 1 == ~pended~0; {621#false} is VALID [2022-02-20 14:40:17,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {621#false} assume 259 != main_~status~15#1; {621#false} is VALID [2022-02-20 14:40:17,659 INFO L272 TraceCheckUtils]: 11: Hoare triple {621#false} call errorFn(); {621#false} is VALID [2022-02-20 14:40:17,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-02-20 14:40:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:40:17,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:17,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542766080] [2022-02-20 14:40:17,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542766080] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:17,661 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:17,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:17,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230058016] [2022-02-20 14:40:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:17,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:40:17,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:17,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:17,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:17,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:17,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:17,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:17,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:17,720 INFO L87 Difference]: Start difference. First operand has 617 states, 483 states have (on average 1.525879917184265) internal successors, (737), 502 states have internal predecessors, (737), 113 states have call successors, (113), 19 states have call predecessors, (113), 19 states have return successors, (113), 108 states have call predecessors, (113), 113 states have call successors, (113) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:34,348 INFO L93 Difference]: Finished difference Result 1094 states and 1737 transitions. [2022-02-20 14:40:34,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:34,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:40:34,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:34,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1737 transitions. [2022-02-20 14:40:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1737 transitions. [2022-02-20 14:40:34,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1737 transitions. [2022-02-20 14:40:36,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1737 edges. 1737 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:36,110 INFO L225 Difference]: With dead ends: 1094 [2022-02-20 14:40:36,110 INFO L226 Difference]: Without dead ends: 610 [2022-02-20 14:40:36,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:36,122 INFO L933 BasicCegarLoop]: 928 mSDtfsCounter, 8 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:36,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1807 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:40:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-02-20 14:40:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2022-02-20 14:40:36,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:36,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 610 states. Second operand has 610 states, 478 states have (on average 1.4832635983263598) internal successors, (709), 495 states have internal predecessors, (709), 113 states have call successors, (113), 19 states have call predecessors, (113), 18 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-02-20 14:40:36,212 INFO L74 IsIncluded]: Start isIncluded. First operand 610 states. Second operand has 610 states, 478 states have (on average 1.4832635983263598) internal successors, (709), 495 states have internal predecessors, (709), 113 states have call successors, (113), 19 states have call predecessors, (113), 18 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-02-20 14:40:36,219 INFO L87 Difference]: Start difference. First operand 610 states. Second operand has 610 states, 478 states have (on average 1.4832635983263598) internal successors, (709), 495 states have internal predecessors, (709), 113 states have call successors, (113), 19 states have call predecessors, (113), 18 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-02-20 14:40:36,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:36,262 INFO L93 Difference]: Finished difference Result 610 states and 919 transitions. [2022-02-20 14:40:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 919 transitions. [2022-02-20 14:40:36,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:36,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:36,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 610 states, 478 states have (on average 1.4832635983263598) internal successors, (709), 495 states have internal predecessors, (709), 113 states have call successors, (113), 19 states have call predecessors, (113), 18 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) Second operand 610 states. [2022-02-20 14:40:36,282 INFO L87 Difference]: Start difference. First operand has 610 states, 478 states have (on average 1.4832635983263598) internal successors, (709), 495 states have internal predecessors, (709), 113 states have call successors, (113), 19 states have call predecessors, (113), 18 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) Second operand 610 states. [2022-02-20 14:40:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:36,315 INFO L93 Difference]: Finished difference Result 610 states and 919 transitions. [2022-02-20 14:40:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 919 transitions. [2022-02-20 14:40:36,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:36,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:36,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:36,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 478 states have (on average 1.4832635983263598) internal successors, (709), 495 states have internal predecessors, (709), 113 states have call successors, (113), 19 states have call predecessors, (113), 18 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-02-20 14:40:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 919 transitions. [2022-02-20 14:40:36,358 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 919 transitions. Word has length 13 [2022-02-20 14:40:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:36,359 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 919 transitions. [2022-02-20 14:40:36,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 919 transitions. [2022-02-20 14:40:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:40:36,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:36,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:36,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:40:36,365 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:36,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:36,366 INFO L85 PathProgramCache]: Analyzing trace with hash 503268838, now seen corresponding path program 1 times [2022-02-20 14:40:36,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:36,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469541626] [2022-02-20 14:40:36,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:36,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:36,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {4103#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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);~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; {4103#true} is VALID [2022-02-20 14:40:36,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {4103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet964#1, main_#t~nondet965#1, main_#t~nondet966#1, main_#t~nondet967#1, main_#t~malloc968#1.base, main_#t~malloc968#1.offset, main_#t~malloc969#1.base, main_#t~malloc969#1.offset, main_#t~mem970#1.base, main_#t~mem970#1.offset, main_#t~malloc971#1.base, main_#t~malloc971#1.offset, main_#t~ret972#1, main_#t~ret973#1, main_#t~ret974#1, main_~d~0#1.Type, main_~d~0#1.Size, main_~d~0#1.DeviceObject.base, main_~d~0#1.DeviceObject.offset, main_~d~0#1.Flags, main_~d~0#1.DriverStart.base, main_~d~0#1.DriverStart.offset, main_~d~0#1.DriverSize, main_~d~0#1.DriverSection.base, main_~d~0#1.DriverSection.offset, main_~d~0#1.DriverExtension.base, main_~d~0#1.DriverExtension.offset, main_~d~0#1.DriverName.Length, main_~d~0#1.DriverName.MaximumLength, main_~d~0#1.DriverName.Buffer.base, main_~d~0#1.DriverName.Buffer.offset, main_~d~0#1.HardwareDatabase.base, main_~d~0#1.HardwareDatabase.offset, main_~d~0#1.FastIoDispatch.base, main_~d~0#1.FastIoDispatch.offset, main_~d~0#1.DriverInit.base, main_~d~0#1.DriverInit.offset, main_~d~0#1.DriverStartIo.base, main_~d~0#1.DriverStartIo.offset, main_~d~0#1.DriverUnload.base, main_~d~0#1.DriverUnload.offset, main_~d~0#1.MajorFunction.base, main_~d~0#1.MajorFunction.offset, main_~status~15#1, main_~#irp~1#1.base, main_~#irp~1#1.offset, main_~we_should_unload~0#1, main_~__BLAST_NONDET___0~0#1, main_~irp_choice~0#1, main_~#devobj~0#1.base, main_~#devobj~0#1.offset;havoc main_~d~0#1.Type, main_~d~0#1.Size, main_~d~0#1.DeviceObject.base, main_~d~0#1.DeviceObject.offset, main_~d~0#1.Flags, main_~d~0#1.DriverStart.base, main_~d~0#1.DriverStart.offset, main_~d~0#1.DriverSize, main_~d~0#1.DriverSection.base, main_~d~0#1.DriverSection.offset, main_~d~0#1.DriverExtension.base, main_~d~0#1.DriverExtension.offset, main_~d~0#1.DriverName.Length, main_~d~0#1.DriverName.MaximumLength, main_~d~0#1.DriverName.Buffer.base, main_~d~0#1.DriverName.Buffer.offset, main_~d~0#1.HardwareDatabase.base, main_~d~0#1.HardwareDatabase.offset, main_~d~0#1.FastIoDispatch.base, main_~d~0#1.FastIoDispatch.offset, main_~d~0#1.DriverInit.base, main_~d~0#1.DriverInit.offset, main_~d~0#1.DriverStartIo.base, main_~d~0#1.DriverStartIo.offset, main_~d~0#1.DriverUnload.base, main_~d~0#1.DriverUnload.offset, main_~d~0#1.MajorFunction.base, main_~d~0#1.MajorFunction.offset;assume -2147483648 <= main_#t~nondet964#1 && main_#t~nondet964#1 <= 2147483647;main_~status~15#1 := main_#t~nondet964#1;havoc main_#t~nondet964#1;call main_~#irp~1#1.base, main_~#irp~1#1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= main_#t~nondet965#1 && main_#t~nondet965#1 <= 2147483647;main_~we_should_unload~0#1 := main_#t~nondet965#1;havoc main_#t~nondet965#1;assume -2147483648 <= main_#t~nondet966#1 && main_#t~nondet966#1 <= 2147483647;main_~__BLAST_NONDET___0~0#1 := main_#t~nondet966#1;havoc main_#t~nondet966#1;assume -2147483648 <= main_#t~nondet967#1 && main_#t~nondet967#1 <= 2147483647;main_~irp_choice~0#1 := main_#t~nondet967#1;havoc main_#t~nondet967#1;call main_~#devobj~0#1.base, main_~#devobj~0#1.offset := #Ultimate.allocOnStack(175);call main_#t~malloc968#1.base, main_#t~malloc968#1.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(main_#t~malloc968#1.base, main_#t~malloc968#1.offset, main_~#devobj~0#1.base, 40 + main_~#devobj~0#1.offset, 4);havoc main_#t~malloc968#1.base, main_#t~malloc968#1.offset;call main_#t~malloc969#1.base, main_#t~malloc969#1.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(main_#t~malloc969#1.base, main_#t~malloc969#1.offset, main_~#irp~1#1.base, 96 + main_~#irp~1#1.offset, 4);havoc main_#t~malloc969#1.base, main_#t~malloc969#1.offset;call main_#t~mem970#1.base, main_#t~mem970#1.offset := read~$Pointer$(main_~#irp~1#1.base, 96 + main_~#irp~1#1.offset, 4);call write~$Pointer$(main_#t~mem970#1.base, 108 + main_#t~mem970#1.offset, main_~#irp~1#1.base, 96 + main_~#irp~1#1.offset, 4);havoc main_#t~mem970#1.base, main_#t~mem970#1.offset;call main_#t~malloc971#1.base, main_#t~malloc971#1.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(main_#t~malloc971#1.base, main_#t~malloc971#1.offset, main_~#irp~1#1.base, 12 + main_~#irp~1#1.offset, 4);havoc main_#t~malloc971#1.base, main_#t~malloc971#1.offset;~pirp~0.base, ~pirp~0.offset := main_~#irp~1#1.base, main_~#irp~1#1.offset;assume { :begin_inline__BLAST_init } true;~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; {4103#true} is VALID [2022-02-20 14:40:36,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {4103#true} assume { :end_inline__BLAST_init } true; {4103#true} is VALID [2022-02-20 14:40:36,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {4103#true} assume main_~status~15#1 >= 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 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {4103#true} is VALID [2022-02-20 14:40:36,505 INFO L290 TraceCheckUtils]: 4: Hoare triple {4103#true} assume 0 == main_~irp_choice~0#1;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {4103#true} is VALID [2022-02-20 14:40:36,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {4103#true} assume { :begin_inline_stub_driver_init } true;~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 := ~compFptr~0.base + ~compFptr~0.offset; {4105#(= ~s~0 ~NP~0)} is VALID [2022-02-20 14:40:36,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {4105#(= ~s~0 ~NP~0)} assume { :end_inline_stub_driver_init } true; {4105#(= ~s~0 ~NP~0)} is VALID [2022-02-20 14:40:36,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {4105#(= ~s~0 ~NP~0)} assume !!(main_~status~15#1 >= 0); {4105#(= ~s~0 ~NP~0)} is VALID [2022-02-20 14:40:36,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {4105#(= ~s~0 ~NP~0)} assume !(2 == main_~__BLAST_NONDET___0~0#1); {4105#(= ~s~0 ~NP~0)} is VALID [2022-02-20 14:40:36,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {4105#(= ~s~0 ~NP~0)} assume !(3 == main_~__BLAST_NONDET___0~0#1); {4105#(= ~s~0 ~NP~0)} is VALID [2022-02-20 14:40:36,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {4105#(= ~s~0 ~NP~0)} assume 4 == main_~__BLAST_NONDET___0~0#1; {4105#(= ~s~0 ~NP~0)} is VALID [2022-02-20 14:40:36,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {4105#(= ~s~0 ~NP~0)} assume { :begin_inline_CdAudioPower } true;CdAudioPower_#in~DeviceObject#1.base, CdAudioPower_#in~DeviceObject#1.offset, CdAudioPower_#in~Irp#1.base, CdAudioPower_#in~Irp#1.offset := main_~#devobj~0#1.base, main_~#devobj~0#1.offset, ~pirp~0.base, ~pirp~0.offset;havoc CdAudioPower_#res#1;havoc CdAudioPower_#t~mem959#1, CdAudioPower_#t~mem960#1.base, CdAudioPower_#t~mem960#1.offset, CdAudioPower_#t~mem961#1.base, CdAudioPower_#t~mem961#1.offset, CdAudioPower_#t~mem962#1.base, CdAudioPower_#t~mem962#1.offset, CdAudioPower_#t~ret963#1, CdAudioPower_~DeviceObject#1.base, CdAudioPower_~DeviceObject#1.offset, CdAudioPower_~Irp#1.base, CdAudioPower_~Irp#1.offset, CdAudioPower_~deviceExtension~16#1.base, CdAudioPower_~deviceExtension~16#1.offset, CdAudioPower_~tmp~15#1;CdAudioPower_~DeviceObject#1.base, CdAudioPower_~DeviceObject#1.offset := CdAudioPower_#in~DeviceObject#1.base, CdAudioPower_#in~DeviceObject#1.offset;CdAudioPower_~Irp#1.base, CdAudioPower_~Irp#1.offset := CdAudioPower_#in~Irp#1.base, CdAudioPower_#in~Irp#1.offset;havoc CdAudioPower_~deviceExtension~16#1.base, CdAudioPower_~deviceExtension~16#1.offset;havoc CdAudioPower_~tmp~15#1; {4105#(= ~s~0 ~NP~0)} is VALID [2022-02-20 14:40:36,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {4105#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {4104#false} is VALID [2022-02-20 14:40:36,510 INFO L272 TraceCheckUtils]: 13: Hoare triple {4104#false} call errorFn(); {4104#false} is VALID [2022-02-20 14:40:36,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {4104#false} assume !false; {4104#false} is VALID [2022-02-20 14:40:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:40:36,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:36,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469541626] [2022-02-20 14:40:36,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469541626] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:36,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:36,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:36,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875011604] [2022-02-20 14:40:36,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:36,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:40:36,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:36,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:36,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:36,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:36,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:36,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:36,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:36,532 INFO L87 Difference]: Start difference. First operand 610 states and 919 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:50,442 INFO L93 Difference]: Finished difference Result 1141 states and 1702 transitions. [2022-02-20 14:40:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:50,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:40:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1702 transitions. [2022-02-20 14:40:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1702 transitions. [2022-02-20 14:40:50,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1702 transitions. [2022-02-20 14:40:51,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1702 edges. 1702 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:51,852 INFO L225 Difference]: With dead ends: 1141 [2022-02-20 14:40:51,853 INFO L226 Difference]: Without dead ends: 891 [2022-02-20 14:40:51,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:51,855 INFO L933 BasicCegarLoop]: 1241 mSDtfsCounter, 833 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:51,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [833 Valid, 1666 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:40:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-02-20 14:40:51,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 871. [2022-02-20 14:40:51,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:51,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 891 states. Second operand has 871 states, 696 states have (on average 1.4612068965517242) internal successors, (1017), 699 states have internal predecessors, (1017), 142 states have call successors, (142), 33 states have call predecessors, (142), 32 states have return successors, (146), 140 states have call predecessors, (146), 130 states have call successors, (146) [2022-02-20 14:40:51,913 INFO L74 IsIncluded]: Start isIncluded. First operand 891 states. Second operand has 871 states, 696 states have (on average 1.4612068965517242) internal successors, (1017), 699 states have internal predecessors, (1017), 142 states have call successors, (142), 33 states have call predecessors, (142), 32 states have return successors, (146), 140 states have call predecessors, (146), 130 states have call successors, (146) [2022-02-20 14:40:51,917 INFO L87 Difference]: Start difference. First operand 891 states. Second operand has 871 states, 696 states have (on average 1.4612068965517242) internal successors, (1017), 699 states have internal predecessors, (1017), 142 states have call successors, (142), 33 states have call predecessors, (142), 32 states have return successors, (146), 140 states have call predecessors, (146), 130 states have call successors, (146) [2022-02-20 14:40:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:51,964 INFO L93 Difference]: Finished difference Result 891 states and 1330 transitions. [2022-02-20 14:40:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1330 transitions. [2022-02-20 14:40:51,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:51,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:51,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 871 states, 696 states have (on average 1.4612068965517242) internal successors, (1017), 699 states have internal predecessors, (1017), 142 states have call successors, (142), 33 states have call predecessors, (142), 32 states have return successors, (146), 140 states have call predecessors, (146), 130 states have call successors, (146) Second operand 891 states. [2022-02-20 14:40:51,975 INFO L87 Difference]: Start difference. First operand has 871 states, 696 states have (on average 1.4612068965517242) internal successors, (1017), 699 states have internal predecessors, (1017), 142 states have call successors, (142), 33 states have call predecessors, (142), 32 states have return successors, (146), 140 states have call predecessors, (146), 130 states have call successors, (146) Second operand 891 states. [2022-02-20 14:40:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:52,025 INFO L93 Difference]: Finished difference Result 891 states and 1330 transitions. [2022-02-20 14:40:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1330 transitions. [2022-02-20 14:40:52,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:52,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:52,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:52,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 696 states have (on average 1.4612068965517242) internal successors, (1017), 699 states have internal predecessors, (1017), 142 states have call successors, (142), 33 states have call predecessors, (142), 32 states have return successors, (146), 140 states have call predecessors, (146), 130 states have call successors, (146) [2022-02-20 14:40:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1305 transitions. [2022-02-20 14:40:52,084 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1305 transitions. Word has length 15 [2022-02-20 14:40:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:52,084 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 1305 transitions. [2022-02-20 14:40:52,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1305 transitions. [2022-02-20 14:40:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:40:52,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:52,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:52,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:40:52,086 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash -485834161, now seen corresponding path program 1 times [2022-02-20 14:40:52,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:52,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925054808] [2022-02-20 14:40:52,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:52,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {8549#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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);~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; {8549#true} is VALID [2022-02-20 14:40:52,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {8549#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet964#1, main_#t~nondet965#1, main_#t~nondet966#1, main_#t~nondet967#1, main_#t~malloc968#1.base, main_#t~malloc968#1.offset, main_#t~malloc969#1.base, main_#t~malloc969#1.offset, main_#t~mem970#1.base, main_#t~mem970#1.offset, main_#t~malloc971#1.base, main_#t~malloc971#1.offset, main_#t~ret972#1, main_#t~ret973#1, main_#t~ret974#1, main_~d~0#1.Type, main_~d~0#1.Size, main_~d~0#1.DeviceObject.base, main_~d~0#1.DeviceObject.offset, main_~d~0#1.Flags, main_~d~0#1.DriverStart.base, main_~d~0#1.DriverStart.offset, main_~d~0#1.DriverSize, main_~d~0#1.DriverSection.base, main_~d~0#1.DriverSection.offset, main_~d~0#1.DriverExtension.base, main_~d~0#1.DriverExtension.offset, main_~d~0#1.DriverName.Length, main_~d~0#1.DriverName.MaximumLength, main_~d~0#1.DriverName.Buffer.base, main_~d~0#1.DriverName.Buffer.offset, main_~d~0#1.HardwareDatabase.base, main_~d~0#1.HardwareDatabase.offset, main_~d~0#1.FastIoDispatch.base, main_~d~0#1.FastIoDispatch.offset, main_~d~0#1.DriverInit.base, main_~d~0#1.DriverInit.offset, main_~d~0#1.DriverStartIo.base, main_~d~0#1.DriverStartIo.offset, main_~d~0#1.DriverUnload.base, main_~d~0#1.DriverUnload.offset, main_~d~0#1.MajorFunction.base, main_~d~0#1.MajorFunction.offset, main_~status~15#1, main_~#irp~1#1.base, main_~#irp~1#1.offset, main_~we_should_unload~0#1, main_~__BLAST_NONDET___0~0#1, main_~irp_choice~0#1, main_~#devobj~0#1.base, main_~#devobj~0#1.offset;havoc main_~d~0#1.Type, main_~d~0#1.Size, main_~d~0#1.DeviceObject.base, main_~d~0#1.DeviceObject.offset, main_~d~0#1.Flags, main_~d~0#1.DriverStart.base, main_~d~0#1.DriverStart.offset, main_~d~0#1.DriverSize, main_~d~0#1.DriverSection.base, main_~d~0#1.DriverSection.offset, main_~d~0#1.DriverExtension.base, main_~d~0#1.DriverExtension.offset, main_~d~0#1.DriverName.Length, main_~d~0#1.DriverName.MaximumLength, main_~d~0#1.DriverName.Buffer.base, main_~d~0#1.DriverName.Buffer.offset, main_~d~0#1.HardwareDatabase.base, main_~d~0#1.HardwareDatabase.offset, main_~d~0#1.FastIoDispatch.base, main_~d~0#1.FastIoDispatch.offset, main_~d~0#1.DriverInit.base, main_~d~0#1.DriverInit.offset, main_~d~0#1.DriverStartIo.base, main_~d~0#1.DriverStartIo.offset, main_~d~0#1.DriverUnload.base, main_~d~0#1.DriverUnload.offset, main_~d~0#1.MajorFunction.base, main_~d~0#1.MajorFunction.offset;assume -2147483648 <= main_#t~nondet964#1 && main_#t~nondet964#1 <= 2147483647;main_~status~15#1 := main_#t~nondet964#1;havoc main_#t~nondet964#1;call main_~#irp~1#1.base, main_~#irp~1#1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= main_#t~nondet965#1 && main_#t~nondet965#1 <= 2147483647;main_~we_should_unload~0#1 := main_#t~nondet965#1;havoc main_#t~nondet965#1;assume -2147483648 <= main_#t~nondet966#1 && main_#t~nondet966#1 <= 2147483647;main_~__BLAST_NONDET___0~0#1 := main_#t~nondet966#1;havoc main_#t~nondet966#1;assume -2147483648 <= main_#t~nondet967#1 && main_#t~nondet967#1 <= 2147483647;main_~irp_choice~0#1 := main_#t~nondet967#1;havoc main_#t~nondet967#1;call main_~#devobj~0#1.base, main_~#devobj~0#1.offset := #Ultimate.allocOnStack(175);call main_#t~malloc968#1.base, main_#t~malloc968#1.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(main_#t~malloc968#1.base, main_#t~malloc968#1.offset, main_~#devobj~0#1.base, 40 + main_~#devobj~0#1.offset, 4);havoc main_#t~malloc968#1.base, main_#t~malloc968#1.offset;call main_#t~malloc969#1.base, main_#t~malloc969#1.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(main_#t~malloc969#1.base, main_#t~malloc969#1.offset, main_~#irp~1#1.base, 96 + main_~#irp~1#1.offset, 4);havoc main_#t~malloc969#1.base, main_#t~malloc969#1.offset;call main_#t~mem970#1.base, main_#t~mem970#1.offset := read~$Pointer$(main_~#irp~1#1.base, 96 + main_~#irp~1#1.offset, 4);call write~$Pointer$(main_#t~mem970#1.base, 108 + main_#t~mem970#1.offset, main_~#irp~1#1.base, 96 + main_~#irp~1#1.offset, 4);havoc main_#t~mem970#1.base, main_#t~mem970#1.offset;call main_#t~malloc971#1.base, main_#t~malloc971#1.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(main_#t~malloc971#1.base, main_#t~malloc971#1.offset, main_~#irp~1#1.base, 12 + main_~#irp~1#1.offset, 4);havoc main_#t~malloc971#1.base, main_#t~malloc971#1.offset;~pirp~0.base, ~pirp~0.offset := main_~#irp~1#1.base, main_~#irp~1#1.offset;assume { :begin_inline__BLAST_init } true;~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; {8549#true} is VALID [2022-02-20 14:40:52,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {8549#true} assume { :end_inline__BLAST_init } true; {8549#true} is VALID [2022-02-20 14:40:52,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {8549#true} assume main_~status~15#1 >= 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 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {8549#true} is VALID [2022-02-20 14:40:52,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {8549#true} assume 0 == main_~irp_choice~0#1;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {8549#true} is VALID [2022-02-20 14:40:52,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {8549#true} assume { :begin_inline_stub_driver_init } true;~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 := ~compFptr~0.base + ~compFptr~0.offset; {8549#true} is VALID [2022-02-20 14:40:52,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {8549#true} assume { :end_inline_stub_driver_init } true; {8549#true} is VALID [2022-02-20 14:40:52,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {8549#true} assume !!(main_~status~15#1 >= 0); {8549#true} is VALID [2022-02-20 14:40:52,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {8549#true} assume !(2 == main_~__BLAST_NONDET___0~0#1); {8549#true} is VALID [2022-02-20 14:40:52,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {8549#true} assume 3 == main_~__BLAST_NONDET___0~0#1; {8549#true} is VALID [2022-02-20 14:40:52,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {8549#true} assume { :begin_inline_CdAudioPnp } true;CdAudioPnp_#in~DeviceObject#1.base, CdAudioPnp_#in~DeviceObject#1.offset, CdAudioPnp_#in~Irp#1.base, CdAudioPnp_#in~Irp#1.offset := main_~#devobj~0#1.base, main_~#devobj~0#1.offset, ~pirp~0.base, ~pirp~0.offset;havoc CdAudioPnp_#res#1;havoc CdAudioPnp_#t~mem132#1.base, CdAudioPnp_#t~mem132#1.offset, CdAudioPnp_#t~mem133#1, CdAudioPnp_#t~mem134#1, CdAudioPnp_#t~ret135#1, CdAudioPnp_#t~mem136#1, CdAudioPnp_#t~ret137#1, CdAudioPnp_#t~mem138#1.base, CdAudioPnp_#t~mem138#1.offset, CdAudioPnp_#t~ret139#1, CdAudioPnp_#t~mem140#1, CdAudioPnp_#t~mem141#1, CdAudioPnp_#t~mem142#1, CdAudioPnp_#t~mem143#1, CdAudioPnp_#t~ret144#1, CdAudioPnp_#t~mem145#1, CdAudioPnp_#t~ret146#1, CdAudioPnp_#t~ret147#1, CdAudioPnp_#t~mem148#1, CdAudioPnp_#t~mem149#1, CdAudioPnp_#t~mem150#1, CdAudioPnp_#t~mem151#1, CdAudioPnp_#t~ret152#1, CdAudioPnp_#t~ret153#1, CdAudioPnp_~DeviceObject#1.base, CdAudioPnp_~DeviceObject#1.offset, CdAudioPnp_~Irp#1.base, CdAudioPnp_~Irp#1.offset, CdAudioPnp_~irpSp~0#1.base, CdAudioPnp_~irpSp~0#1.offset, CdAudioPnp_~status~3#1, CdAudioPnp_~setPagable~0#1, CdAudioPnp_~deviceExtension~1#1.base, CdAudioPnp_~deviceExtension~1#1.offset, CdAudioPnp_~tmp~1#1, CdAudioPnp_~tmp___0~1#1;CdAudioPnp_~DeviceObject#1.base, CdAudioPnp_~DeviceObject#1.offset := CdAudioPnp_#in~DeviceObject#1.base, CdAudioPnp_#in~DeviceObject#1.offset;CdAudioPnp_~Irp#1.base, CdAudioPnp_~Irp#1.offset := CdAudioPnp_#in~Irp#1.base, CdAudioPnp_#in~Irp#1.offset;havoc CdAudioPnp_~irpSp~0#1.base, CdAudioPnp_~irpSp~0#1.offset;havoc CdAudioPnp_~status~3#1;havoc CdAudioPnp_~setPagable~0#1;havoc CdAudioPnp_~deviceExtension~1#1.base, CdAudioPnp_~deviceExtension~1#1.offset;havoc CdAudioPnp_~tmp~1#1;havoc CdAudioPnp_~tmp___0~1#1;call CdAudioPnp_#t~mem132#1.base, CdAudioPnp_#t~mem132#1.offset := read~$Pointer$(CdAudioPnp_~Irp#1.base, 96 + CdAudioPnp_~Irp#1.offset, 4);CdAudioPnp_~irpSp~0#1.base, CdAudioPnp_~irpSp~0#1.offset := CdAudioPnp_#t~mem132#1.base, CdAudioPnp_#t~mem132#1.offset;havoc CdAudioPnp_#t~mem132#1.base, CdAudioPnp_#t~mem132#1.offset;CdAudioPnp_~status~3#1 := -1073741637;call CdAudioPnp_#t~mem133#1 := read~int(CdAudioPnp_~irpSp~0#1.base, 1 + CdAudioPnp_~irpSp~0#1.offset, 1); {8549#true} is VALID [2022-02-20 14:40:52,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {8549#true} assume !(0 == CdAudioPnp_#t~mem133#1 % 256);havoc CdAudioPnp_#t~mem133#1;call CdAudioPnp_#t~mem134#1 := read~int(CdAudioPnp_~irpSp~0#1.base, 1 + CdAudioPnp_~irpSp~0#1.offset, 1); {8549#true} is VALID [2022-02-20 14:40:52,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {8549#true} assume 22 == CdAudioPnp_#t~mem134#1 % 256;havoc CdAudioPnp_#t~mem134#1; {8549#true} is VALID [2022-02-20 14:40:52,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {8549#true} call CdAudioPnp_#t~mem136#1 := read~int(CdAudioPnp_~irpSp~0#1.base, 8 + CdAudioPnp_~irpSp~0#1.offset, 4); {8549#true} is VALID [2022-02-20 14:40:52,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {8549#true} assume !(1 != CdAudioPnp_#t~mem136#1);havoc CdAudioPnp_#t~mem136#1;call CdAudioPnp_#t~mem138#1.base, CdAudioPnp_#t~mem138#1.offset := read~$Pointer$(CdAudioPnp_~DeviceObject#1.base, 40 + CdAudioPnp_~DeviceObject#1.offset, 4);CdAudioPnp_~deviceExtension~1#1.base, CdAudioPnp_~deviceExtension~1#1.offset := CdAudioPnp_#t~mem138#1.base, CdAudioPnp_#t~mem138#1.offset;havoc CdAudioPnp_#t~mem138#1.base, CdAudioPnp_#t~mem138#1.offset; {8549#true} is VALID [2022-02-20 14:40:52,193 INFO L272 TraceCheckUtils]: 15: Hoare triple {8549#true} call CdAudioPnp_#t~ret139#1 := KeWaitForSingleObject(CdAudioPnp_~deviceExtension~1#1.base, 16 + CdAudioPnp_~deviceExtension~1#1.offset, 0, 0, 0, 0, 0); {8549#true} is VALID [2022-02-20 14:40:52,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {8549#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~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet999;havoc #t~nondet999; {8549#true} is VALID [2022-02-20 14:40:52,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {8549#true} assume !(~s~0 == ~MPR3~0); {8551#(not (= ~MPR3~0 ~s~0))} is VALID [2022-02-20 14:40:52,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {8551#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {8551#(not (= ~MPR3~0 ~s~0))} is VALID [2022-02-20 14:40:52,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {8551#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {8550#false} is VALID [2022-02-20 14:40:52,196 INFO L272 TraceCheckUtils]: 20: Hoare triple {8550#false} call errorFn(); {8550#false} is VALID [2022-02-20 14:40:52,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {8550#false} assume !false; {8550#false} is VALID [2022-02-20 14:40:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:40:52,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:52,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925054808] [2022-02-20 14:40:52,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925054808] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:52,203 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:52,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:52,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613804409] [2022-02-20 14:40:52,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 14:40:52,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:52,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:52,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:52,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:52,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:52,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:52,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:52,224 INFO L87 Difference]: Start difference. First operand 871 states and 1305 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)