./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers/parport.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/parport.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 4ac544dc5b01c2e84192d57540176c08b809d66a678248491533d1421aab9cd9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:40:35,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:40:35,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:40:35,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:40:35,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:40:35,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:40:35,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:40:35,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:40:35,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:40:35,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:40:35,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:40:35,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:40:35,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:40:35,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:40:35,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:40:35,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:40:35,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:40:35,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:40:35,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:40:35,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:40:35,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:40:35,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:40:35,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:40:35,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:40:35,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:40:35,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:40:35,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:40:35,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:40:35,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:40:35,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:40:35,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:40:35,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:40:35,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:40:35,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:40:35,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:40:35,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:40:35,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:40:35,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:40:35,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:40:35,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:40:35,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:40:35,399 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:35,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:40:35,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:40:35,421 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:40:35,421 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:40:35,422 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:40:35,422 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:40:35,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:40:35,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:40:35,422 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:40:35,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:40:35,423 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:40:35,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:40:35,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:40:35,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:40:35,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:40:35,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:40:35,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:40:35,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:40:35,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:40:35,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:40:35,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:40:35,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:40:35,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:40:35,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:40:35,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:40:35,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:40:35,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:40:35,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:40:35,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:40:35,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:40:35,426 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:40:35,427 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:40:35,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:40:35,427 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 -> 4ac544dc5b01c2e84192d57540176c08b809d66a678248491533d1421aab9cd9 [2022-02-20 14:40:35,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:40:35,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:40:35,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:40:35,705 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:40:35,705 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:40:35,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers/parport.i.cil-2.c [2022-02-20 14:40:35,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f1d0b67/910ca3c2213148f18349f6dd8835f893/FLAGea4d7e9c2 [2022-02-20 14:40:36,376 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:40:36,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/parport.i.cil-2.c [2022-02-20 14:40:36,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f1d0b67/910ca3c2213148f18349f6dd8835f893/FLAGea4d7e9c2 [2022-02-20 14:40:36,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f1d0b67/910ca3c2213148f18349f6dd8835f893 [2022-02-20 14:40:36,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:40:36,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:40:36,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:40:36,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:40:36,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:40:36,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:40:36" (1/1) ... [2022-02-20 14:40:36,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2166054a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:36, skipping insertion in model container [2022-02-20 14:40:36,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:40:36" (1/1) ... [2022-02-20 14:40:36,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:40:36,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:40:37,388 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/parport.i.cil-2.c[86591,86604] [2022-02-20 14:40:37,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:40:38,011 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:40:38,083 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/parport.i.cil-2.c[86591,86604] [2022-02-20 14:40:38,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:40:38,339 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:40:38,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:38 WrapperNode [2022-02-20 14:40:38,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:40:38,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:40:38,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:40:38,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:40:38,346 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:38" (1/1) ... [2022-02-20 14:40:38,420 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:38" (1/1) ... [2022-02-20 14:40:38,570 INFO L137 Inliner]: procedures = 248, calls = 2334, calls flagged for inlining = 84, calls inlined = 64, statements flattened = 4784 [2022-02-20 14:40:38,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:40:38,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:40:38,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:40:38,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:40:38,611 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:38" (1/1) ... [2022-02-20 14:40:38,612 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:38" (1/1) ... [2022-02-20 14:40:38,659 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:38" (1/1) ... [2022-02-20 14:40:38,661 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:38" (1/1) ... [2022-02-20 14:40:38,853 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:38" (1/1) ... [2022-02-20 14:40:38,879 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:38" (1/1) ... [2022-02-20 14:40:38,898 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:38" (1/1) ... [2022-02-20 14:40:38,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:40:38,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:40:38,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:40:38,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:40:38,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:38" (1/1) ... [2022-02-20 14:40:38,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:40:38,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:40:38,980 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:38,987 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:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceRequirementsList [2022-02-20 14:40:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceRequirementsList [2022-02-20 14:40:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLock [2022-02-20 14:40:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLock [2022-02-20 14:40:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure WRITE_PORT_UCHAR [2022-02-20 14:40:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure WRITE_PORT_UCHAR [2022-02-20 14:40:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockDiskModeByte [2022-02-20 14:40:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockDiskModeByte [2022-02-20 14:40:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2022-02-20 14:40:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2022-02-20 14:40:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 14:40:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 14:40:39,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearByteMode [2022-02-20 14:40:39,015 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearByteMode [2022-02-20 14:40:39,015 INFO L130 BoogieDeclarations]: Found specification of procedure KeStallExecutionProcessor [2022-02-20 14:40:39,015 INFO L138 BoogieDeclarations]: Found implementation of procedure KeStallExecutionProcessor [2022-02-20 14:40:39,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrSetMode [2022-02-20 14:40:39,015 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrSetMode [2022-02-20 14:40:39,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 14:40:39,015 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 14:40:39,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDecrement [2022-02-20 14:40:39,016 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDecrement [2022-02-20 14:40:39,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:40:39,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:40:39,016 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-02-20 14:40:39,016 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-02-20 14:40:39,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2022-02-20 14:40:39,017 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2022-02-20 14:40:39,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrClearMode [2022-02-20 14:40:39,017 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrClearMode [2022-02-20 14:40:39,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:40:39,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpRemovalRelationsList [2022-02-20 14:40:39,017 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpRemovalRelationsList [2022-02-20 14:40:39,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptLogError [2022-02-20 14:40:39,018 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLogError [2022-02-20 14:40:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 14:40:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpUnhandledIrp [2022-02-20 14:40:39,018 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpUnhandledIrp [2022-02-20 14:40:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterExistsNonIrqResourceList [2022-02-20 14:40:39,018 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterExistsNonIrqResourceList [2022-02-20 14:40:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsNecR98Machine [2022-02-20 14:40:39,018 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsNecR98Machine [2022-02-20 14:40:39,019 INFO L130 BoogieDeclarations]: Found specification of procedure CheckPort [2022-02-20 14:40:39,019 INFO L138 BoogieDeclarations]: Found implementation of procedure CheckPort [2022-02-20 14:40:39,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:40:39,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 14:40:39,019 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipSetDiskMode [2022-02-20 14:40:39,019 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipSetDiskMode [2022-02-20 14:40:39,019 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectLegacyZip [2022-02-20 14:40:39,020 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectLegacyZip [2022-02-20 14:40:39,020 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectDevice [2022-02-20 14:40:39,020 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectDevice [2022-02-20 14:40:39,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-02-20 14:40:39,020 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-02-20 14:40:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure PptDisconnectInterrupt [2022-02-20 14:40:39,021 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDisconnectInterrupt [2022-02-20 14:40:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-02-20 14:40:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-02-20 14:40:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBounceAndCatchPnpIrp [2022-02-20 14:40:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBounceAndCatchPnpIrp [2022-02-20 14:40:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 14:40:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTickCount [2022-02-20 14:40:39,023 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTickCount [2022-02-20 14:40:39,023 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-02-20 14:40:39,023 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-02-20 14:40:39,023 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTimeIncrement [2022-02-20 14:40:39,023 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTimeIncrement [2022-02-20 14:40:39,023 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedIncrement [2022-02-20 14:40:39,023 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedIncrement [2022-02-20 14:40:39,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 14:40:39,023 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchCompletionRoutine [2022-02-20 14:40:39,024 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchCompletionRoutine [2022-02-20 14:40:39,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:40:39,024 INFO L130 BoogieDeclarations]: Found specification of procedure IoReportResourceUsage [2022-02-20 14:40:39,024 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReportResourceUsage [2022-02-20 14:40:39,024 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitiate1284_3 [2022-02-20 14:40:39,024 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitiate1284_3 [2022-02-20 14:40:39,024 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterRemoveIrqResourceLists [2022-02-20 14:40:39,024 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterRemoveIrqResourceLists [2022-02-20 14:40:39,024 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCleanup [2022-02-20 14:40:39,025 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCleanup [2022-02-20 14:40:39,025 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-02-20 14:40:39,025 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-02-20 14:40:39,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 14:40:39,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 14:40:39,025 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareUnicodeString [2022-02-20 14:40:39,025 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareUnicodeString [2022-02-20 14:40:39,025 INFO L130 BoogieDeclarations]: Found specification of procedure READ_PORT_UCHAR [2022-02-20 14:40:39,026 INFO L138 BoogieDeclarations]: Found implementation of procedure READ_PORT_UCHAR [2022-02-20 14:40:39,026 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePort [2022-02-20 14:40:39,026 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePort [2022-02-20 14:40:39,026 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEcpPort [2022-02-20 14:40:39,026 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEcpPort [2022-02-20 14:40:39,027 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-02-20 14:40:39,027 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-02-20 14:40:39,027 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2022-02-20 14:40:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2022-02-20 14:40:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:40:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectLegacyZip [2022-02-20 14:40:39,028 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectLegacyZip [2022-02-20 14:40:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetCancelRoutine [2022-02-20 14:40:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetCancelRoutine [2022-02-20 14:40:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectDevice [2022-02-20 14:40:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectDevice [2022-02-20 14:40:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:40:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectBytePort [2022-02-20 14:40:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectBytePort [2022-02-20 14:40:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLock [2022-02-20 14:40:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLock [2022-02-20 14:40:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:40:39,030 INFO L130 BoogieDeclarations]: Found specification of procedure PptPowerComplete [2022-02-20 14:40:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPowerComplete [2022-02-20 14:40:39,030 INFO L130 BoogieDeclarations]: Found specification of procedure PptFailRequest [2022-02-20 14:40:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFailRequest [2022-02-20 14:40:39,030 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireRemoveLockEx [2022-02-20 14:40:39,031 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireRemoveLockEx [2022-02-20 14:40:39,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 14:40:39,033 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-02-20 14:40:39,033 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-02-20 14:40:39,033 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetByteMode [2022-02-20 14:40:39,033 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetByteMode [2022-02-20 14:40:39,034 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockPrtModeByte [2022-02-20 14:40:39,035 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockPrtModeByte [2022-02-20 14:40:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPort [2022-02-20 14:40:39,035 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPort [2022-02-20 14:40:39,035 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoWidth [2022-02-20 14:40:39,043 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoWidth [2022-02-20 14:40:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure PptSend1284_3Command [2022-02-20 14:40:39,043 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSend1284_3Command [2022-02-20 14:40:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoDepth [2022-02-20 14:40:39,043 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoDepth [2022-02-20 14:40:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure PptCompleteRequest [2022-02-20 14:40:39,043 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCompleteRequest [2022-02-20 14:40:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-02-20 14:40:39,043 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-02-20 14:40:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-02-20 14:40:39,043 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-02-20 14:40:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure PoRequestPowerIrp [2022-02-20 14:40:39,043 INFO L138 BoogieDeclarations]: Found implementation of procedure PoRequestPowerIrp [2022-02-20 14:40:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure KeSynchronizeExecution [2022-02-20 14:40:39,044 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSynchronizeExecution [2022-02-20 14:40:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLockOrFailIrp [2022-02-20 14:40:39,044 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLockOrFailIrp [2022-02-20 14:40:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2022-02-20 14:40:39,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2022-02-20 14:40:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:40:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure PoSetPowerState [2022-02-20 14:40:39,044 INFO L138 BoogieDeclarations]: Found implementation of procedure PoSetPowerState [2022-02-20 14:40:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure Ppt1284_3AssignAddress [2022-02-20 14:40:39,044 INFO L138 BoogieDeclarations]: Found implementation of procedure Ppt1284_3AssignAddress [2022-02-20 14:40:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2022-02-20 14:40:39,044 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2022-02-20 14:40:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-02-20 14:40:39,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-02-20 14:40:39,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:40:39,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:40:39,577 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:40:39,579 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:40:39,636 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:39,672 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-02-20 14:40:39,672 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-02-20 14:40:39,677 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:39,737 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-02-20 14:40:39,737 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-02-20 14:40:40,207 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:40,250 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-02-20 14:40:40,250 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-02-20 14:40:40,657 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:40,661 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-20 14:40:40,661 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-20 14:40:40,746 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:40,768 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-02-20 14:40:40,768 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-02-20 14:40:40,899 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:40,905 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-20 14:40:40,906 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-20 14:40:40,907 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:40,925 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-02-20 14:40:40,926 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-02-20 14:40:40,926 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:40,972 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-02-20 14:40:40,972 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-02-20 14:40:41,264 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:41,265 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:41,265 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:41,266 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:41,266 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:41,267 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:41,271 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:41,272 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:41,274 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:41,275 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:41,276 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:41,277 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##386: assume false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##387: assume !false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##425: assume !false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##424: assume false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume !false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##488: assume false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##533: assume !false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##532: assume false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##543: assume !false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##542: assume false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##99: assume false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume !false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##74: assume false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !false; [2022-02-20 14:40:48,055 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume false; [2022-02-20 14:40:48,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !false; [2022-02-20 14:40:48,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume false; [2022-02-20 14:40:48,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume !false; [2022-02-20 14:40:48,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##136: assume false; [2022-02-20 14:40:48,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume false; [2022-02-20 14:40:48,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume !false; [2022-02-20 14:40:48,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##100: assume !false; [2022-02-20 14:40:48,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2022-02-20 14:40:48,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2022-02-20 14:40:48,113 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:40:48,127 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:40:48,127 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-02-20 14:40:48,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:40:48 BoogieIcfgContainer [2022-02-20 14:40:48,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:40:48,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:40:48,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:40:48,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:40:48,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:40:36" (1/3) ... [2022-02-20 14:40:48,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1a634f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:40:48, skipping insertion in model container [2022-02-20 14:40:48,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:40:38" (2/3) ... [2022-02-20 14:40:48,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1a634f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:40:48, skipping insertion in model container [2022-02-20 14:40:48,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:40:48" (3/3) ... [2022-02-20 14:40:48,137 INFO L111 eAbstractionObserver]: Analyzing ICFG parport.i.cil-2.c [2022-02-20 14:40:48,140 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:40:48,141 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:40:48,187 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:40:48,192 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:48,193 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:40:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 1779 states, 1254 states have (on average 1.4832535885167464) internal successors, (1860), 1303 states have internal predecessors, (1860), 453 states have call successors, (453), 70 states have call predecessors, (453), 70 states have return successors, (453), 440 states have call predecessors, (453), 453 states have call successors, (453) [2022-02-20 14:40:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:40:48,247 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:48,247 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:48,248 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:48,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:48,251 INFO L85 PathProgramCache]: Analyzing trace with hash -773300714, now seen corresponding path program 1 times [2022-02-20 14:40:48,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:48,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704279770] [2022-02-20 14:40:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:48,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:48,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {1782#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(41, 4);call #Ultimate.allocInit(41, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(41, 7);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(41, 9);call #Ultimate.allocInit(41, 10);call #Ultimate.allocInit(41, 11);call #Ultimate.allocInit(41, 12);call #Ultimate.allocInit(41, 13);call #Ultimate.allocInit(41, 14);call #Ultimate.allocInit(41, 15);call #Ultimate.allocInit(41, 16);call #Ultimate.allocInit(41, 17);call #Ultimate.allocInit(41, 18);call #Ultimate.allocInit(41, 19);call #Ultimate.allocInit(41, 20);call #Ultimate.allocInit(41, 21);call #Ultimate.allocInit(41, 22);call #Ultimate.allocInit(41, 23);call #Ultimate.allocInit(41, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(41, 26);call #Ultimate.allocInit(41, 27);call #Ultimate.allocInit(41, 28);call #Ultimate.allocInit(41, 29);call #Ultimate.allocInit(8, 30);call #Ultimate.allocInit(7, 31);call write~init~int(117, 31, 0, 1);call write~init~int(116, 31, 1, 1);call write~init~int(105, 31, 2, 1);call write~init~int(108, 31, 3, 1);call write~init~int(46, 31, 4, 1);call write~init~int(99, 31, 5, 1);call write~init~int(0, 31, 6, 1);~isFixed~0 := 0;~isWin98~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~routine~0 := 0;~#PnpIrpName~0.base, ~#PnpIrpName~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);call write~init~$Pointer$(4, 0, ~#PnpIrpName~0.base, ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(5, 0, ~#PnpIrpName~0.base, 4 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(6, 0, ~#PnpIrpName~0.base, 8 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(7, 0, ~#PnpIrpName~0.base, 12 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(8, 0, ~#PnpIrpName~0.base, 16 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(9, 0, ~#PnpIrpName~0.base, 20 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(10, 0, ~#PnpIrpName~0.base, 24 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(11, 0, ~#PnpIrpName~0.base, 28 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(12, 0, ~#PnpIrpName~0.base, 32 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(13, 0, ~#PnpIrpName~0.base, 36 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(14, 0, ~#PnpIrpName~0.base, 40 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(15, 0, ~#PnpIrpName~0.base, 44 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(16, 0, ~#PnpIrpName~0.base, 48 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(17, 0, ~#PnpIrpName~0.base, 52 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(18, 0, ~#PnpIrpName~0.base, 56 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(19, 0, ~#PnpIrpName~0.base, 60 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(20, 0, ~#PnpIrpName~0.base, 64 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(21, 0, ~#PnpIrpName~0.base, 68 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(22, 0, ~#PnpIrpName~0.base, 72 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(23, 0, ~#PnpIrpName~0.base, 76 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(24, 0, ~#PnpIrpName~0.base, 80 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(25, 0, ~#PnpIrpName~0.base, 84 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(26, 0, ~#PnpIrpName~0.base, 88 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(27, 0, ~#PnpIrpName~0.base, 92 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(28, 0, ~#PnpIrpName~0.base, 96 + ~#PnpIrpName~0.offset, 4);~#ModeQualifier___6~0.base, ~#ModeQualifier___6~0.offset := 33, 0;call #Ultimate.allocInit(7, 33);call write~init~int(170, ~#ModeQualifier___6~0.base, ~#ModeQualifier___6~0.offset, 1);call write~init~int(85, ~#ModeQualifier___6~0.base, 1 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(0, ~#ModeQualifier___6~0.base, 2 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(255, ~#ModeQualifier___6~0.base, 3 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(135, ~#ModeQualifier___6~0.base, 4 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(120, ~#ModeQualifier___6~0.base, 5 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(255, ~#ModeQualifier___6~0.base, 6 + ~#ModeQualifier___6~0.offset, 1);~Extension_FilterMode~0 := 0;~#GUID_PARALLEL_DEVICE~0.base, ~#GUID_PARALLEL_DEVICE~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~int(2549575408, ~#GUID_PARALLEL_DEVICE~0.base, ~#GUID_PARALLEL_DEVICE~0.offset, 4);call write~init~int(63619, ~#GUID_PARALLEL_DEVICE~0.base, 4 + ~#GUID_PARALLEL_DEVICE~0.offset, 2);call write~init~int(4560, ~#GUID_PARALLEL_DEVICE~0.base, 6 + ~#GUID_PARALLEL_DEVICE~0.offset, 2);call write~init~int(175, ~#GUID_PARALLEL_DEVICE~0.base, 8 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(31, ~#GUID_PARALLEL_DEVICE~0.base, 9 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 10 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 11 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(248, ~#GUID_PARALLEL_DEVICE~0.base, 12 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 13 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(132, ~#GUID_PARALLEL_DEVICE~0.base, 14 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(92, ~#GUID_PARALLEL_DEVICE~0.base, 15 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);~GUID_PARCLASS_DEVICE~0.Data1 := 2166343333;~GUID_PARCLASS_DEVICE~0.Data2 := 63272;~GUID_PARCLASS_DEVICE~0.Data3 := 4560;~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[0 := 165];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[1 := 55];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[2 := 0];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[3 := 0];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[4 := 248];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[5 := 117];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[6 := 62];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[7 := 209];~#PptDebugLevel~0.base, ~#PptDebugLevel~0.offset := 35, 0;call #Ultimate.allocInit(4, 35);call write~init~int(0, ~#PptDebugLevel~0.base, ~#PptDebugLevel~0.offset, 4);~#PptBreakOn~0.base, ~#PptBreakOn~0.offset := 36, 0;call #Ultimate.allocInit(4, 36);call write~init~int(0, ~#PptBreakOn~0.base, ~#PptBreakOn~0.offset, 4);~#RegistryPath~0.base, ~#RegistryPath~0.offset := 37, 0;call #Ultimate.allocInit(8, 37);call write~init~int(0, ~#RegistryPath~0.base, ~#RegistryPath~0.offset, 2);call write~init~int(0, ~#RegistryPath~0.base, 2 + ~#RegistryPath~0.offset, 2);call write~init~$Pointer$(0, 0, ~#RegistryPath~0.base, 4 + ~#RegistryPath~0.offset, 4);~PortInfoReferenceCount~0 := -1;~PortInfoMutex~0.base, ~PortInfoMutex~0.offset := 0, 0;~#PhysicalZero~0.base, ~#PhysicalZero~0.offset := 38, 0;call #Ultimate.allocInit(8, 38);call write~init~int(0, ~#PhysicalZero~0.base, ~#PhysicalZero~0.offset, 4);call write~init~int(0, ~#PhysicalZero~0.base, 4 + ~#PhysicalZero~0.offset, 4);~PptDot3Retries~0 := 5;~PptPnpDispatchFunctionTable~0.base, ~PptPnpDispatchFunctionTable~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~#LegacyZipModeQualifier___11~0.base, ~#LegacyZipModeQualifier___11~0.offset := 39, 0;call #Ultimate.allocInit(3, 39);call write~init~int(0, ~#LegacyZipModeQualifier___11~0.base, ~#LegacyZipModeQualifier___11~0.offset, 1);call write~init~int(60, ~#LegacyZipModeQualifier___11~0.base, 1 + ~#LegacyZipModeQualifier___11~0.offset, 1);call write~init~int(32, ~#LegacyZipModeQualifier___11~0.base, 2 + ~#LegacyZipModeQualifier___11~0.offset, 1);~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset := 40, 0;call #Ultimate.allocInit(16, 40);call write~init~int(1270573546, ~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset, 4);call write~init~int(26707, ~#PptWmiAllocFreeCountsGuid~0.base, 4 + ~#PptWmiAllocFreeCountsGuid~0.offset, 2);call write~init~int(4562, ~#PptWmiAllocFreeCountsGuid~0.base, 6 + ~#PptWmiAllocFreeCountsGuid~0.offset, 2);call write~init~int(142, ~#PptWmiAllocFreeCountsGuid~0.base, 8 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(206, ~#PptWmiAllocFreeCountsGuid~0.base, 9 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(0, ~#PptWmiAllocFreeCountsGuid~0.base, 10 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(192, ~#PptWmiAllocFreeCountsGuid~0.base, 11 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(79, ~#PptWmiAllocFreeCountsGuid~0.base, 12 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(142, ~#PptWmiAllocFreeCountsGuid~0.base, 13 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(244, ~#PptWmiAllocFreeCountsGuid~0.base, 14 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(129, ~#PptWmiAllocFreeCountsGuid~0.base, 15 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);~#PptWmiGuidList~0.base, ~#PptWmiGuidList~0.offset := 41, 0;call #Ultimate.allocInit(12, 41);call write~init~$Pointer$(~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset, ~#PptWmiGuidList~0.base, ~#PptWmiGuidList~0.offset, 4);call write~init~int(1, ~#PptWmiGuidList~0.base, 4 + ~#PptWmiGuidList~0.offset, 4);call write~init~int(0, ~#PptWmiGuidList~0.base, 8 + ~#PptWmiGuidList~0.offset, 4);~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1782#true} is VALID [2022-02-20 14:40:48,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {1782#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1096#1, main_#t~nondet1097#1, main_#t~nondet1098#1, main_#t~nondet1099#1, main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset, main_#t~nondet1101#1, main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset, main_#t~mem1104#1.base, main_#t~mem1104#1.offset, main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset, main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset, main_#t~mem1107#1.base, main_#t~mem1107#1.offset, main_#t~pre1103#1, main_~i~24#1, main_~l~0#1.base, main_~l~0#1.offset, main_#t~mem1108#1.base, main_#t~mem1108#1.offset, main_#t~ret1109#1, main_#t~ret1110#1, main_#t~ret1111#1, main_~#rl~0#1.base, main_~#rl~0#1.offset, main_#t~ret1112#1, main_#t~ret1113#1, main_#t~ret1114#1, main_#t~ret1115#1, main_#t~ret1116#1, main_~#d~0#1.base, main_~#d~0#1.offset, main_~status~31#1, main_~we_should_unload~0#1, main_~#irp~0#1.base, main_~#irp~0#1.offset, main_~__BLAST_NONDET~3#1, main_~irp_choice~0#1, main_~#devobj~0#1.base, main_~#devobj~0#1.offset, main_~e~0#1.base, main_~e~0#1.offset;call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(168);assume -2147483648 <= main_#t~nondet1096#1 && main_#t~nondet1096#1 <= 2147483647;main_~status~31#1 := main_#t~nondet1096#1;havoc main_#t~nondet1096#1;assume -2147483648 <= main_#t~nondet1097#1 && main_#t~nondet1097#1 <= 2147483647;main_~we_should_unload~0#1 := main_#t~nondet1097#1;havoc main_#t~nondet1097#1;call main_~#irp~0#1.base, main_~#irp~0#1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= main_#t~nondet1098#1 && main_#t~nondet1098#1 <= 2147483647;main_~__BLAST_NONDET~3#1 := main_#t~nondet1098#1;havoc main_#t~nondet1098#1;assume -2147483648 <= main_#t~nondet1099#1 && main_#t~nondet1099#1 <= 2147483647;main_~irp_choice~0#1 := main_#t~nondet1099#1;havoc main_#t~nondet1099#1;call main_~#devobj~0#1.base, main_~#devobj~0#1.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(main_~#devobj~0#1.base, main_~#devobj~0#1.offset, main_~#d~0#1.base, 4 + main_~#d~0#1.offset, 4);call main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset := #Ultimate.allocOnHeap(434);main_~e~0#1.base, main_~e~0#1.offset := main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset;havoc main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset;call write~$Pointer$(main_~e~0#1.base, main_~e~0#1.offset, main_~#devobj~0#1.base, 40 + main_~#devobj~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 28 + main_~e~0#1.offset, main_~e~0#1.base, 28 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 28 + main_~e~0#1.offset, main_~e~0#1.base, 32 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 196 + main_~e~0#1.offset, main_~e~0#1.base, 196 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 196 + main_~e~0#1.offset, main_~e~0#1.base, 200 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 36 + main_~e~0#1.offset, main_~e~0#1.base, 36 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 36 + main_~e~0#1.offset, main_~e~0#1.base, 40 + main_~e~0#1.offset, 4);assume -2147483648 <= main_#t~nondet1101#1 && main_#t~nondet1101#1 <= 2147483647;~s~0 := main_#t~nondet1101#1;havoc main_#t~nondet1101#1;call main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset, main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);havoc main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset;main_~i~24#1 := 0; {1784#(= |ULTIMATE.start_main_~i~24#1| 0)} is VALID [2022-02-20 14:40:48,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {1784#(= |ULTIMATE.start_main_~i~24#1| 0)} assume !(main_~i~24#1 < 4); {1783#false} is VALID [2022-02-20 14:40:48,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {1783#false} call main_#t~mem1108#1.base, main_#t~mem1108#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call write~$Pointer$(main_#t~mem1108#1.base, 108 + main_#t~mem1108#1.offset, main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);havoc main_#t~mem1108#1.base, main_#t~mem1108#1.offset;~pirp~0.base, ~pirp~0.offset := main_~#irp~0#1.base, main_~#irp~0#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; {1783#false} is VALID [2022-02-20 14:40:48,686 INFO L290 TraceCheckUtils]: 4: Hoare triple {1783#false} assume { :end_inline__BLAST_init } true; {1783#false} is VALID [2022-02-20 14:40:48,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {1783#false} assume !(main_~status~31#1 >= 0); {1783#false} is VALID [2022-02-20 14:40:48,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {1783#false} assume !(1 == ~pended~0); {1783#false} is VALID [2022-02-20 14:40:48,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {1783#false} assume !(1 == ~pended~0); {1783#false} is VALID [2022-02-20 14:40:48,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {1783#false} assume !(~s~0 == ~UNLOADED~0); {1783#false} is VALID [2022-02-20 14:40:48,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {1783#false} assume !(-1 == main_~status~31#1); {1783#false} is VALID [2022-02-20 14:40:48,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {1783#false} assume !(~s~0 != ~SKIP2~0); {1783#false} is VALID [2022-02-20 14:40:48,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {1783#false} assume 1 == ~pended~0; {1783#false} is VALID [2022-02-20 14:40:48,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {1783#false} assume 259 != main_~status~31#1; {1783#false} is VALID [2022-02-20 14:40:48,689 INFO L272 TraceCheckUtils]: 13: Hoare triple {1783#false} call errorFn(); {1783#false} is VALID [2022-02-20 14:40:48,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {1783#false} assume !false; {1783#false} is VALID [2022-02-20 14:40:48,690 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:48,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:48,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704279770] [2022-02-20 14:40:48,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704279770] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:48,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:48,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:48,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18873604] [2022-02-20 14:40:48,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:48,698 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:48,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:48,701 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:48,728 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:48,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:48,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:48,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:48,765 INFO L87 Difference]: Start difference. First operand has 1779 states, 1254 states have (on average 1.4832535885167464) internal successors, (1860), 1303 states have internal predecessors, (1860), 453 states have call successors, (453), 70 states have call predecessors, (453), 70 states have return successors, (453), 440 states have call predecessors, (453), 453 states have call successors, (453) 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:41:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:41:04,664 INFO L93 Difference]: Finished difference Result 3554 states and 5647 transitions. [2022-02-20 14:41:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:41:04,664 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:41:04,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:41:04,665 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:41:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5647 transitions. [2022-02-20 14:41:04,921 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:41:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5647 transitions. [2022-02-20 14:41:05,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5647 transitions. [2022-02-20 14:41:09,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5647 edges. 5647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:41:09,611 INFO L225 Difference]: With dead ends: 3554 [2022-02-20 14:41:09,611 INFO L226 Difference]: Without dead ends: 1774 [2022-02-20 14:41:09,624 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:41:09,628 INFO L933 BasicCegarLoop]: 2647 mSDtfsCounter, 1 mSDsluCounter, 2645 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5292 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:41:09,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 5292 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:41:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2022-02-20 14:41:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1773. [2022-02-20 14:41:09,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:41:09,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1774 states. Second operand has 1773 states, 1250 states have (on average 1.4) internal successors, (1750), 1297 states have internal predecessors, (1750), 453 states have call successors, (453), 70 states have call predecessors, (453), 69 states have return successors, (434), 426 states have call predecessors, (434), 434 states have call successors, (434) [2022-02-20 14:41:09,767 INFO L74 IsIncluded]: Start isIncluded. First operand 1774 states. Second operand has 1773 states, 1250 states have (on average 1.4) internal successors, (1750), 1297 states have internal predecessors, (1750), 453 states have call successors, (453), 70 states have call predecessors, (453), 69 states have return successors, (434), 426 states have call predecessors, (434), 434 states have call successors, (434) [2022-02-20 14:41:09,772 INFO L87 Difference]: Start difference. First operand 1774 states. Second operand has 1773 states, 1250 states have (on average 1.4) internal successors, (1750), 1297 states have internal predecessors, (1750), 453 states have call successors, (453), 70 states have call predecessors, (453), 69 states have return successors, (434), 426 states have call predecessors, (434), 434 states have call successors, (434) [2022-02-20 14:41:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:41:09,926 INFO L93 Difference]: Finished difference Result 1774 states and 2638 transitions. [2022-02-20 14:41:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2638 transitions. [2022-02-20 14:41:09,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:41:09,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:41:09,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 1773 states, 1250 states have (on average 1.4) internal successors, (1750), 1297 states have internal predecessors, (1750), 453 states have call successors, (453), 70 states have call predecessors, (453), 69 states have return successors, (434), 426 states have call predecessors, (434), 434 states have call successors, (434) Second operand 1774 states. [2022-02-20 14:41:09,945 INFO L87 Difference]: Start difference. First operand has 1773 states, 1250 states have (on average 1.4) internal successors, (1750), 1297 states have internal predecessors, (1750), 453 states have call successors, (453), 70 states have call predecessors, (453), 69 states have return successors, (434), 426 states have call predecessors, (434), 434 states have call successors, (434) Second operand 1774 states. [2022-02-20 14:41:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:41:10,070 INFO L93 Difference]: Finished difference Result 1774 states and 2638 transitions. [2022-02-20 14:41:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2638 transitions. [2022-02-20 14:41:10,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:41:10,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:41:10,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:41:10,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:41:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1250 states have (on average 1.4) internal successors, (1750), 1297 states have internal predecessors, (1750), 453 states have call successors, (453), 70 states have call predecessors, (453), 69 states have return successors, (434), 426 states have call predecessors, (434), 434 states have call successors, (434) [2022-02-20 14:41:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2637 transitions. [2022-02-20 14:41:10,254 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2637 transitions. Word has length 15 [2022-02-20 14:41:10,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:41:10,255 INFO L470 AbstractCegarLoop]: Abstraction has 1773 states and 2637 transitions. [2022-02-20 14:41:10,255 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:41:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2637 transitions. [2022-02-20 14:41:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:41:10,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:41:10,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:41:10,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:41:10,258 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:41:10,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:41:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash 971741108, now seen corresponding path program 1 times [2022-02-20 14:41:10,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:41:10,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998506415] [2022-02-20 14:41:10,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:41:10,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:41:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:41:10,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {12917#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(41, 4);call #Ultimate.allocInit(41, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(41, 7);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(41, 9);call #Ultimate.allocInit(41, 10);call #Ultimate.allocInit(41, 11);call #Ultimate.allocInit(41, 12);call #Ultimate.allocInit(41, 13);call #Ultimate.allocInit(41, 14);call #Ultimate.allocInit(41, 15);call #Ultimate.allocInit(41, 16);call #Ultimate.allocInit(41, 17);call #Ultimate.allocInit(41, 18);call #Ultimate.allocInit(41, 19);call #Ultimate.allocInit(41, 20);call #Ultimate.allocInit(41, 21);call #Ultimate.allocInit(41, 22);call #Ultimate.allocInit(41, 23);call #Ultimate.allocInit(41, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(41, 26);call #Ultimate.allocInit(41, 27);call #Ultimate.allocInit(41, 28);call #Ultimate.allocInit(41, 29);call #Ultimate.allocInit(8, 30);call #Ultimate.allocInit(7, 31);call write~init~int(117, 31, 0, 1);call write~init~int(116, 31, 1, 1);call write~init~int(105, 31, 2, 1);call write~init~int(108, 31, 3, 1);call write~init~int(46, 31, 4, 1);call write~init~int(99, 31, 5, 1);call write~init~int(0, 31, 6, 1);~isFixed~0 := 0;~isWin98~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~routine~0 := 0;~#PnpIrpName~0.base, ~#PnpIrpName~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);call write~init~$Pointer$(4, 0, ~#PnpIrpName~0.base, ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(5, 0, ~#PnpIrpName~0.base, 4 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(6, 0, ~#PnpIrpName~0.base, 8 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(7, 0, ~#PnpIrpName~0.base, 12 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(8, 0, ~#PnpIrpName~0.base, 16 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(9, 0, ~#PnpIrpName~0.base, 20 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(10, 0, ~#PnpIrpName~0.base, 24 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(11, 0, ~#PnpIrpName~0.base, 28 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(12, 0, ~#PnpIrpName~0.base, 32 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(13, 0, ~#PnpIrpName~0.base, 36 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(14, 0, ~#PnpIrpName~0.base, 40 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(15, 0, ~#PnpIrpName~0.base, 44 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(16, 0, ~#PnpIrpName~0.base, 48 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(17, 0, ~#PnpIrpName~0.base, 52 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(18, 0, ~#PnpIrpName~0.base, 56 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(19, 0, ~#PnpIrpName~0.base, 60 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(20, 0, ~#PnpIrpName~0.base, 64 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(21, 0, ~#PnpIrpName~0.base, 68 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(22, 0, ~#PnpIrpName~0.base, 72 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(23, 0, ~#PnpIrpName~0.base, 76 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(24, 0, ~#PnpIrpName~0.base, 80 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(25, 0, ~#PnpIrpName~0.base, 84 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(26, 0, ~#PnpIrpName~0.base, 88 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(27, 0, ~#PnpIrpName~0.base, 92 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(28, 0, ~#PnpIrpName~0.base, 96 + ~#PnpIrpName~0.offset, 4);~#ModeQualifier___6~0.base, ~#ModeQualifier___6~0.offset := 33, 0;call #Ultimate.allocInit(7, 33);call write~init~int(170, ~#ModeQualifier___6~0.base, ~#ModeQualifier___6~0.offset, 1);call write~init~int(85, ~#ModeQualifier___6~0.base, 1 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(0, ~#ModeQualifier___6~0.base, 2 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(255, ~#ModeQualifier___6~0.base, 3 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(135, ~#ModeQualifier___6~0.base, 4 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(120, ~#ModeQualifier___6~0.base, 5 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(255, ~#ModeQualifier___6~0.base, 6 + ~#ModeQualifier___6~0.offset, 1);~Extension_FilterMode~0 := 0;~#GUID_PARALLEL_DEVICE~0.base, ~#GUID_PARALLEL_DEVICE~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~int(2549575408, ~#GUID_PARALLEL_DEVICE~0.base, ~#GUID_PARALLEL_DEVICE~0.offset, 4);call write~init~int(63619, ~#GUID_PARALLEL_DEVICE~0.base, 4 + ~#GUID_PARALLEL_DEVICE~0.offset, 2);call write~init~int(4560, ~#GUID_PARALLEL_DEVICE~0.base, 6 + ~#GUID_PARALLEL_DEVICE~0.offset, 2);call write~init~int(175, ~#GUID_PARALLEL_DEVICE~0.base, 8 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(31, ~#GUID_PARALLEL_DEVICE~0.base, 9 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 10 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 11 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(248, ~#GUID_PARALLEL_DEVICE~0.base, 12 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 13 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(132, ~#GUID_PARALLEL_DEVICE~0.base, 14 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(92, ~#GUID_PARALLEL_DEVICE~0.base, 15 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);~GUID_PARCLASS_DEVICE~0.Data1 := 2166343333;~GUID_PARCLASS_DEVICE~0.Data2 := 63272;~GUID_PARCLASS_DEVICE~0.Data3 := 4560;~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[0 := 165];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[1 := 55];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[2 := 0];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[3 := 0];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[4 := 248];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[5 := 117];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[6 := 62];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[7 := 209];~#PptDebugLevel~0.base, ~#PptDebugLevel~0.offset := 35, 0;call #Ultimate.allocInit(4, 35);call write~init~int(0, ~#PptDebugLevel~0.base, ~#PptDebugLevel~0.offset, 4);~#PptBreakOn~0.base, ~#PptBreakOn~0.offset := 36, 0;call #Ultimate.allocInit(4, 36);call write~init~int(0, ~#PptBreakOn~0.base, ~#PptBreakOn~0.offset, 4);~#RegistryPath~0.base, ~#RegistryPath~0.offset := 37, 0;call #Ultimate.allocInit(8, 37);call write~init~int(0, ~#RegistryPath~0.base, ~#RegistryPath~0.offset, 2);call write~init~int(0, ~#RegistryPath~0.base, 2 + ~#RegistryPath~0.offset, 2);call write~init~$Pointer$(0, 0, ~#RegistryPath~0.base, 4 + ~#RegistryPath~0.offset, 4);~PortInfoReferenceCount~0 := -1;~PortInfoMutex~0.base, ~PortInfoMutex~0.offset := 0, 0;~#PhysicalZero~0.base, ~#PhysicalZero~0.offset := 38, 0;call #Ultimate.allocInit(8, 38);call write~init~int(0, ~#PhysicalZero~0.base, ~#PhysicalZero~0.offset, 4);call write~init~int(0, ~#PhysicalZero~0.base, 4 + ~#PhysicalZero~0.offset, 4);~PptDot3Retries~0 := 5;~PptPnpDispatchFunctionTable~0.base, ~PptPnpDispatchFunctionTable~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~#LegacyZipModeQualifier___11~0.base, ~#LegacyZipModeQualifier___11~0.offset := 39, 0;call #Ultimate.allocInit(3, 39);call write~init~int(0, ~#LegacyZipModeQualifier___11~0.base, ~#LegacyZipModeQualifier___11~0.offset, 1);call write~init~int(60, ~#LegacyZipModeQualifier___11~0.base, 1 + ~#LegacyZipModeQualifier___11~0.offset, 1);call write~init~int(32, ~#LegacyZipModeQualifier___11~0.base, 2 + ~#LegacyZipModeQualifier___11~0.offset, 1);~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset := 40, 0;call #Ultimate.allocInit(16, 40);call write~init~int(1270573546, ~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset, 4);call write~init~int(26707, ~#PptWmiAllocFreeCountsGuid~0.base, 4 + ~#PptWmiAllocFreeCountsGuid~0.offset, 2);call write~init~int(4562, ~#PptWmiAllocFreeCountsGuid~0.base, 6 + ~#PptWmiAllocFreeCountsGuid~0.offset, 2);call write~init~int(142, ~#PptWmiAllocFreeCountsGuid~0.base, 8 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(206, ~#PptWmiAllocFreeCountsGuid~0.base, 9 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(0, ~#PptWmiAllocFreeCountsGuid~0.base, 10 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(192, ~#PptWmiAllocFreeCountsGuid~0.base, 11 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(79, ~#PptWmiAllocFreeCountsGuid~0.base, 12 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(142, ~#PptWmiAllocFreeCountsGuid~0.base, 13 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(244, ~#PptWmiAllocFreeCountsGuid~0.base, 14 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(129, ~#PptWmiAllocFreeCountsGuid~0.base, 15 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);~#PptWmiGuidList~0.base, ~#PptWmiGuidList~0.offset := 41, 0;call #Ultimate.allocInit(12, 41);call write~init~$Pointer$(~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset, ~#PptWmiGuidList~0.base, ~#PptWmiGuidList~0.offset, 4);call write~init~int(1, ~#PptWmiGuidList~0.base, 4 + ~#PptWmiGuidList~0.offset, 4);call write~init~int(0, ~#PptWmiGuidList~0.base, 8 + ~#PptWmiGuidList~0.offset, 4);~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {12917#true} is VALID [2022-02-20 14:41:10,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {12917#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1096#1, main_#t~nondet1097#1, main_#t~nondet1098#1, main_#t~nondet1099#1, main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset, main_#t~nondet1101#1, main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset, main_#t~mem1104#1.base, main_#t~mem1104#1.offset, main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset, main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset, main_#t~mem1107#1.base, main_#t~mem1107#1.offset, main_#t~pre1103#1, main_~i~24#1, main_~l~0#1.base, main_~l~0#1.offset, main_#t~mem1108#1.base, main_#t~mem1108#1.offset, main_#t~ret1109#1, main_#t~ret1110#1, main_#t~ret1111#1, main_~#rl~0#1.base, main_~#rl~0#1.offset, main_#t~ret1112#1, main_#t~ret1113#1, main_#t~ret1114#1, main_#t~ret1115#1, main_#t~ret1116#1, main_~#d~0#1.base, main_~#d~0#1.offset, main_~status~31#1, main_~we_should_unload~0#1, main_~#irp~0#1.base, main_~#irp~0#1.offset, main_~__BLAST_NONDET~3#1, main_~irp_choice~0#1, main_~#devobj~0#1.base, main_~#devobj~0#1.offset, main_~e~0#1.base, main_~e~0#1.offset;call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(168);assume -2147483648 <= main_#t~nondet1096#1 && main_#t~nondet1096#1 <= 2147483647;main_~status~31#1 := main_#t~nondet1096#1;havoc main_#t~nondet1096#1;assume -2147483648 <= main_#t~nondet1097#1 && main_#t~nondet1097#1 <= 2147483647;main_~we_should_unload~0#1 := main_#t~nondet1097#1;havoc main_#t~nondet1097#1;call main_~#irp~0#1.base, main_~#irp~0#1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= main_#t~nondet1098#1 && main_#t~nondet1098#1 <= 2147483647;main_~__BLAST_NONDET~3#1 := main_#t~nondet1098#1;havoc main_#t~nondet1098#1;assume -2147483648 <= main_#t~nondet1099#1 && main_#t~nondet1099#1 <= 2147483647;main_~irp_choice~0#1 := main_#t~nondet1099#1;havoc main_#t~nondet1099#1;call main_~#devobj~0#1.base, main_~#devobj~0#1.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(main_~#devobj~0#1.base, main_~#devobj~0#1.offset, main_~#d~0#1.base, 4 + main_~#d~0#1.offset, 4);call main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset := #Ultimate.allocOnHeap(434);main_~e~0#1.base, main_~e~0#1.offset := main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset;havoc main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset;call write~$Pointer$(main_~e~0#1.base, main_~e~0#1.offset, main_~#devobj~0#1.base, 40 + main_~#devobj~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 28 + main_~e~0#1.offset, main_~e~0#1.base, 28 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 28 + main_~e~0#1.offset, main_~e~0#1.base, 32 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 196 + main_~e~0#1.offset, main_~e~0#1.base, 196 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 196 + main_~e~0#1.offset, main_~e~0#1.base, 200 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 36 + main_~e~0#1.offset, main_~e~0#1.base, 36 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 36 + main_~e~0#1.offset, main_~e~0#1.base, 40 + main_~e~0#1.offset, 4);assume -2147483648 <= main_#t~nondet1101#1 && main_#t~nondet1101#1 <= 2147483647;~s~0 := main_#t~nondet1101#1;havoc main_#t~nondet1101#1;call main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset, main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);havoc main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset;main_~i~24#1 := 0; {12919#(= |ULTIMATE.start_main_~i~24#1| 0)} is VALID [2022-02-20 14:41:10,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {12919#(= |ULTIMATE.start_main_~i~24#1| 0)} assume !!(main_~i~24#1 < 4);call main_#t~mem1104#1.base, main_#t~mem1104#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset := #Ultimate.allocOnHeap(72);call write~$Pointer$(main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset, main_#t~mem1104#1.base, 4 + (main_#t~mem1104#1.offset + 36 * main_~i~24#1), 4);havoc main_#t~mem1104#1.base, main_#t~mem1104#1.offset;havoc main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset;call main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset := #Ultimate.allocOnHeap(36);main_~l~0#1.base, main_~l~0#1.offset := main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset;havoc main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset;call write~int(1, main_~l~0#1.base, main_~l~0#1.offset, 4);call write~int(1, main_~l~0#1.base, 16 + main_~l~0#1.offset, 4);call main_#t~mem1107#1.base, main_#t~mem1107#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call write~$Pointer$(main_~l~0#1.base, main_~l~0#1.offset, main_#t~mem1107#1.base, 8 + (main_#t~mem1107#1.offset + 36 * main_~i~24#1), 4);havoc main_#t~mem1107#1.base, main_#t~mem1107#1.offset; {12919#(= |ULTIMATE.start_main_~i~24#1| 0)} is VALID [2022-02-20 14:41:10,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {12919#(= |ULTIMATE.start_main_~i~24#1| 0)} main_#t~pre1103#1 := 1 + main_~i~24#1;main_~i~24#1 := 1 + main_~i~24#1;havoc main_#t~pre1103#1; {12920#(<= |ULTIMATE.start_main_~i~24#1| 1)} is VALID [2022-02-20 14:41:10,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {12920#(<= |ULTIMATE.start_main_~i~24#1| 1)} assume !(main_~i~24#1 < 4); {12918#false} is VALID [2022-02-20 14:41:10,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {12918#false} call main_#t~mem1108#1.base, main_#t~mem1108#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call write~$Pointer$(main_#t~mem1108#1.base, 108 + main_#t~mem1108#1.offset, main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);havoc main_#t~mem1108#1.base, main_#t~mem1108#1.offset;~pirp~0.base, ~pirp~0.offset := main_~#irp~0#1.base, main_~#irp~0#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; {12918#false} is VALID [2022-02-20 14:41:10,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {12918#false} assume { :end_inline__BLAST_init } true; {12918#false} is VALID [2022-02-20 14:41:10,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {12918#false} assume !(main_~status~31#1 >= 0); {12918#false} is VALID [2022-02-20 14:41:10,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {12918#false} assume !(1 == ~pended~0); {12918#false} is VALID [2022-02-20 14:41:10,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {12918#false} assume !(1 == ~pended~0); {12918#false} is VALID [2022-02-20 14:41:10,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {12918#false} assume !(~s~0 == ~UNLOADED~0); {12918#false} is VALID [2022-02-20 14:41:10,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {12918#false} assume !(-1 == main_~status~31#1); {12918#false} is VALID [2022-02-20 14:41:10,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {12918#false} assume !(~s~0 != ~SKIP2~0); {12918#false} is VALID [2022-02-20 14:41:10,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {12918#false} assume 1 == ~pended~0; {12918#false} is VALID [2022-02-20 14:41:10,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {12918#false} assume 259 != main_~status~31#1; {12918#false} is VALID [2022-02-20 14:41:10,392 INFO L272 TraceCheckUtils]: 15: Hoare triple {12918#false} call errorFn(); {12918#false} is VALID [2022-02-20 14:41:10,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {12918#false} assume !false; {12918#false} is VALID [2022-02-20 14:41:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:41:10,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:41:10,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998506415] [2022-02-20 14:41:10,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998506415] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:41:10,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092864338] [2022-02-20 14:41:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:41:10,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:41:10,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:41:10,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:41:10,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:41:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:41:10,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:41:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:41:10,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:41:10,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {12917#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(41, 4);call #Ultimate.allocInit(41, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(41, 7);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(41, 9);call #Ultimate.allocInit(41, 10);call #Ultimate.allocInit(41, 11);call #Ultimate.allocInit(41, 12);call #Ultimate.allocInit(41, 13);call #Ultimate.allocInit(41, 14);call #Ultimate.allocInit(41, 15);call #Ultimate.allocInit(41, 16);call #Ultimate.allocInit(41, 17);call #Ultimate.allocInit(41, 18);call #Ultimate.allocInit(41, 19);call #Ultimate.allocInit(41, 20);call #Ultimate.allocInit(41, 21);call #Ultimate.allocInit(41, 22);call #Ultimate.allocInit(41, 23);call #Ultimate.allocInit(41, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(41, 26);call #Ultimate.allocInit(41, 27);call #Ultimate.allocInit(41, 28);call #Ultimate.allocInit(41, 29);call #Ultimate.allocInit(8, 30);call #Ultimate.allocInit(7, 31);call write~init~int(117, 31, 0, 1);call write~init~int(116, 31, 1, 1);call write~init~int(105, 31, 2, 1);call write~init~int(108, 31, 3, 1);call write~init~int(46, 31, 4, 1);call write~init~int(99, 31, 5, 1);call write~init~int(0, 31, 6, 1);~isFixed~0 := 0;~isWin98~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~routine~0 := 0;~#PnpIrpName~0.base, ~#PnpIrpName~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);call write~init~$Pointer$(4, 0, ~#PnpIrpName~0.base, ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(5, 0, ~#PnpIrpName~0.base, 4 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(6, 0, ~#PnpIrpName~0.base, 8 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(7, 0, ~#PnpIrpName~0.base, 12 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(8, 0, ~#PnpIrpName~0.base, 16 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(9, 0, ~#PnpIrpName~0.base, 20 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(10, 0, ~#PnpIrpName~0.base, 24 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(11, 0, ~#PnpIrpName~0.base, 28 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(12, 0, ~#PnpIrpName~0.base, 32 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(13, 0, ~#PnpIrpName~0.base, 36 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(14, 0, ~#PnpIrpName~0.base, 40 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(15, 0, ~#PnpIrpName~0.base, 44 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(16, 0, ~#PnpIrpName~0.base, 48 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(17, 0, ~#PnpIrpName~0.base, 52 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(18, 0, ~#PnpIrpName~0.base, 56 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(19, 0, ~#PnpIrpName~0.base, 60 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(20, 0, ~#PnpIrpName~0.base, 64 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(21, 0, ~#PnpIrpName~0.base, 68 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(22, 0, ~#PnpIrpName~0.base, 72 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(23, 0, ~#PnpIrpName~0.base, 76 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(24, 0, ~#PnpIrpName~0.base, 80 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(25, 0, ~#PnpIrpName~0.base, 84 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(26, 0, ~#PnpIrpName~0.base, 88 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(27, 0, ~#PnpIrpName~0.base, 92 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(28, 0, ~#PnpIrpName~0.base, 96 + ~#PnpIrpName~0.offset, 4);~#ModeQualifier___6~0.base, ~#ModeQualifier___6~0.offset := 33, 0;call #Ultimate.allocInit(7, 33);call write~init~int(170, ~#ModeQualifier___6~0.base, ~#ModeQualifier___6~0.offset, 1);call write~init~int(85, ~#ModeQualifier___6~0.base, 1 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(0, ~#ModeQualifier___6~0.base, 2 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(255, ~#ModeQualifier___6~0.base, 3 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(135, ~#ModeQualifier___6~0.base, 4 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(120, ~#ModeQualifier___6~0.base, 5 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(255, ~#ModeQualifier___6~0.base, 6 + ~#ModeQualifier___6~0.offset, 1);~Extension_FilterMode~0 := 0;~#GUID_PARALLEL_DEVICE~0.base, ~#GUID_PARALLEL_DEVICE~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~int(2549575408, ~#GUID_PARALLEL_DEVICE~0.base, ~#GUID_PARALLEL_DEVICE~0.offset, 4);call write~init~int(63619, ~#GUID_PARALLEL_DEVICE~0.base, 4 + ~#GUID_PARALLEL_DEVICE~0.offset, 2);call write~init~int(4560, ~#GUID_PARALLEL_DEVICE~0.base, 6 + ~#GUID_PARALLEL_DEVICE~0.offset, 2);call write~init~int(175, ~#GUID_PARALLEL_DEVICE~0.base, 8 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(31, ~#GUID_PARALLEL_DEVICE~0.base, 9 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 10 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 11 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(248, ~#GUID_PARALLEL_DEVICE~0.base, 12 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 13 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(132, ~#GUID_PARALLEL_DEVICE~0.base, 14 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(92, ~#GUID_PARALLEL_DEVICE~0.base, 15 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);~GUID_PARCLASS_DEVICE~0.Data1 := 2166343333;~GUID_PARCLASS_DEVICE~0.Data2 := 63272;~GUID_PARCLASS_DEVICE~0.Data3 := 4560;~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[0 := 165];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[1 := 55];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[2 := 0];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[3 := 0];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[4 := 248];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[5 := 117];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[6 := 62];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[7 := 209];~#PptDebugLevel~0.base, ~#PptDebugLevel~0.offset := 35, 0;call #Ultimate.allocInit(4, 35);call write~init~int(0, ~#PptDebugLevel~0.base, ~#PptDebugLevel~0.offset, 4);~#PptBreakOn~0.base, ~#PptBreakOn~0.offset := 36, 0;call #Ultimate.allocInit(4, 36);call write~init~int(0, ~#PptBreakOn~0.base, ~#PptBreakOn~0.offset, 4);~#RegistryPath~0.base, ~#RegistryPath~0.offset := 37, 0;call #Ultimate.allocInit(8, 37);call write~init~int(0, ~#RegistryPath~0.base, ~#RegistryPath~0.offset, 2);call write~init~int(0, ~#RegistryPath~0.base, 2 + ~#RegistryPath~0.offset, 2);call write~init~$Pointer$(0, 0, ~#RegistryPath~0.base, 4 + ~#RegistryPath~0.offset, 4);~PortInfoReferenceCount~0 := -1;~PortInfoMutex~0.base, ~PortInfoMutex~0.offset := 0, 0;~#PhysicalZero~0.base, ~#PhysicalZero~0.offset := 38, 0;call #Ultimate.allocInit(8, 38);call write~init~int(0, ~#PhysicalZero~0.base, ~#PhysicalZero~0.offset, 4);call write~init~int(0, ~#PhysicalZero~0.base, 4 + ~#PhysicalZero~0.offset, 4);~PptDot3Retries~0 := 5;~PptPnpDispatchFunctionTable~0.base, ~PptPnpDispatchFunctionTable~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~#LegacyZipModeQualifier___11~0.base, ~#LegacyZipModeQualifier___11~0.offset := 39, 0;call #Ultimate.allocInit(3, 39);call write~init~int(0, ~#LegacyZipModeQualifier___11~0.base, ~#LegacyZipModeQualifier___11~0.offset, 1);call write~init~int(60, ~#LegacyZipModeQualifier___11~0.base, 1 + ~#LegacyZipModeQualifier___11~0.offset, 1);call write~init~int(32, ~#LegacyZipModeQualifier___11~0.base, 2 + ~#LegacyZipModeQualifier___11~0.offset, 1);~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset := 40, 0;call #Ultimate.allocInit(16, 40);call write~init~int(1270573546, ~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset, 4);call write~init~int(26707, ~#PptWmiAllocFreeCountsGuid~0.base, 4 + ~#PptWmiAllocFreeCountsGuid~0.offset, 2);call write~init~int(4562, ~#PptWmiAllocFreeCountsGuid~0.base, 6 + ~#PptWmiAllocFreeCountsGuid~0.offset, 2);call write~init~int(142, ~#PptWmiAllocFreeCountsGuid~0.base, 8 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(206, ~#PptWmiAllocFreeCountsGuid~0.base, 9 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(0, ~#PptWmiAllocFreeCountsGuid~0.base, 10 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(192, ~#PptWmiAllocFreeCountsGuid~0.base, 11 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(79, ~#PptWmiAllocFreeCountsGuid~0.base, 12 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(142, ~#PptWmiAllocFreeCountsGuid~0.base, 13 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(244, ~#PptWmiAllocFreeCountsGuid~0.base, 14 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(129, ~#PptWmiAllocFreeCountsGuid~0.base, 15 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);~#PptWmiGuidList~0.base, ~#PptWmiGuidList~0.offset := 41, 0;call #Ultimate.allocInit(12, 41);call write~init~$Pointer$(~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset, ~#PptWmiGuidList~0.base, ~#PptWmiGuidList~0.offset, 4);call write~init~int(1, ~#PptWmiGuidList~0.base, 4 + ~#PptWmiGuidList~0.offset, 4);call write~init~int(0, ~#PptWmiGuidList~0.base, 8 + ~#PptWmiGuidList~0.offset, 4);~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {12917#true} is VALID [2022-02-20 14:41:10,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {12917#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1096#1, main_#t~nondet1097#1, main_#t~nondet1098#1, main_#t~nondet1099#1, main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset, main_#t~nondet1101#1, main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset, main_#t~mem1104#1.base, main_#t~mem1104#1.offset, main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset, main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset, main_#t~mem1107#1.base, main_#t~mem1107#1.offset, main_#t~pre1103#1, main_~i~24#1, main_~l~0#1.base, main_~l~0#1.offset, main_#t~mem1108#1.base, main_#t~mem1108#1.offset, main_#t~ret1109#1, main_#t~ret1110#1, main_#t~ret1111#1, main_~#rl~0#1.base, main_~#rl~0#1.offset, main_#t~ret1112#1, main_#t~ret1113#1, main_#t~ret1114#1, main_#t~ret1115#1, main_#t~ret1116#1, main_~#d~0#1.base, main_~#d~0#1.offset, main_~status~31#1, main_~we_should_unload~0#1, main_~#irp~0#1.base, main_~#irp~0#1.offset, main_~__BLAST_NONDET~3#1, main_~irp_choice~0#1, main_~#devobj~0#1.base, main_~#devobj~0#1.offset, main_~e~0#1.base, main_~e~0#1.offset;call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(168);assume -2147483648 <= main_#t~nondet1096#1 && main_#t~nondet1096#1 <= 2147483647;main_~status~31#1 := main_#t~nondet1096#1;havoc main_#t~nondet1096#1;assume -2147483648 <= main_#t~nondet1097#1 && main_#t~nondet1097#1 <= 2147483647;main_~we_should_unload~0#1 := main_#t~nondet1097#1;havoc main_#t~nondet1097#1;call main_~#irp~0#1.base, main_~#irp~0#1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= main_#t~nondet1098#1 && main_#t~nondet1098#1 <= 2147483647;main_~__BLAST_NONDET~3#1 := main_#t~nondet1098#1;havoc main_#t~nondet1098#1;assume -2147483648 <= main_#t~nondet1099#1 && main_#t~nondet1099#1 <= 2147483647;main_~irp_choice~0#1 := main_#t~nondet1099#1;havoc main_#t~nondet1099#1;call main_~#devobj~0#1.base, main_~#devobj~0#1.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(main_~#devobj~0#1.base, main_~#devobj~0#1.offset, main_~#d~0#1.base, 4 + main_~#d~0#1.offset, 4);call main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset := #Ultimate.allocOnHeap(434);main_~e~0#1.base, main_~e~0#1.offset := main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset;havoc main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset;call write~$Pointer$(main_~e~0#1.base, main_~e~0#1.offset, main_~#devobj~0#1.base, 40 + main_~#devobj~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 28 + main_~e~0#1.offset, main_~e~0#1.base, 28 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 28 + main_~e~0#1.offset, main_~e~0#1.base, 32 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 196 + main_~e~0#1.offset, main_~e~0#1.base, 196 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 196 + main_~e~0#1.offset, main_~e~0#1.base, 200 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 36 + main_~e~0#1.offset, main_~e~0#1.base, 36 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 36 + main_~e~0#1.offset, main_~e~0#1.base, 40 + main_~e~0#1.offset, 4);assume -2147483648 <= main_#t~nondet1101#1 && main_#t~nondet1101#1 <= 2147483647;~s~0 := main_#t~nondet1101#1;havoc main_#t~nondet1101#1;call main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset, main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);havoc main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset;main_~i~24#1 := 0; {12917#true} is VALID [2022-02-20 14:41:10,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {12917#true} assume !!(main_~i~24#1 < 4);call main_#t~mem1104#1.base, main_#t~mem1104#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset := #Ultimate.allocOnHeap(72);call write~$Pointer$(main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset, main_#t~mem1104#1.base, 4 + (main_#t~mem1104#1.offset + 36 * main_~i~24#1), 4);havoc main_#t~mem1104#1.base, main_#t~mem1104#1.offset;havoc main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset;call main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset := #Ultimate.allocOnHeap(36);main_~l~0#1.base, main_~l~0#1.offset := main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset;havoc main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset;call write~int(1, main_~l~0#1.base, main_~l~0#1.offset, 4);call write~int(1, main_~l~0#1.base, 16 + main_~l~0#1.offset, 4);call main_#t~mem1107#1.base, main_#t~mem1107#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call write~$Pointer$(main_~l~0#1.base, main_~l~0#1.offset, main_#t~mem1107#1.base, 8 + (main_#t~mem1107#1.offset + 36 * main_~i~24#1), 4);havoc main_#t~mem1107#1.base, main_#t~mem1107#1.offset; {12917#true} is VALID [2022-02-20 14:41:10,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {12917#true} main_#t~pre1103#1 := 1 + main_~i~24#1;main_~i~24#1 := 1 + main_~i~24#1;havoc main_#t~pre1103#1; {12917#true} is VALID [2022-02-20 14:41:10,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {12917#true} assume !(main_~i~24#1 < 4); {12917#true} is VALID [2022-02-20 14:41:10,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {12917#true} call main_#t~mem1108#1.base, main_#t~mem1108#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call write~$Pointer$(main_#t~mem1108#1.base, 108 + main_#t~mem1108#1.offset, main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);havoc main_#t~mem1108#1.base, main_#t~mem1108#1.offset;~pirp~0.base, ~pirp~0.offset := main_~#irp~0#1.base, main_~#irp~0#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; {12939#(<= ~pended~0 0)} is VALID [2022-02-20 14:41:10,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {12939#(<= ~pended~0 0)} assume { :end_inline__BLAST_init } true; {12939#(<= ~pended~0 0)} is VALID [2022-02-20 14:41:10,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {12939#(<= ~pended~0 0)} assume !(main_~status~31#1 >= 0); {12939#(<= ~pended~0 0)} is VALID [2022-02-20 14:41:10,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {12939#(<= ~pended~0 0)} assume !(1 == ~pended~0); {12939#(<= ~pended~0 0)} is VALID [2022-02-20 14:41:10,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {12939#(<= ~pended~0 0)} assume !(1 == ~pended~0); {12939#(<= ~pended~0 0)} is VALID [2022-02-20 14:41:10,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {12939#(<= ~pended~0 0)} assume !(~s~0 == ~UNLOADED~0); {12939#(<= ~pended~0 0)} is VALID [2022-02-20 14:41:10,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {12939#(<= ~pended~0 0)} assume !(-1 == main_~status~31#1); {12939#(<= ~pended~0 0)} is VALID [2022-02-20 14:41:10,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {12939#(<= ~pended~0 0)} assume !(~s~0 != ~SKIP2~0); {12939#(<= ~pended~0 0)} is VALID [2022-02-20 14:41:10,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {12939#(<= ~pended~0 0)} assume 1 == ~pended~0; {12918#false} is VALID [2022-02-20 14:41:10,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {12918#false} assume 259 != main_~status~31#1; {12918#false} is VALID [2022-02-20 14:41:10,966 INFO L272 TraceCheckUtils]: 15: Hoare triple {12918#false} call errorFn(); {12918#false} is VALID [2022-02-20 14:41:10,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {12918#false} assume !false; {12918#false} is VALID [2022-02-20 14:41:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:41:10,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:41:10,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092864338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:41:10,966 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:41:10,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:41:10,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560856064] [2022-02-20 14:41:10,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:41:10,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 17 [2022-02-20 14:41:10,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:41:10,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:41:11,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:41:11,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:41:11,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:41:11,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:41:11,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:41:11,001 INFO L87 Difference]: Start difference. First operand 1773 states and 2637 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:41:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:41:20,475 INFO L93 Difference]: Finished difference Result 1843 states and 2725 transitions. [2022-02-20 14:41:20,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:41:20,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 17 [2022-02-20 14:41:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:41:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:41:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2724 transitions. [2022-02-20 14:41:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:41:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2724 transitions. [2022-02-20 14:41:20,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 2724 transitions. [2022-02-20 14:41:22,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2724 edges. 2724 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:41:22,920 INFO L225 Difference]: With dead ends: 1843 [2022-02-20 14:41:22,920 INFO L226 Difference]: Without dead ends: 1824 [2022-02-20 14:41:22,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:41:22,924 INFO L933 BasicCegarLoop]: 2634 mSDtfsCounter, 2614 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2614 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:41:22,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2614 Valid, 2698 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:41:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2022-02-20 14:41:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1815. [2022-02-20 14:41:23,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:41:23,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1824 states. Second operand has 1815 states, 1284 states have (on average 1.397196261682243) internal successors, (1794), 1333 states have internal predecessors, (1794), 457 states have call successors, (457), 74 states have call predecessors, (457), 73 states have return successors, (438), 430 states have call predecessors, (438), 438 states have call successors, (438) [2022-02-20 14:41:23,240 INFO L74 IsIncluded]: Start isIncluded. First operand 1824 states. Second operand has 1815 states, 1284 states have (on average 1.397196261682243) internal successors, (1794), 1333 states have internal predecessors, (1794), 457 states have call successors, (457), 74 states have call predecessors, (457), 73 states have return successors, (438), 430 states have call predecessors, (438), 438 states have call successors, (438) [2022-02-20 14:41:23,245 INFO L87 Difference]: Start difference. First operand 1824 states. Second operand has 1815 states, 1284 states have (on average 1.397196261682243) internal successors, (1794), 1333 states have internal predecessors, (1794), 457 states have call successors, (457), 74 states have call predecessors, (457), 73 states have return successors, (438), 430 states have call predecessors, (438), 438 states have call successors, (438) [2022-02-20 14:41:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:41:23,366 INFO L93 Difference]: Finished difference Result 1824 states and 2698 transitions. [2022-02-20 14:41:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2698 transitions. [2022-02-20 14:41:23,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:41:23,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:41:23,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 1815 states, 1284 states have (on average 1.397196261682243) internal successors, (1794), 1333 states have internal predecessors, (1794), 457 states have call successors, (457), 74 states have call predecessors, (457), 73 states have return successors, (438), 430 states have call predecessors, (438), 438 states have call successors, (438) Second operand 1824 states. [2022-02-20 14:41:23,413 INFO L87 Difference]: Start difference. First operand has 1815 states, 1284 states have (on average 1.397196261682243) internal successors, (1794), 1333 states have internal predecessors, (1794), 457 states have call successors, (457), 74 states have call predecessors, (457), 73 states have return successors, (438), 430 states have call predecessors, (438), 438 states have call successors, (438) Second operand 1824 states. [2022-02-20 14:41:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:41:23,541 INFO L93 Difference]: Finished difference Result 1824 states and 2698 transitions. [2022-02-20 14:41:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2698 transitions. [2022-02-20 14:41:23,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:41:23,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:41:23,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:41:23,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:41:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1284 states have (on average 1.397196261682243) internal successors, (1794), 1333 states have internal predecessors, (1794), 457 states have call successors, (457), 74 states have call predecessors, (457), 73 states have return successors, (438), 430 states have call predecessors, (438), 438 states have call successors, (438) [2022-02-20 14:41:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2689 transitions. [2022-02-20 14:41:23,724 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2689 transitions. Word has length 17 [2022-02-20 14:41:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:41:23,724 INFO L470 AbstractCegarLoop]: Abstraction has 1815 states and 2689 transitions. [2022-02-20 14:41:23,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:41:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2689 transitions. [2022-02-20 14:41:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:41:23,725 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:41:23,725 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:41:23,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:41:23,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:41:23,927 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:41:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:41:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash 957396199, now seen corresponding path program 1 times [2022-02-20 14:41:23,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:41:23,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292773753] [2022-02-20 14:41:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:41:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:41:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:41:24,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#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(41, 4);call #Ultimate.allocInit(41, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(41, 7);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(41, 9);call #Ultimate.allocInit(41, 10);call #Ultimate.allocInit(41, 11);call #Ultimate.allocInit(41, 12);call #Ultimate.allocInit(41, 13);call #Ultimate.allocInit(41, 14);call #Ultimate.allocInit(41, 15);call #Ultimate.allocInit(41, 16);call #Ultimate.allocInit(41, 17);call #Ultimate.allocInit(41, 18);call #Ultimate.allocInit(41, 19);call #Ultimate.allocInit(41, 20);call #Ultimate.allocInit(41, 21);call #Ultimate.allocInit(41, 22);call #Ultimate.allocInit(41, 23);call #Ultimate.allocInit(41, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(41, 26);call #Ultimate.allocInit(41, 27);call #Ultimate.allocInit(41, 28);call #Ultimate.allocInit(41, 29);call #Ultimate.allocInit(8, 30);call #Ultimate.allocInit(7, 31);call write~init~int(117, 31, 0, 1);call write~init~int(116, 31, 1, 1);call write~init~int(105, 31, 2, 1);call write~init~int(108, 31, 3, 1);call write~init~int(46, 31, 4, 1);call write~init~int(99, 31, 5, 1);call write~init~int(0, 31, 6, 1);~isFixed~0 := 0;~isWin98~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~routine~0 := 0;~#PnpIrpName~0.base, ~#PnpIrpName~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);call write~init~$Pointer$(4, 0, ~#PnpIrpName~0.base, ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(5, 0, ~#PnpIrpName~0.base, 4 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(6, 0, ~#PnpIrpName~0.base, 8 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(7, 0, ~#PnpIrpName~0.base, 12 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(8, 0, ~#PnpIrpName~0.base, 16 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(9, 0, ~#PnpIrpName~0.base, 20 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(10, 0, ~#PnpIrpName~0.base, 24 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(11, 0, ~#PnpIrpName~0.base, 28 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(12, 0, ~#PnpIrpName~0.base, 32 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(13, 0, ~#PnpIrpName~0.base, 36 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(14, 0, ~#PnpIrpName~0.base, 40 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(15, 0, ~#PnpIrpName~0.base, 44 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(16, 0, ~#PnpIrpName~0.base, 48 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(17, 0, ~#PnpIrpName~0.base, 52 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(18, 0, ~#PnpIrpName~0.base, 56 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(19, 0, ~#PnpIrpName~0.base, 60 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(20, 0, ~#PnpIrpName~0.base, 64 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(21, 0, ~#PnpIrpName~0.base, 68 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(22, 0, ~#PnpIrpName~0.base, 72 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(23, 0, ~#PnpIrpName~0.base, 76 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(24, 0, ~#PnpIrpName~0.base, 80 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(25, 0, ~#PnpIrpName~0.base, 84 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(26, 0, ~#PnpIrpName~0.base, 88 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(27, 0, ~#PnpIrpName~0.base, 92 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(28, 0, ~#PnpIrpName~0.base, 96 + ~#PnpIrpName~0.offset, 4);~#ModeQualifier___6~0.base, ~#ModeQualifier___6~0.offset := 33, 0;call #Ultimate.allocInit(7, 33);call write~init~int(170, ~#ModeQualifier___6~0.base, ~#ModeQualifier___6~0.offset, 1);call write~init~int(85, ~#ModeQualifier___6~0.base, 1 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(0, ~#ModeQualifier___6~0.base, 2 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(255, ~#ModeQualifier___6~0.base, 3 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(135, ~#ModeQualifier___6~0.base, 4 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(120, ~#ModeQualifier___6~0.base, 5 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(255, ~#ModeQualifier___6~0.base, 6 + ~#ModeQualifier___6~0.offset, 1);~Extension_FilterMode~0 := 0;~#GUID_PARALLEL_DEVICE~0.base, ~#GUID_PARALLEL_DEVICE~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~int(2549575408, ~#GUID_PARALLEL_DEVICE~0.base, ~#GUID_PARALLEL_DEVICE~0.offset, 4);call write~init~int(63619, ~#GUID_PARALLEL_DEVICE~0.base, 4 + ~#GUID_PARALLEL_DEVICE~0.offset, 2);call write~init~int(4560, ~#GUID_PARALLEL_DEVICE~0.base, 6 + ~#GUID_PARALLEL_DEVICE~0.offset, 2);call write~init~int(175, ~#GUID_PARALLEL_DEVICE~0.base, 8 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(31, ~#GUID_PARALLEL_DEVICE~0.base, 9 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 10 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 11 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(248, ~#GUID_PARALLEL_DEVICE~0.base, 12 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 13 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(132, ~#GUID_PARALLEL_DEVICE~0.base, 14 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(92, ~#GUID_PARALLEL_DEVICE~0.base, 15 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);~GUID_PARCLASS_DEVICE~0.Data1 := 2166343333;~GUID_PARCLASS_DEVICE~0.Data2 := 63272;~GUID_PARCLASS_DEVICE~0.Data3 := 4560;~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[0 := 165];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[1 := 55];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[2 := 0];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[3 := 0];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[4 := 248];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[5 := 117];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[6 := 62];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[7 := 209];~#PptDebugLevel~0.base, ~#PptDebugLevel~0.offset := 35, 0;call #Ultimate.allocInit(4, 35);call write~init~int(0, ~#PptDebugLevel~0.base, ~#PptDebugLevel~0.offset, 4);~#PptBreakOn~0.base, ~#PptBreakOn~0.offset := 36, 0;call #Ultimate.allocInit(4, 36);call write~init~int(0, ~#PptBreakOn~0.base, ~#PptBreakOn~0.offset, 4);~#RegistryPath~0.base, ~#RegistryPath~0.offset := 37, 0;call #Ultimate.allocInit(8, 37);call write~init~int(0, ~#RegistryPath~0.base, ~#RegistryPath~0.offset, 2);call write~init~int(0, ~#RegistryPath~0.base, 2 + ~#RegistryPath~0.offset, 2);call write~init~$Pointer$(0, 0, ~#RegistryPath~0.base, 4 + ~#RegistryPath~0.offset, 4);~PortInfoReferenceCount~0 := -1;~PortInfoMutex~0.base, ~PortInfoMutex~0.offset := 0, 0;~#PhysicalZero~0.base, ~#PhysicalZero~0.offset := 38, 0;call #Ultimate.allocInit(8, 38);call write~init~int(0, ~#PhysicalZero~0.base, ~#PhysicalZero~0.offset, 4);call write~init~int(0, ~#PhysicalZero~0.base, 4 + ~#PhysicalZero~0.offset, 4);~PptDot3Retries~0 := 5;~PptPnpDispatchFunctionTable~0.base, ~PptPnpDispatchFunctionTable~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~#LegacyZipModeQualifier___11~0.base, ~#LegacyZipModeQualifier___11~0.offset := 39, 0;call #Ultimate.allocInit(3, 39);call write~init~int(0, ~#LegacyZipModeQualifier___11~0.base, ~#LegacyZipModeQualifier___11~0.offset, 1);call write~init~int(60, ~#LegacyZipModeQualifier___11~0.base, 1 + ~#LegacyZipModeQualifier___11~0.offset, 1);call write~init~int(32, ~#LegacyZipModeQualifier___11~0.base, 2 + ~#LegacyZipModeQualifier___11~0.offset, 1);~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset := 40, 0;call #Ultimate.allocInit(16, 40);call write~init~int(1270573546, ~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset, 4);call write~init~int(26707, ~#PptWmiAllocFreeCountsGuid~0.base, 4 + ~#PptWmiAllocFreeCountsGuid~0.offset, 2);call write~init~int(4562, ~#PptWmiAllocFreeCountsGuid~0.base, 6 + ~#PptWmiAllocFreeCountsGuid~0.offset, 2);call write~init~int(142, ~#PptWmiAllocFreeCountsGuid~0.base, 8 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(206, ~#PptWmiAllocFreeCountsGuid~0.base, 9 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(0, ~#PptWmiAllocFreeCountsGuid~0.base, 10 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(192, ~#PptWmiAllocFreeCountsGuid~0.base, 11 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(79, ~#PptWmiAllocFreeCountsGuid~0.base, 12 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(142, ~#PptWmiAllocFreeCountsGuid~0.base, 13 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(244, ~#PptWmiAllocFreeCountsGuid~0.base, 14 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(129, ~#PptWmiAllocFreeCountsGuid~0.base, 15 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);~#PptWmiGuidList~0.base, ~#PptWmiGuidList~0.offset := 41, 0;call #Ultimate.allocInit(12, 41);call write~init~$Pointer$(~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset, ~#PptWmiGuidList~0.base, ~#PptWmiGuidList~0.offset, 4);call write~init~int(1, ~#PptWmiGuidList~0.base, 4 + ~#PptWmiGuidList~0.offset, 4);call write~init~int(0, ~#PptWmiGuidList~0.base, 8 + ~#PptWmiGuidList~0.offset, 4);~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {21829#true} is VALID [2022-02-20 14:41:24,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1096#1, main_#t~nondet1097#1, main_#t~nondet1098#1, main_#t~nondet1099#1, main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset, main_#t~nondet1101#1, main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset, main_#t~mem1104#1.base, main_#t~mem1104#1.offset, main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset, main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset, main_#t~mem1107#1.base, main_#t~mem1107#1.offset, main_#t~pre1103#1, main_~i~24#1, main_~l~0#1.base, main_~l~0#1.offset, main_#t~mem1108#1.base, main_#t~mem1108#1.offset, main_#t~ret1109#1, main_#t~ret1110#1, main_#t~ret1111#1, main_~#rl~0#1.base, main_~#rl~0#1.offset, main_#t~ret1112#1, main_#t~ret1113#1, main_#t~ret1114#1, main_#t~ret1115#1, main_#t~ret1116#1, main_~#d~0#1.base, main_~#d~0#1.offset, main_~status~31#1, main_~we_should_unload~0#1, main_~#irp~0#1.base, main_~#irp~0#1.offset, main_~__BLAST_NONDET~3#1, main_~irp_choice~0#1, main_~#devobj~0#1.base, main_~#devobj~0#1.offset, main_~e~0#1.base, main_~e~0#1.offset;call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(168);assume -2147483648 <= main_#t~nondet1096#1 && main_#t~nondet1096#1 <= 2147483647;main_~status~31#1 := main_#t~nondet1096#1;havoc main_#t~nondet1096#1;assume -2147483648 <= main_#t~nondet1097#1 && main_#t~nondet1097#1 <= 2147483647;main_~we_should_unload~0#1 := main_#t~nondet1097#1;havoc main_#t~nondet1097#1;call main_~#irp~0#1.base, main_~#irp~0#1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= main_#t~nondet1098#1 && main_#t~nondet1098#1 <= 2147483647;main_~__BLAST_NONDET~3#1 := main_#t~nondet1098#1;havoc main_#t~nondet1098#1;assume -2147483648 <= main_#t~nondet1099#1 && main_#t~nondet1099#1 <= 2147483647;main_~irp_choice~0#1 := main_#t~nondet1099#1;havoc main_#t~nondet1099#1;call main_~#devobj~0#1.base, main_~#devobj~0#1.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(main_~#devobj~0#1.base, main_~#devobj~0#1.offset, main_~#d~0#1.base, 4 + main_~#d~0#1.offset, 4);call main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset := #Ultimate.allocOnHeap(434);main_~e~0#1.base, main_~e~0#1.offset := main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset;havoc main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset;call write~$Pointer$(main_~e~0#1.base, main_~e~0#1.offset, main_~#devobj~0#1.base, 40 + main_~#devobj~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 28 + main_~e~0#1.offset, main_~e~0#1.base, 28 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 28 + main_~e~0#1.offset, main_~e~0#1.base, 32 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 196 + main_~e~0#1.offset, main_~e~0#1.base, 196 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 196 + main_~e~0#1.offset, main_~e~0#1.base, 200 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 36 + main_~e~0#1.offset, main_~e~0#1.base, 36 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 36 + main_~e~0#1.offset, main_~e~0#1.base, 40 + main_~e~0#1.offset, 4);assume -2147483648 <= main_#t~nondet1101#1 && main_#t~nondet1101#1 <= 2147483647;~s~0 := main_#t~nondet1101#1;havoc main_#t~nondet1101#1;call main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset, main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);havoc main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset;main_~i~24#1 := 0; {21831#(= |ULTIMATE.start_main_~i~24#1| 0)} is VALID [2022-02-20 14:41:24,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {21831#(= |ULTIMATE.start_main_~i~24#1| 0)} assume !!(main_~i~24#1 < 4);call main_#t~mem1104#1.base, main_#t~mem1104#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset := #Ultimate.allocOnHeap(72);call write~$Pointer$(main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset, main_#t~mem1104#1.base, 4 + (main_#t~mem1104#1.offset + 36 * main_~i~24#1), 4);havoc main_#t~mem1104#1.base, main_#t~mem1104#1.offset;havoc main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset;call main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset := #Ultimate.allocOnHeap(36);main_~l~0#1.base, main_~l~0#1.offset := main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset;havoc main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset;call write~int(1, main_~l~0#1.base, main_~l~0#1.offset, 4);call write~int(1, main_~l~0#1.base, 16 + main_~l~0#1.offset, 4);call main_#t~mem1107#1.base, main_#t~mem1107#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call write~$Pointer$(main_~l~0#1.base, main_~l~0#1.offset, main_#t~mem1107#1.base, 8 + (main_#t~mem1107#1.offset + 36 * main_~i~24#1), 4);havoc main_#t~mem1107#1.base, main_#t~mem1107#1.offset; {21831#(= |ULTIMATE.start_main_~i~24#1| 0)} is VALID [2022-02-20 14:41:24,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {21831#(= |ULTIMATE.start_main_~i~24#1| 0)} main_#t~pre1103#1 := 1 + main_~i~24#1;main_~i~24#1 := 1 + main_~i~24#1;havoc main_#t~pre1103#1; {21832#(<= |ULTIMATE.start_main_~i~24#1| 1)} is VALID [2022-02-20 14:41:24,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {21832#(<= |ULTIMATE.start_main_~i~24#1| 1)} assume !(main_~i~24#1 < 4); {21830#false} is VALID [2022-02-20 14:41:24,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {21830#false} call main_#t~mem1108#1.base, main_#t~mem1108#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call write~$Pointer$(main_#t~mem1108#1.base, 108 + main_#t~mem1108#1.offset, main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);havoc main_#t~mem1108#1.base, main_#t~mem1108#1.offset;~pirp~0.base, ~pirp~0.offset := main_~#irp~0#1.base, main_~#irp~0#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; {21830#false} is VALID [2022-02-20 14:41:24,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {21830#false} assume { :end_inline__BLAST_init } true; {21830#false} is VALID [2022-02-20 14:41:24,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {21830#false} assume !(main_~status~31#1 >= 0); {21830#false} is VALID [2022-02-20 14:41:24,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {21830#false} assume !(1 == ~pended~0); {21830#false} is VALID [2022-02-20 14:41:24,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {21830#false} assume !(1 == ~pended~0); {21830#false} is VALID [2022-02-20 14:41:24,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {21830#false} assume !(~s~0 == ~UNLOADED~0); {21830#false} is VALID [2022-02-20 14:41:24,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {21830#false} assume !(-1 == main_~status~31#1); {21830#false} is VALID [2022-02-20 14:41:24,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {21830#false} assume ~s~0 != ~SKIP2~0; {21830#false} is VALID [2022-02-20 14:41:24,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {21830#false} assume ~s~0 != ~IPC~0; {21830#false} is VALID [2022-02-20 14:41:24,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {21830#false} assume ~s~0 != ~DC~0; {21830#false} is VALID [2022-02-20 14:41:24,051 INFO L272 TraceCheckUtils]: 15: Hoare triple {21830#false} call errorFn(); {21830#false} is VALID [2022-02-20 14:41:24,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {21830#false} assume !false; {21830#false} is VALID [2022-02-20 14:41:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:41:24,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:41:24,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292773753] [2022-02-20 14:41:24,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292773753] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:41:24,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225259307] [2022-02-20 14:41:24,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:41:24,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:41:24,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:41:24,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:41:24,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:41:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:41:24,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:41:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:41:24,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:41:24,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {21829#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(41, 4);call #Ultimate.allocInit(41, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(41, 7);call #Ultimate.allocInit(41, 8);call #Ultimate.allocInit(41, 9);call #Ultimate.allocInit(41, 10);call #Ultimate.allocInit(41, 11);call #Ultimate.allocInit(41, 12);call #Ultimate.allocInit(41, 13);call #Ultimate.allocInit(41, 14);call #Ultimate.allocInit(41, 15);call #Ultimate.allocInit(41, 16);call #Ultimate.allocInit(41, 17);call #Ultimate.allocInit(41, 18);call #Ultimate.allocInit(41, 19);call #Ultimate.allocInit(41, 20);call #Ultimate.allocInit(41, 21);call #Ultimate.allocInit(41, 22);call #Ultimate.allocInit(41, 23);call #Ultimate.allocInit(41, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(41, 26);call #Ultimate.allocInit(41, 27);call #Ultimate.allocInit(41, 28);call #Ultimate.allocInit(41, 29);call #Ultimate.allocInit(8, 30);call #Ultimate.allocInit(7, 31);call write~init~int(117, 31, 0, 1);call write~init~int(116, 31, 1, 1);call write~init~int(105, 31, 2, 1);call write~init~int(108, 31, 3, 1);call write~init~int(46, 31, 4, 1);call write~init~int(99, 31, 5, 1);call write~init~int(0, 31, 6, 1);~isFixed~0 := 0;~isWin98~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~routine~0 := 0;~#PnpIrpName~0.base, ~#PnpIrpName~0.offset := 32, 0;call #Ultimate.allocInit(100, 32);call write~init~$Pointer$(4, 0, ~#PnpIrpName~0.base, ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(5, 0, ~#PnpIrpName~0.base, 4 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(6, 0, ~#PnpIrpName~0.base, 8 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(7, 0, ~#PnpIrpName~0.base, 12 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(8, 0, ~#PnpIrpName~0.base, 16 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(9, 0, ~#PnpIrpName~0.base, 20 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(10, 0, ~#PnpIrpName~0.base, 24 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(11, 0, ~#PnpIrpName~0.base, 28 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(12, 0, ~#PnpIrpName~0.base, 32 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(13, 0, ~#PnpIrpName~0.base, 36 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(14, 0, ~#PnpIrpName~0.base, 40 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(15, 0, ~#PnpIrpName~0.base, 44 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(16, 0, ~#PnpIrpName~0.base, 48 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(17, 0, ~#PnpIrpName~0.base, 52 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(18, 0, ~#PnpIrpName~0.base, 56 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(19, 0, ~#PnpIrpName~0.base, 60 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(20, 0, ~#PnpIrpName~0.base, 64 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(21, 0, ~#PnpIrpName~0.base, 68 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(22, 0, ~#PnpIrpName~0.base, 72 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(23, 0, ~#PnpIrpName~0.base, 76 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(24, 0, ~#PnpIrpName~0.base, 80 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(25, 0, ~#PnpIrpName~0.base, 84 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(26, 0, ~#PnpIrpName~0.base, 88 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(27, 0, ~#PnpIrpName~0.base, 92 + ~#PnpIrpName~0.offset, 4);call write~init~$Pointer$(28, 0, ~#PnpIrpName~0.base, 96 + ~#PnpIrpName~0.offset, 4);~#ModeQualifier___6~0.base, ~#ModeQualifier___6~0.offset := 33, 0;call #Ultimate.allocInit(7, 33);call write~init~int(170, ~#ModeQualifier___6~0.base, ~#ModeQualifier___6~0.offset, 1);call write~init~int(85, ~#ModeQualifier___6~0.base, 1 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(0, ~#ModeQualifier___6~0.base, 2 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(255, ~#ModeQualifier___6~0.base, 3 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(135, ~#ModeQualifier___6~0.base, 4 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(120, ~#ModeQualifier___6~0.base, 5 + ~#ModeQualifier___6~0.offset, 1);call write~init~int(255, ~#ModeQualifier___6~0.base, 6 + ~#ModeQualifier___6~0.offset, 1);~Extension_FilterMode~0 := 0;~#GUID_PARALLEL_DEVICE~0.base, ~#GUID_PARALLEL_DEVICE~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~int(2549575408, ~#GUID_PARALLEL_DEVICE~0.base, ~#GUID_PARALLEL_DEVICE~0.offset, 4);call write~init~int(63619, ~#GUID_PARALLEL_DEVICE~0.base, 4 + ~#GUID_PARALLEL_DEVICE~0.offset, 2);call write~init~int(4560, ~#GUID_PARALLEL_DEVICE~0.base, 6 + ~#GUID_PARALLEL_DEVICE~0.offset, 2);call write~init~int(175, ~#GUID_PARALLEL_DEVICE~0.base, 8 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(31, ~#GUID_PARALLEL_DEVICE~0.base, 9 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 10 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 11 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(248, ~#GUID_PARALLEL_DEVICE~0.base, 12 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(0, ~#GUID_PARALLEL_DEVICE~0.base, 13 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(132, ~#GUID_PARALLEL_DEVICE~0.base, 14 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);call write~init~int(92, ~#GUID_PARALLEL_DEVICE~0.base, 15 + ~#GUID_PARALLEL_DEVICE~0.offset, 1);~GUID_PARCLASS_DEVICE~0.Data1 := 2166343333;~GUID_PARCLASS_DEVICE~0.Data2 := 63272;~GUID_PARCLASS_DEVICE~0.Data3 := 4560;~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[0 := 165];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[1 := 55];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[2 := 0];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[3 := 0];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[4 := 248];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[5 := 117];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[6 := 62];~GUID_PARCLASS_DEVICE~0.Data4 := ~GUID_PARCLASS_DEVICE~0.Data4[7 := 209];~#PptDebugLevel~0.base, ~#PptDebugLevel~0.offset := 35, 0;call #Ultimate.allocInit(4, 35);call write~init~int(0, ~#PptDebugLevel~0.base, ~#PptDebugLevel~0.offset, 4);~#PptBreakOn~0.base, ~#PptBreakOn~0.offset := 36, 0;call #Ultimate.allocInit(4, 36);call write~init~int(0, ~#PptBreakOn~0.base, ~#PptBreakOn~0.offset, 4);~#RegistryPath~0.base, ~#RegistryPath~0.offset := 37, 0;call #Ultimate.allocInit(8, 37);call write~init~int(0, ~#RegistryPath~0.base, ~#RegistryPath~0.offset, 2);call write~init~int(0, ~#RegistryPath~0.base, 2 + ~#RegistryPath~0.offset, 2);call write~init~$Pointer$(0, 0, ~#RegistryPath~0.base, 4 + ~#RegistryPath~0.offset, 4);~PortInfoReferenceCount~0 := -1;~PortInfoMutex~0.base, ~PortInfoMutex~0.offset := 0, 0;~#PhysicalZero~0.base, ~#PhysicalZero~0.offset := 38, 0;call #Ultimate.allocInit(8, 38);call write~init~int(0, ~#PhysicalZero~0.base, ~#PhysicalZero~0.offset, 4);call write~init~int(0, ~#PhysicalZero~0.base, 4 + ~#PhysicalZero~0.offset, 4);~PptDot3Retries~0 := 5;~PptPnpDispatchFunctionTable~0.base, ~PptPnpDispatchFunctionTable~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~#LegacyZipModeQualifier___11~0.base, ~#LegacyZipModeQualifier___11~0.offset := 39, 0;call #Ultimate.allocInit(3, 39);call write~init~int(0, ~#LegacyZipModeQualifier___11~0.base, ~#LegacyZipModeQualifier___11~0.offset, 1);call write~init~int(60, ~#LegacyZipModeQualifier___11~0.base, 1 + ~#LegacyZipModeQualifier___11~0.offset, 1);call write~init~int(32, ~#LegacyZipModeQualifier___11~0.base, 2 + ~#LegacyZipModeQualifier___11~0.offset, 1);~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset := 40, 0;call #Ultimate.allocInit(16, 40);call write~init~int(1270573546, ~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset, 4);call write~init~int(26707, ~#PptWmiAllocFreeCountsGuid~0.base, 4 + ~#PptWmiAllocFreeCountsGuid~0.offset, 2);call write~init~int(4562, ~#PptWmiAllocFreeCountsGuid~0.base, 6 + ~#PptWmiAllocFreeCountsGuid~0.offset, 2);call write~init~int(142, ~#PptWmiAllocFreeCountsGuid~0.base, 8 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(206, ~#PptWmiAllocFreeCountsGuid~0.base, 9 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(0, ~#PptWmiAllocFreeCountsGuid~0.base, 10 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(192, ~#PptWmiAllocFreeCountsGuid~0.base, 11 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(79, ~#PptWmiAllocFreeCountsGuid~0.base, 12 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(142, ~#PptWmiAllocFreeCountsGuid~0.base, 13 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(244, ~#PptWmiAllocFreeCountsGuid~0.base, 14 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);call write~init~int(129, ~#PptWmiAllocFreeCountsGuid~0.base, 15 + ~#PptWmiAllocFreeCountsGuid~0.offset, 1);~#PptWmiGuidList~0.base, ~#PptWmiGuidList~0.offset := 41, 0;call #Ultimate.allocInit(12, 41);call write~init~$Pointer$(~#PptWmiAllocFreeCountsGuid~0.base, ~#PptWmiAllocFreeCountsGuid~0.offset, ~#PptWmiGuidList~0.base, ~#PptWmiGuidList~0.offset, 4);call write~init~int(1, ~#PptWmiGuidList~0.base, 4 + ~#PptWmiGuidList~0.offset, 4);call write~init~int(0, ~#PptWmiGuidList~0.base, 8 + ~#PptWmiGuidList~0.offset, 4);~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {21829#true} is VALID [2022-02-20 14:41:24,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {21829#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1096#1, main_#t~nondet1097#1, main_#t~nondet1098#1, main_#t~nondet1099#1, main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset, main_#t~nondet1101#1, main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset, main_#t~mem1104#1.base, main_#t~mem1104#1.offset, main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset, main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset, main_#t~mem1107#1.base, main_#t~mem1107#1.offset, main_#t~pre1103#1, main_~i~24#1, main_~l~0#1.base, main_~l~0#1.offset, main_#t~mem1108#1.base, main_#t~mem1108#1.offset, main_#t~ret1109#1, main_#t~ret1110#1, main_#t~ret1111#1, main_~#rl~0#1.base, main_~#rl~0#1.offset, main_#t~ret1112#1, main_#t~ret1113#1, main_#t~ret1114#1, main_#t~ret1115#1, main_#t~ret1116#1, main_~#d~0#1.base, main_~#d~0#1.offset, main_~status~31#1, main_~we_should_unload~0#1, main_~#irp~0#1.base, main_~#irp~0#1.offset, main_~__BLAST_NONDET~3#1, main_~irp_choice~0#1, main_~#devobj~0#1.base, main_~#devobj~0#1.offset, main_~e~0#1.base, main_~e~0#1.offset;call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(168);assume -2147483648 <= main_#t~nondet1096#1 && main_#t~nondet1096#1 <= 2147483647;main_~status~31#1 := main_#t~nondet1096#1;havoc main_#t~nondet1096#1;assume -2147483648 <= main_#t~nondet1097#1 && main_#t~nondet1097#1 <= 2147483647;main_~we_should_unload~0#1 := main_#t~nondet1097#1;havoc main_#t~nondet1097#1;call main_~#irp~0#1.base, main_~#irp~0#1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= main_#t~nondet1098#1 && main_#t~nondet1098#1 <= 2147483647;main_~__BLAST_NONDET~3#1 := main_#t~nondet1098#1;havoc main_#t~nondet1098#1;assume -2147483648 <= main_#t~nondet1099#1 && main_#t~nondet1099#1 <= 2147483647;main_~irp_choice~0#1 := main_#t~nondet1099#1;havoc main_#t~nondet1099#1;call main_~#devobj~0#1.base, main_~#devobj~0#1.offset := #Ultimate.allocOnStack(175);call write~$Pointer$(main_~#devobj~0#1.base, main_~#devobj~0#1.offset, main_~#d~0#1.base, 4 + main_~#d~0#1.offset, 4);call main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset := #Ultimate.allocOnHeap(434);main_~e~0#1.base, main_~e~0#1.offset := main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset;havoc main_#t~malloc1100#1.base, main_#t~malloc1100#1.offset;call write~$Pointer$(main_~e~0#1.base, main_~e~0#1.offset, main_~#devobj~0#1.base, 40 + main_~#devobj~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 28 + main_~e~0#1.offset, main_~e~0#1.base, 28 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 28 + main_~e~0#1.offset, main_~e~0#1.base, 32 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 196 + main_~e~0#1.offset, main_~e~0#1.base, 196 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 196 + main_~e~0#1.offset, main_~e~0#1.base, 200 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 36 + main_~e~0#1.offset, main_~e~0#1.base, 36 + main_~e~0#1.offset, 4);call write~$Pointer$(main_~e~0#1.base, 36 + main_~e~0#1.offset, main_~e~0#1.base, 40 + main_~e~0#1.offset, 4);assume -2147483648 <= main_#t~nondet1101#1 && main_#t~nondet1101#1 <= 2147483647;~s~0 := main_#t~nondet1101#1;havoc main_#t~nondet1101#1;call main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset, main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);havoc main_#t~malloc1102#1.base, main_#t~malloc1102#1.offset;main_~i~24#1 := 0; {21829#true} is VALID [2022-02-20 14:41:24,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {21829#true} assume !!(main_~i~24#1 < 4);call main_#t~mem1104#1.base, main_#t~mem1104#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset := #Ultimate.allocOnHeap(72);call write~$Pointer$(main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset, main_#t~mem1104#1.base, 4 + (main_#t~mem1104#1.offset + 36 * main_~i~24#1), 4);havoc main_#t~mem1104#1.base, main_#t~mem1104#1.offset;havoc main_#t~malloc1105#1.base, main_#t~malloc1105#1.offset;call main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset := #Ultimate.allocOnHeap(36);main_~l~0#1.base, main_~l~0#1.offset := main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset;havoc main_#t~malloc1106#1.base, main_#t~malloc1106#1.offset;call write~int(1, main_~l~0#1.base, main_~l~0#1.offset, 4);call write~int(1, main_~l~0#1.base, 16 + main_~l~0#1.offset, 4);call main_#t~mem1107#1.base, main_#t~mem1107#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call write~$Pointer$(main_~l~0#1.base, main_~l~0#1.offset, main_#t~mem1107#1.base, 8 + (main_#t~mem1107#1.offset + 36 * main_~i~24#1), 4);havoc main_#t~mem1107#1.base, main_#t~mem1107#1.offset; {21829#true} is VALID [2022-02-20 14:41:24,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {21829#true} main_#t~pre1103#1 := 1 + main_~i~24#1;main_~i~24#1 := 1 + main_~i~24#1;havoc main_#t~pre1103#1; {21829#true} is VALID [2022-02-20 14:41:24,582 INFO L290 TraceCheckUtils]: 4: Hoare triple {21829#true} assume !(main_~i~24#1 < 4); {21829#true} is VALID [2022-02-20 14:41:24,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {21829#true} call main_#t~mem1108#1.base, main_#t~mem1108#1.offset := read~$Pointer$(main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);call write~$Pointer$(main_#t~mem1108#1.base, 108 + main_#t~mem1108#1.offset, main_~#irp~0#1.base, 96 + main_~#irp~0#1.offset, 4);havoc main_#t~mem1108#1.base, main_#t~mem1108#1.offset;~pirp~0.base, ~pirp~0.offset := main_~#irp~0#1.base, main_~#irp~0#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; {21851#(= ~s~0 ~UNLOADED~0)} is VALID [2022-02-20 14:41:24,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {21851#(= ~s~0 ~UNLOADED~0)} assume { :end_inline__BLAST_init } true; {21851#(= ~s~0 ~UNLOADED~0)} is VALID [2022-02-20 14:41:24,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {21851#(= ~s~0 ~UNLOADED~0)} assume !(main_~status~31#1 >= 0); {21851#(= ~s~0 ~UNLOADED~0)} is VALID [2022-02-20 14:41:24,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {21851#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {21851#(= ~s~0 ~UNLOADED~0)} is VALID [2022-02-20 14:41:24,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {21851#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {21851#(= ~s~0 ~UNLOADED~0)} is VALID [2022-02-20 14:41:24,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {21851#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {21830#false} is VALID [2022-02-20 14:41:24,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {21830#false} assume !(-1 == main_~status~31#1); {21830#false} is VALID [2022-02-20 14:41:24,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {21830#false} assume ~s~0 != ~SKIP2~0; {21830#false} is VALID [2022-02-20 14:41:24,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {21830#false} assume ~s~0 != ~IPC~0; {21830#false} is VALID [2022-02-20 14:41:24,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {21830#false} assume ~s~0 != ~DC~0; {21830#false} is VALID [2022-02-20 14:41:24,586 INFO L272 TraceCheckUtils]: 15: Hoare triple {21830#false} call errorFn(); {21830#false} is VALID [2022-02-20 14:41:24,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {21830#false} assume !false; {21830#false} is VALID [2022-02-20 14:41:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:41:24,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:41:24,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225259307] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:41:24,587 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 14:41:24,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 14:41:24,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064594974] [2022-02-20 14:41:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:41:24,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 17 [2022-02-20 14:41:24,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:41:24,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:41:24,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:41:24,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:41:24,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:41:24,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:41:24,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:41:24,607 INFO L87 Difference]: Start difference. First operand 1815 states and 2689 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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)