/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 04:10:03,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 04:10:03,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 04:10:03,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 04:10:03,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 04:10:03,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 04:10:03,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 04:10:03,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 04:10:03,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 04:10:03,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 04:10:03,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 04:10:03,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 04:10:03,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 04:10:03,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 04:10:03,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 04:10:03,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 04:10:03,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 04:10:03,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 04:10:03,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 04:10:03,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 04:10:03,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 04:10:03,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 04:10:03,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 04:10:03,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 04:10:03,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 04:10:03,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 04:10:03,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 04:10:03,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 04:10:03,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 04:10:03,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 04:10:03,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 04:10:03,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 04:10:03,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 04:10:03,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 04:10:03,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 04:10:03,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 04:10:03,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 04:10:03,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 04:10:03,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 04:10:03,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 04:10:03,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 04:10:03,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-02-15 04:10:03,352 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 04:10:03,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 04:10:03,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 04:10:03,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 04:10:03,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 04:10:03,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 04:10:03,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 04:10:03,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 04:10:03,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 04:10:03,353 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 04:10:03,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 04:10:03,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 04:10:03,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 04:10:03,354 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 04:10:03,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 04:10:03,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 04:10:03,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 04:10:03,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 04:10:03,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 04:10:03,354 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-02-15 04:10:03,354 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-15 04:10:03,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 04:10:03,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 04:10:03,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 04:10:03,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 04:10:03,573 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 04:10:03,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-02-15 04:10:03,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b35a935/cb2b33cb9bb64658aaeeaf66eaee6007/FLAG8ba27f933 [2022-02-15 04:10:04,012 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 04:10:04,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-02-15 04:10:04,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b35a935/cb2b33cb9bb64658aaeeaf66eaee6007/FLAG8ba27f933 [2022-02-15 04:10:04,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b35a935/cb2b33cb9bb64658aaeeaf66eaee6007 [2022-02-15 04:10:04,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 04:10:04,036 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 04:10:04,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 04:10:04,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 04:10:04,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 04:10:04,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 04:10:04" (1/1) ... [2022-02-15 04:10:04,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7a1453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:10:04, skipping insertion in model container [2022-02-15 04:10:04,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 04:10:04" (1/1) ... [2022-02-15 04:10:04,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 04:10:04,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 04:10:04,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-02-15 04:10:04,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 04:10:04,303 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 04:10:04,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2022-02-15 04:10:04,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 04:10:04,359 INFO L208 MainTranslator]: Completed translation [2022-02-15 04:10:04,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:10:04 WrapperNode [2022-02-15 04:10:04,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 04:10:04,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 04:10:04,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 04:10:04,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 04:10:04,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:10:04" (1/1) ... [2022-02-15 04:10:04,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:10:04" (1/1) ... [2022-02-15 04:10:04,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:10:04" (1/1) ... [2022-02-15 04:10:04,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:10:04" (1/1) ... [2022-02-15 04:10:04,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:10:04" (1/1) ... [2022-02-15 04:10:04,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:10:04" (1/1) ... [2022-02-15 04:10:04,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:10:04" (1/1) ... [2022-02-15 04:10:04,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 04:10:04,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 04:10:04,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 04:10:04,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 04:10:04,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:10:04" (1/1) ... [2022-02-15 04:10:04,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 04:10:04,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 04:10:04,465 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-15 04:10:04,472 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-15 04:10:04,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 04:10:04,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 04:10:04,496 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 04:10:04,496 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-02-15 04:10:04,496 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-02-15 04:10:04,496 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-02-15 04:10:04,496 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 04:10:04,496 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-02-15 04:10:04,496 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-02-15 04:10:04,497 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-02-15 04:10:04,497 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-02-15 04:10:04,497 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-02-15 04:10:04,497 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-02-15 04:10:04,497 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-02-15 04:10:04,497 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-02-15 04:10:04,497 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-02-15 04:10:04,497 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-02-15 04:10:04,497 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-02-15 04:10:04,497 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-02-15 04:10:04,497 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 04:10:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 04:10:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 04:10:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 04:10:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-15 04:10:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 04:10:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-02-15 04:10:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-02-15 04:10:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-02-15 04:10:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-02-15 04:10:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-02-15 04:10:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-02-15 04:10:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-02-15 04:10:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-02-15 04:10:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-02-15 04:10:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-02-15 04:10:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-02-15 04:10:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-02-15 04:10:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-02-15 04:10:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-02-15 04:10:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-02-15 04:10:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 04:10:04,499 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-02-15 04:10:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 04:10:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 04:10:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 04:10:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 04:10:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 04:10:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 04:10:04,632 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 04:10:04,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 04:10:04,733 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 04:10:04,834 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-02-15 04:10:04,835 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-02-15 04:10:04,839 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 04:10:04,877 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-02-15 04:10:04,877 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-02-15 04:10:04,939 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 04:10:04,954 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-02-15 04:10:04,954 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-02-15 04:10:04,964 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 04:10:05,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-02-15 04:10:05,056 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-02-15 04:10:05,060 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 04:10:05,081 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-02-15 04:10:05,081 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-02-15 04:10:05,087 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 04:10:05,105 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-02-15 04:10:05,105 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-02-15 04:10:05,128 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 04:10:05,139 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 04:10:05,139 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-15 04:10:05,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 04:10:05 BoogieIcfgContainer [2022-02-15 04:10:05,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 04:10:05,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 04:10:05,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 04:10:05,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 04:10:05,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 04:10:04" (1/3) ... [2022-02-15 04:10:05,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e668608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 04:10:05, skipping insertion in model container [2022-02-15 04:10:05,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 04:10:04" (2/3) ... [2022-02-15 04:10:05,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e668608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 04:10:05, skipping insertion in model container [2022-02-15 04:10:05,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 04:10:05" (3/3) ... [2022-02-15 04:10:05,151 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2022-02-15 04:10:05,155 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 04:10:05,155 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 04:10:05,189 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 04:10:05,199 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=QVASR [2022-02-15 04:10:05,199 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 04:10:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 199 states have internal predecessors, (284), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-02-15 04:10:05,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 04:10:05,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:05,234 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:05,234 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:05,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:05,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1606654013, now seen corresponding path program 1 times [2022-02-15 04:10:05,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:05,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [654484588] [2022-02-15 04:10:05,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:05,292 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:05,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:05,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:05,533 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-15 04:10:05,535 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:05,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [654484588] [2022-02-15 04:10:05,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [654484588] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:05,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:05,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 04:10:05,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612751473] [2022-02-15 04:10:05,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:05,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 04:10:05,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:05,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 04:10:05,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-15 04:10:05,561 INFO L87 Difference]: Start difference. First operand has 239 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 199 states have internal predecessors, (284), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 04:10:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:06,254 INFO L93 Difference]: Finished difference Result 415 states and 624 transitions. [2022-02-15 04:10:06,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 04:10:06,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-02-15 04:10:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:06,264 INFO L225 Difference]: With dead ends: 415 [2022-02-15 04:10:06,264 INFO L226 Difference]: Without dead ends: 256 [2022-02-15 04:10:06,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-15 04:10:06,269 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 173 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:06,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 446 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-15 04:10:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-02-15 04:10:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2022-02-15 04:10:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 189 states have internal predecessors, (260), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-15 04:10:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2022-02-15 04:10:06,335 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2022-02-15 04:10:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:06,336 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2022-02-15 04:10:06,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 04:10:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2022-02-15 04:10:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-15 04:10:06,337 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:06,337 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:06,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 04:10:06,337 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:06,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:06,338 INFO L85 PathProgramCache]: Analyzing trace with hash -584418248, now seen corresponding path program 1 times [2022-02-15 04:10:06,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:06,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1901358943] [2022-02-15 04:10:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:06,340 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:06,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:06,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:06,526 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-15 04:10:06,526 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:06,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1901358943] [2022-02-15 04:10:06,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1901358943] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:06,527 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:06,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 04:10:06,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805408311] [2022-02-15 04:10:06,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:06,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 04:10:06,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:06,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 04:10:06,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 04:10:06,530 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 04:10:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:06,972 INFO L93 Difference]: Finished difference Result 401 states and 553 transitions. [2022-02-15 04:10:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 04:10:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-15 04:10:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:06,975 INFO L225 Difference]: With dead ends: 401 [2022-02-15 04:10:06,975 INFO L226 Difference]: Without dead ends: 343 [2022-02-15 04:10:06,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-15 04:10:06,976 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 533 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:06,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 459 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 04:10:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-02-15 04:10:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2022-02-15 04:10:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 240 states have internal predecessors, (330), 37 states have call successors, (37), 23 states have call predecessors, (37), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) [2022-02-15 04:10:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2022-02-15 04:10:07,007 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2022-02-15 04:10:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:07,008 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2022-02-15 04:10:07,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 04:10:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2022-02-15 04:10:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-15 04:10:07,009 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:07,009 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:07,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 04:10:07,009 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:07,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1124228951, now seen corresponding path program 1 times [2022-02-15 04:10:07,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:07,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1701596789] [2022-02-15 04:10:07,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:07,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:07,012 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:07,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:07,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:07,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:07,112 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-15 04:10:07,113 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:07,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1701596789] [2022-02-15 04:10:07,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1701596789] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:07,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:07,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 04:10:07,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226446822] [2022-02-15 04:10:07,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:07,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 04:10:07,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:07,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 04:10:07,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 04:10:07,114 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 04:10:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:07,507 INFO L93 Difference]: Finished difference Result 478 states and 635 transitions. [2022-02-15 04:10:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 04:10:07,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-02-15 04:10:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:07,509 INFO L225 Difference]: With dead ends: 478 [2022-02-15 04:10:07,509 INFO L226 Difference]: Without dead ends: 362 [2022-02-15 04:10:07,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-15 04:10:07,511 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 406 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:07,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 358 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 04:10:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-02-15 04:10:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2022-02-15 04:10:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 279 states have internal predecessors, (385), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-02-15 04:10:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2022-02-15 04:10:07,534 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2022-02-15 04:10:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:07,534 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2022-02-15 04:10:07,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 04:10:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2022-02-15 04:10:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-15 04:10:07,535 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:07,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:07,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 04:10:07,536 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:07,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash 512919532, now seen corresponding path program 1 times [2022-02-15 04:10:07,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:07,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [916571810] [2022-02-15 04:10:07,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:07,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:07,538 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:07,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:07,633 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-15 04:10:07,633 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:07,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [916571810] [2022-02-15 04:10:07,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [916571810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:07,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:07,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 04:10:07,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364745027] [2022-02-15 04:10:07,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:07,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 04:10:07,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:07,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 04:10:07,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 04:10:07,635 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 04:10:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:08,035 INFO L93 Difference]: Finished difference Result 344 states and 464 transitions. [2022-02-15 04:10:08,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 04:10:08,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-02-15 04:10:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:08,046 INFO L225 Difference]: With dead ends: 344 [2022-02-15 04:10:08,046 INFO L226 Difference]: Without dead ends: 340 [2022-02-15 04:10:08,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-15 04:10:08,052 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 341 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:08,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 413 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 04:10:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-02-15 04:10:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-02-15 04:10:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 278 states have (on average 1.3776978417266188) internal successors, (383), 278 states have internal predecessors, (383), 32 states have call successors, (32), 23 states have call predecessors, (32), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-02-15 04:10:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2022-02-15 04:10:08,077 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2022-02-15 04:10:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:08,077 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2022-02-15 04:10:08,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 04:10:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2022-02-15 04:10:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-15 04:10:08,079 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:08,079 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:08,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 04:10:08,079 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:08,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash 708737618, now seen corresponding path program 1 times [2022-02-15 04:10:08,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:08,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1594114276] [2022-02-15 04:10:08,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:08,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:08,082 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:08,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:08,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:08,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:08,200 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-15 04:10:08,200 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:08,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1594114276] [2022-02-15 04:10:08,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1594114276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:08,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:08,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 04:10:08,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49572729] [2022-02-15 04:10:08,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:08,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 04:10:08,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:08,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 04:10:08,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-15 04:10:08,203 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-15 04:10:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:08,713 INFO L93 Difference]: Finished difference Result 385 states and 508 transitions. [2022-02-15 04:10:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 04:10:08,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-02-15 04:10:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:08,720 INFO L225 Difference]: With dead ends: 385 [2022-02-15 04:10:08,720 INFO L226 Difference]: Without dead ends: 319 [2022-02-15 04:10:08,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-15 04:10:08,724 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 597 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:08,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 518 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 04:10:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-02-15 04:10:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2022-02-15 04:10:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 29 states have call successors, (29), 21 states have call predecessors, (29), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) [2022-02-15 04:10:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2022-02-15 04:10:08,751 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2022-02-15 04:10:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:08,751 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2022-02-15 04:10:08,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-15 04:10:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2022-02-15 04:10:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-15 04:10:08,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:08,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:08,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 04:10:08,753 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:08,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1153649594, now seen corresponding path program 1 times [2022-02-15 04:10:08,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:08,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104341132] [2022-02-15 04:10:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:08,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:08,759 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:08,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:08,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:08,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:08,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-15 04:10:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:09,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 04:10:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:09,025 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-15 04:10:09,025 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:09,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104341132] [2022-02-15 04:10:09,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1104341132] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:09,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:09,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 04:10:09,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166796299] [2022-02-15 04:10:09,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:09,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 04:10:09,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:09,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 04:10:09,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-15 04:10:09,027 INFO L87 Difference]: Start difference. First operand 301 states and 402 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 04:10:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:10,046 INFO L93 Difference]: Finished difference Result 327 states and 430 transitions. [2022-02-15 04:10:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 04:10:10,047 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2022-02-15 04:10:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:10,048 INFO L225 Difference]: With dead ends: 327 [2022-02-15 04:10:10,048 INFO L226 Difference]: Without dead ends: 322 [2022-02-15 04:10:10,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-02-15 04:10:10,049 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 761 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:10,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 553 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 04:10:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-02-15 04:10:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 315. [2022-02-15 04:10:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 256 states have (on average 1.359375) internal successors, (348), 255 states have internal predecessors, (348), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-02-15 04:10:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 418 transitions. [2022-02-15 04:10:10,075 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 418 transitions. Word has length 45 [2022-02-15 04:10:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:10,076 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 418 transitions. [2022-02-15 04:10:10,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 04:10:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 418 transitions. [2022-02-15 04:10:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-15 04:10:10,077 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:10,077 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:10,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 04:10:10,077 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1782707845, now seen corresponding path program 1 times [2022-02-15 04:10:10,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:10,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1928531449] [2022-02-15 04:10:10,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:10,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:10,080 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:10,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:10,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:10,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-15 04:10:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:10,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 04:10:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:10,251 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-15 04:10:10,252 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:10,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1928531449] [2022-02-15 04:10:10,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1928531449] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:10,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:10,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 04:10:10,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462582497] [2022-02-15 04:10:10,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:10,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 04:10:10,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:10,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 04:10:10,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-15 04:10:10,253 INFO L87 Difference]: Start difference. First operand 315 states and 418 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 04:10:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:11,185 INFO L93 Difference]: Finished difference Result 327 states and 429 transitions. [2022-02-15 04:10:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 04:10:11,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-02-15 04:10:11,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:11,187 INFO L225 Difference]: With dead ends: 327 [2022-02-15 04:10:11,187 INFO L226 Difference]: Without dead ends: 322 [2022-02-15 04:10:11,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-02-15 04:10:11,188 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 1041 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:11,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1043 Valid, 660 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 04:10:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-02-15 04:10:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 316. [2022-02-15 04:10:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 256 states have internal predecessors, (349), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-02-15 04:10:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 419 transitions. [2022-02-15 04:10:11,213 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 419 transitions. Word has length 46 [2022-02-15 04:10:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:11,214 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 419 transitions. [2022-02-15 04:10:11,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 04:10:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 419 transitions. [2022-02-15 04:10:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-15 04:10:11,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:11,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:11,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 04:10:11,215 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:11,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash 359403676, now seen corresponding path program 1 times [2022-02-15 04:10:11,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:11,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1641910984] [2022-02-15 04:10:11,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:11,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:11,217 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-15 04:10:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-15 04:10:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,322 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-15 04:10:11,322 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:11,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1641910984] [2022-02-15 04:10:11,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1641910984] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:11,323 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:11,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 04:10:11,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321189591] [2022-02-15 04:10:11,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:11,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 04:10:11,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:11,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 04:10:11,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-15 04:10:11,324 INFO L87 Difference]: Start difference. First operand 316 states and 419 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 04:10:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:11,619 INFO L93 Difference]: Finished difference Result 330 states and 436 transitions. [2022-02-15 04:10:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 04:10:11,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-02-15 04:10:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:11,621 INFO L225 Difference]: With dead ends: 330 [2022-02-15 04:10:11,621 INFO L226 Difference]: Without dead ends: 102 [2022-02-15 04:10:11,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-02-15 04:10:11,622 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 579 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:11,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 353 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 04:10:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-15 04:10:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-02-15 04:10:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-15 04:10:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2022-02-15 04:10:11,631 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 47 [2022-02-15 04:10:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:11,631 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2022-02-15 04:10:11,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-15 04:10:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-02-15 04:10:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-15 04:10:11,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:11,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:11,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 04:10:11,632 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:11,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash -803867800, now seen corresponding path program 1 times [2022-02-15 04:10:11,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:11,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [441988804] [2022-02-15 04:10:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:11,634 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-15 04:10:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-15 04:10:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:11,755 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-15 04:10:11,756 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:11,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [441988804] [2022-02-15 04:10:11,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [441988804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:11,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:11,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 04:10:11,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595783359] [2022-02-15 04:10:11,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:11,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 04:10:11,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:11,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 04:10:11,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-15 04:10:11,757 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 04:10:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:11,956 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2022-02-15 04:10:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 04:10:11,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2022-02-15 04:10:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:11,957 INFO L225 Difference]: With dead ends: 130 [2022-02-15 04:10:11,957 INFO L226 Difference]: Without dead ends: 100 [2022-02-15 04:10:11,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-02-15 04:10:11,958 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 74 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:11,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 218 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:10:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-15 04:10:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-02-15 04:10:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-15 04:10:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-02-15 04:10:11,967 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2022-02-15 04:10:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:11,967 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-02-15 04:10:11,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 04:10:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-02-15 04:10:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-15 04:10:11,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:11,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:11,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 04:10:11,968 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1055877385, now seen corresponding path program 1 times [2022-02-15 04:10:11,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:11,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580226162] [2022-02-15 04:10:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:11,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:11,970 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 04:10:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,114 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-15 04:10:12,114 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:12,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580226162] [2022-02-15 04:10:12,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1580226162] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:12,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:12,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 04:10:12,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072208437] [2022-02-15 04:10:12,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:12,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 04:10:12,115 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:12,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 04:10:12,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-15 04:10:12,115 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 04:10:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:12,319 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2022-02-15 04:10:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 04:10:12,320 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-02-15 04:10:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:12,320 INFO L225 Difference]: With dead ends: 152 [2022-02-15 04:10:12,320 INFO L226 Difference]: Without dead ends: 111 [2022-02-15 04:10:12,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-02-15 04:10:12,322 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:12,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 353 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 04:10:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-15 04:10:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-02-15 04:10:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.1875) internal successors, (95), 81 states have internal predecessors, (95), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-15 04:10:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-02-15 04:10:12,336 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2022-02-15 04:10:12,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:12,336 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-02-15 04:10:12,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 04:10:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-02-15 04:10:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-15 04:10:12,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:12,337 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:12,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 04:10:12,337 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:12,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:12,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1324274632, now seen corresponding path program 1 times [2022-02-15 04:10:12,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:12,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884235614] [2022-02-15 04:10:12,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:12,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:12,339 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 04:10:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,503 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-15 04:10:12,503 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:12,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884235614] [2022-02-15 04:10:12,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1884235614] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:12,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:12,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 04:10:12,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615626706] [2022-02-15 04:10:12,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:12,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 04:10:12,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:12,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 04:10:12,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-15 04:10:12,505 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 04:10:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:12,714 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-02-15 04:10:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 04:10:12,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-02-15 04:10:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:12,715 INFO L225 Difference]: With dead ends: 116 [2022-02-15 04:10:12,715 INFO L226 Difference]: Without dead ends: 109 [2022-02-15 04:10:12,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-02-15 04:10:12,716 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 59 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:12,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 316 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:10:12,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-15 04:10:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-02-15 04:10:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 82 states have internal predecessors, (96), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-15 04:10:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2022-02-15 04:10:12,726 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2022-02-15 04:10:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:12,726 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2022-02-15 04:10:12,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 04:10:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2022-02-15 04:10:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-15 04:10:12,727 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:12,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:12,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 04:10:12,727 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:12,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337179, now seen corresponding path program 1 times [2022-02-15 04:10:12,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:12,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2000504560] [2022-02-15 04:10:12,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:12,729 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 04:10:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:12,863 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-15 04:10:12,863 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:12,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2000504560] [2022-02-15 04:10:12,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2000504560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:12,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:12,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 04:10:12,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932611562] [2022-02-15 04:10:12,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:12,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 04:10:12,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 04:10:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-15 04:10:12,864 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 04:10:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:13,030 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2022-02-15 04:10:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 04:10:13,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-02-15 04:10:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:13,031 INFO L225 Difference]: With dead ends: 142 [2022-02-15 04:10:13,031 INFO L226 Difference]: Without dead ends: 100 [2022-02-15 04:10:13,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-15 04:10:13,032 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:13,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 289 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:10:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-15 04:10:13,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-02-15 04:10:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.16) internal successors, (87), 76 states have internal predecessors, (87), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-15 04:10:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2022-02-15 04:10:13,049 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 58 [2022-02-15 04:10:13,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:13,050 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2022-02-15 04:10:13,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-15 04:10:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-02-15 04:10:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-15 04:10:13,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:13,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:13,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 04:10:13,051 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:13,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1424142412, now seen corresponding path program 1 times [2022-02-15 04:10:13,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:13,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2040626469] [2022-02-15 04:10:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:13,052 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 04:10:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 04:10:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,197 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-15 04:10:13,197 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:13,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2040626469] [2022-02-15 04:10:13,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2040626469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:13,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:13,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 04:10:13,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454429933] [2022-02-15 04:10:13,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:13,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 04:10:13,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:13,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 04:10:13,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-15 04:10:13,199 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 04:10:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:13,450 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2022-02-15 04:10:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 04:10:13,451 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2022-02-15 04:10:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:13,451 INFO L225 Difference]: With dead ends: 128 [2022-02-15 04:10:13,451 INFO L226 Difference]: Without dead ends: 92 [2022-02-15 04:10:13,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-02-15 04:10:13,452 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 152 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:13,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 234 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:10:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-15 04:10:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-15 04:10:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-15 04:10:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-02-15 04:10:13,461 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 62 [2022-02-15 04:10:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:13,461 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-02-15 04:10:13,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 04:10:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-02-15 04:10:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-15 04:10:13,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:13,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:13,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 04:10:13,462 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash -119468725, now seen corresponding path program 1 times [2022-02-15 04:10:13,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:13,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [270906775] [2022-02-15 04:10:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:13,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:13,464 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 04:10:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 04:10:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,568 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-15 04:10:13,568 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:13,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [270906775] [2022-02-15 04:10:13,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [270906775] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:13,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:13,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 04:10:13,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083203107] [2022-02-15 04:10:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:13,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 04:10:13,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 04:10:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 04:10:13,569 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 04:10:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:13,669 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2022-02-15 04:10:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 04:10:13,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-02-15 04:10:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:13,670 INFO L225 Difference]: With dead ends: 126 [2022-02-15 04:10:13,670 INFO L226 Difference]: Without dead ends: 98 [2022-02-15 04:10:13,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 04:10:13,670 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:13,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 219 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:10:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-15 04:10:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2022-02-15 04:10:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 72 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-15 04:10:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-02-15 04:10:13,679 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 64 [2022-02-15 04:10:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:13,680 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-02-15 04:10:13,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 04:10:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-02-15 04:10:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-15 04:10:13,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:13,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:13,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 04:10:13,680 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:13,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash -706274739, now seen corresponding path program 1 times [2022-02-15 04:10:13,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:13,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1093229734] [2022-02-15 04:10:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:13,682 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 04:10:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 04:10:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:13,792 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-15 04:10:13,792 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:13,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1093229734] [2022-02-15 04:10:13,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1093229734] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:13,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:13,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 04:10:13,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497592226] [2022-02-15 04:10:13,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:13,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 04:10:13,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:13,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 04:10:13,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 04:10:13,793 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 04:10:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:13,949 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-02-15 04:10:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 04:10:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-02-15 04:10:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:13,950 INFO L225 Difference]: With dead ends: 111 [2022-02-15 04:10:13,951 INFO L226 Difference]: Without dead ends: 106 [2022-02-15 04:10:13,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-15 04:10:13,951 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 79 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:13,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 204 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:10:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-15 04:10:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2022-02-15 04:10:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 74 states have internal predecessors, (82), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-15 04:10:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-02-15 04:10:13,979 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2022-02-15 04:10:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:13,979 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-02-15 04:10:13,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 04:10:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-02-15 04:10:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-15 04:10:13,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:13,980 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:13,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 04:10:13,980 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash -348732964, now seen corresponding path program 1 times [2022-02-15 04:10:13,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:13,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2089814633] [2022-02-15 04:10:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:13,982 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 04:10:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 04:10:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,136 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-15 04:10:14,136 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:14,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2089814633] [2022-02-15 04:10:14,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2089814633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:14,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:14,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 04:10:14,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463970919] [2022-02-15 04:10:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:14,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 04:10:14,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:14,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 04:10:14,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-15 04:10:14,138 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 04:10:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:14,309 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-02-15 04:10:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 04:10:14,309 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-02-15 04:10:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:14,311 INFO L225 Difference]: With dead ends: 110 [2022-02-15 04:10:14,311 INFO L226 Difference]: Without dead ends: 103 [2022-02-15 04:10:14,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-02-15 04:10:14,312 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 109 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:14,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 353 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:10:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-15 04:10:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2022-02-15 04:10:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 74 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-15 04:10:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-02-15 04:10:14,323 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 64 [2022-02-15 04:10:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:14,323 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-02-15 04:10:14,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 04:10:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-02-15 04:10:14,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-15 04:10:14,324 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:14,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:14,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 04:10:14,324 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:14,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:14,325 INFO L85 PathProgramCache]: Analyzing trace with hash -657469950, now seen corresponding path program 1 times [2022-02-15 04:10:14,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:14,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1292279527] [2022-02-15 04:10:14,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:14,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:14,327 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 04:10:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 04:10:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,494 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-15 04:10:14,494 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:14,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1292279527] [2022-02-15 04:10:14,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1292279527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:14,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:14,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 04:10:14,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147897509] [2022-02-15 04:10:14,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:14,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 04:10:14,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:14,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 04:10:14,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-15 04:10:14,496 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 04:10:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:14,838 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-02-15 04:10:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-15 04:10:14,838 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-15 04:10:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:14,839 INFO L225 Difference]: With dead ends: 100 [2022-02-15 04:10:14,839 INFO L226 Difference]: Without dead ends: 82 [2022-02-15 04:10:14,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-02-15 04:10:14,840 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 182 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:14,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 200 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 04:10:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-15 04:10:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-02-15 04:10:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1) internal successors, (66), 61 states have internal predecessors, (66), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-15 04:10:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-02-15 04:10:14,849 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2022-02-15 04:10:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:14,849 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-02-15 04:10:14,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 04:10:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-02-15 04:10:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-15 04:10:14,849 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:14,850 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:14,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 04:10:14,850 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1066121988, now seen corresponding path program 1 times [2022-02-15 04:10:14,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:14,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1778879629] [2022-02-15 04:10:14,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:14,851 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 04:10:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 04:10:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:14,968 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-15 04:10:14,968 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:14,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1778879629] [2022-02-15 04:10:14,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1778879629] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:14,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:14,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 04:10:14,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68873647] [2022-02-15 04:10:14,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:14,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 04:10:14,969 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:14,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 04:10:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 04:10:14,969 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 04:10:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:15,135 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-02-15 04:10:15,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 04:10:15,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-15 04:10:15,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:15,136 INFO L225 Difference]: With dead ends: 98 [2022-02-15 04:10:15,136 INFO L226 Difference]: Without dead ends: 78 [2022-02-15 04:10:15,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-02-15 04:10:15,137 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 70 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:15,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 194 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:10:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-15 04:10:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-15 04:10:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-15 04:10:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-02-15 04:10:15,145 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2022-02-15 04:10:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:15,146 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-02-15 04:10:15,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 04:10:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-02-15 04:10:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-15 04:10:15,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:15,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:15,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 04:10:15,146 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:15,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1874002193, now seen corresponding path program 1 times [2022-02-15 04:10:15,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:15,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272432200] [2022-02-15 04:10:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:15,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:15,148 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 04:10:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 04:10:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,307 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-15 04:10:15,307 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:15,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272432200] [2022-02-15 04:10:15,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [272432200] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:15,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:15,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 04:10:15,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780482295] [2022-02-15 04:10:15,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:15,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 04:10:15,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 04:10:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-15 04:10:15,308 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 04:10:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:15,450 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-02-15 04:10:15,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 04:10:15,451 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 65 [2022-02-15 04:10:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:15,451 INFO L225 Difference]: With dead ends: 87 [2022-02-15 04:10:15,451 INFO L226 Difference]: Without dead ends: 78 [2022-02-15 04:10:15,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-02-15 04:10:15,452 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 77 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:15,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 258 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:10:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-15 04:10:15,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-15 04:10:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-15 04:10:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-02-15 04:10:15,461 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2022-02-15 04:10:15,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:15,461 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-02-15 04:10:15,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-15 04:10:15,461 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-02-15 04:10:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-15 04:10:15,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 04:10:15,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:15,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 04:10:15,462 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 04:10:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 04:10:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2045810187, now seen corresponding path program 1 times [2022-02-15 04:10:15,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 04:10:15,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696551542] [2022-02-15 04:10:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 04:10:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 04:10:15,464 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 04:10:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 04:10:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 04:10:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 04:10:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-15 04:10:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 04:10:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 04:10:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-15 04:10:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-15 04:10:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 04:10:15,614 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-15 04:10:15,614 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 04:10:15,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696551542] [2022-02-15 04:10:15,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [696551542] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 04:10:15,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 04:10:15,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 04:10:15,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783609971] [2022-02-15 04:10:15,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 04:10:15,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 04:10:15,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 04:10:15,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 04:10:15,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-15 04:10:15,616 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-15 04:10:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 04:10:15,756 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-02-15 04:10:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 04:10:15,757 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2022-02-15 04:10:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 04:10:15,757 INFO L225 Difference]: With dead ends: 78 [2022-02-15 04:10:15,757 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 04:10:15,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-02-15 04:10:15,758 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 31 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 04:10:15,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 187 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 04:10:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 04:10:15,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 04:10:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 04:10:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 04:10:15,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-02-15 04:10:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 04:10:15,759 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 04:10:15,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-15 04:10:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 04:10:15,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 04:10:15,761 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 04:10:15,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 04:10:15,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-15 04:10:24,185 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-02-15 04:10:24,191 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-02-15 04:10:24,191 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-02-15 04:10:24,191 INFO L854 garLoopResultBuilder]: At program point L624(line 624) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-02-15 04:10:24,191 INFO L854 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 618 628) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-02-15 04:10:24,191 INFO L854 garLoopResultBuilder]: At program point L624-1(line 624) the Hoare annotation is: (or (= ~setEventCalled~0 1) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-02-15 04:10:24,191 INFO L854 garLoopResultBuilder]: At program point KbFilter_CompleteFINAL(lines 618 628) the Hoare annotation is: (or (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (let ((.cse0 (+ 1073741802 |KbFilter_Complete_#res|))) (and (<= .cse0 0) (= ~setEventCalled~0 1) (<= 0 .cse0))) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-02-15 04:10:24,192 INFO L854 garLoopResultBuilder]: At program point KbFilter_CompleteEXIT(lines 618 628) the Hoare annotation is: (or (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (let ((.cse0 (+ 1073741802 |KbFilter_Complete_#res|))) (and (<= .cse0 0) (= ~setEventCalled~0 1) (<= 0 .cse0))) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-02-15 04:10:24,195 INFO L854 garLoopResultBuilder]: At program point _BLAST_initFINAL(lines 57 78) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 6 ~MPR3~0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,195 INFO L854 garLoopResultBuilder]: At program point _BLAST_initENTRY(lines 57 78) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= ~s~0 ~DC~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~s~0 ~NP~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,195 INFO L854 garLoopResultBuilder]: At program point _BLAST_initEXIT(lines 57 78) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 6 ~MPR3~0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,195 INFO L854 garLoopResultBuilder]: At program point L415(lines 415 419) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= ~s~0 ~NP~0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,195 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 295 466) the Hoare annotation is: true [2022-02-15 04:10:24,195 INFO L854 garLoopResultBuilder]: At program point L374(lines 373 408) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,195 INFO L854 garLoopResultBuilder]: At program point L432(lines 432 459) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,196 INFO L854 garLoopResultBuilder]: At program point L358(lines 358 411) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,196 INFO L861 garLoopResultBuilder]: At program point L449(lines 449 457) the Hoare annotation is: true [2022-02-15 04:10:24,196 INFO L854 garLoopResultBuilder]: At program point L441(lines 432 459) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,196 INFO L854 garLoopResultBuilder]: At program point L433(lines 433 439) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,196 INFO L854 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,196 INFO L854 garLoopResultBuilder]: At program point L359(lines 358 411) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,196 INFO L861 garLoopResultBuilder]: At program point L450(lines 450 452) the Hoare annotation is: true [2022-02-15 04:10:24,196 INFO L854 garLoopResultBuilder]: At program point L376(lines 375 408) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,196 INFO L854 garLoopResultBuilder]: At program point L434(lines 434 436) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,196 INFO L854 garLoopResultBuilder]: At program point L368(lines 368 409) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,196 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 295 466) the Hoare annotation is: true [2022-02-15 04:10:24,196 INFO L854 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,196 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 295 466) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= |old(~Executive~0)| ~Executive~0) (<= ~s~0 ~DC~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~s~0 ~NP~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~DevicePowerState~0)| ~DevicePowerState~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L443(lines 443 447) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L344(lines 330 413) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L369(lines 368 409) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L328(line 328) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (<= ~s~0 ~DC~0) (= main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L328-1(lines 324 465) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L353(lines 353 412) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L395(line 395) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L354(lines 353 412) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L429(lines 422 462) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L363(lines 363 410) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L330(lines 324 465) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,197 INFO L861 garLoopResultBuilder]: At program point L454(lines 454 456) the Hoare annotation is: true [2022-02-15 04:10:24,197 INFO L854 garLoopResultBuilder]: At program point L421(lines 414 463) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point L380(line 380) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point L339(lines 339 342) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point L339-2(lines 339 342) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,198 INFO L861 garLoopResultBuilder]: At program point L430(lines 414 463) the Hoare annotation is: true [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point L364(lines 363 410) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point L373(lines 373 408) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point L431(lines 431 460) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point L423(lines 423 427) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point L390(line 390) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (let ((.cse0 (= main_~status~1 0))) (or (and (= ~compRegistered~0 1) .cse0) (and .cse0 (<= ~compRegistered~0 0)))) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point L475(line 475) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point L475-1(lines 467 480) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~MPR1~0 ~s~0) (not (= ~compRegistered~0 1))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 467 480) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point stubMoreProcessingRequiredEXIT(lines 467 480) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~MPR1~0 ~s~0) (not (= ~compRegistered~0 1))) [2022-02-15 04:10:24,198 INFO L854 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,199 INFO L861 garLoopResultBuilder]: At program point PoCallDriverEXIT(lines 745 821) the Hoare annotation is: true [2022-02-15 04:10:24,199 INFO L854 garLoopResultBuilder]: At program point L754(lines 754 766) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,199 INFO L854 garLoopResultBuilder]: At program point L754-1(lines 754 766) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,199 INFO L854 garLoopResultBuilder]: At program point L775(lines 774 791) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,199 INFO L854 garLoopResultBuilder]: At program point L800(lines 800 806) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,201 INFO L861 garLoopResultBuilder]: At program point PoCallDriverFINAL(lines 745 821) the Hoare annotation is: true [2022-02-15 04:10:24,201 INFO L854 garLoopResultBuilder]: At program point PoCallDriverENTRY(lines 745 821) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L809(lines 809 816) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L797(lines 797 817) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L760(lines 760 764) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L789(lines 753 820) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L756(line 756) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L756-1(line 756) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L861 garLoopResultBuilder]: At program point L814-1(lines 793 818) the Hoare annotation is: true [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L777(lines 776 791) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L769(lines 769 792) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L774(lines 774 791) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L770(lines 769 792) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L854 garLoopResultBuilder]: At program point L638(lines 638 656) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,202 INFO L861 garLoopResultBuilder]: At program point KbFilter_CreateCloseEXIT(lines 629 664) the Hoare annotation is: true [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L645(lines 638 656) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L641(lines 641 655) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point KbFilter_CreateCloseENTRY(lines 629 664) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L660(line 660) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L861 garLoopResultBuilder]: At program point L660-1(line 660) the Hoare annotation is: true [2022-02-15 04:10:24,203 INFO L861 garLoopResultBuilder]: At program point KbFilter_CreateCloseFINAL(lines 629 664) the Hoare annotation is: true [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L644(lines 644 654) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L956(lines 956 958) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L956-2(lines 934 971) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L861 garLoopResultBuilder]: At program point KbFilter_InternIoCtlEXIT(lines 822 1007) the Hoare annotation is: true [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L940(lines 940 943) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L903(lines 903 982) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L924(lines 924 976) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L891(lines 891 986) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,203 INFO L854 garLoopResultBuilder]: At program point L883(lines 883 988) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L875(lines 875 990) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L861 garLoopResultBuilder]: At program point L1003-1(line 1003) the Hoare annotation is: true [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L896(lines 896 984) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L892(lines 891 986) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L917(lines 917 978) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L884(lines 883 988) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L934(lines 934 973) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L959-1(lines 959 961) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point KbFilter_InternIoCtlENTRY(lines 822 1007) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L910(lines 910 980) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L972(lines 867 1006) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L935(lines 875 990) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L997(line 997) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,204 INFO L854 garLoopResultBuilder]: At program point L997-1(line 997) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= 2 ~s~0) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,205 INFO L861 garLoopResultBuilder]: At program point KbFilter_InternIoCtlFINAL(lines 822 1007) the Hoare annotation is: true [2022-02-15 04:10:24,205 INFO L854 garLoopResultBuilder]: At program point L931(lines 931 974) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,205 INFO L854 garLoopResultBuilder]: At program point L603(lines 603 615) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-02-15 04:10:24,205 INFO L854 garLoopResultBuilder]: At program point KeWaitForSingleObjectEXIT(lines 576 617) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-02-15 04:10:24,205 INFO L854 garLoopResultBuilder]: At program point L589(lines 581 600) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-02-15 04:10:24,205 INFO L854 garLoopResultBuilder]: At program point L581(lines 581 600) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 04:10:24,205 INFO L854 garLoopResultBuilder]: At program point L606(lines 605 615) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-02-15 04:10:24,205 INFO L854 garLoopResultBuilder]: At program point KeWaitForSingleObjectFINAL(lines 576 617) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-02-15 04:10:24,205 INFO L854 garLoopResultBuilder]: At program point L604(lines 603 615) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-02-15 04:10:24,205 INFO L854 garLoopResultBuilder]: At program point L596(line 596) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-02-15 04:10:24,205 INFO L854 garLoopResultBuilder]: At program point L594(lines 594 598) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-02-15 04:10:24,205 INFO L854 garLoopResultBuilder]: At program point L594-1(lines 581 600) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-02-15 04:10:24,206 INFO L854 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 576 617) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 04:10:24,206 INFO L854 garLoopResultBuilder]: At program point L582(lines 582 587) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 04:10:24,206 INFO L854 garLoopResultBuilder]: At program point L562-1(lines 554 567) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (= 2 ~s~0)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,206 INFO L854 garLoopResultBuilder]: At program point L558(lines 558 564) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,206 INFO L854 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 554 567) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,206 INFO L854 garLoopResultBuilder]: At program point IofCompleteRequestEXIT(lines 554 567) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (= 2 ~s~0)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,206 INFO L854 garLoopResultBuilder]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0)))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,206 INFO L854 garLoopResultBuilder]: At program point L258-1(lines 254 260) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,206 INFO L854 garLoopResultBuilder]: At program point L159(lines 159 274) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,207 INFO L854 garLoopResultBuilder]: At program point L126(lines 126 285) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,207 INFO L854 garLoopResultBuilder]: At program point L184(line 184) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,207 INFO L854 garLoopResultBuilder]: At program point L201(lines 201 203) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (or (not (= ~NP~0 1)) (and .cse0 (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and .cse0 (= ~s~0 |old(~s~0)|)))) [2022-02-15 04:10:24,207 INFO L854 garLoopResultBuilder]: At program point L168(lines 168 271) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,207 INFO L854 garLoopResultBuilder]: At program point L201-1(lines 201 203) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,207 INFO L854 garLoopResultBuilder]: At program point L135(lines 135 282) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,207 INFO L854 garLoopResultBuilder]: At program point L218(line 218) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,207 INFO L854 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,207 INFO L854 garLoopResultBuilder]: At program point L243-1(lines 239 245) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,207 INFO L854 garLoopResultBuilder]: At program point L177(lines 177 189) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L144(lines 144 279) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L111(lines 111 290) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L227(line 227) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L194(lines 194 195) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~s~0 |old(~s~0)|))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L227-1(lines 223 229) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L194-1(lines 194 195) the Hoare annotation is: (let ((.cse1 (= KbFilter_PnP_~status~0 0)) (.cse0 (= ~compRegistered~0 1))) (or (and .cse0 (= ~setEventCalled~0 1) (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|) .cse1 (= ~MPR3~0 ~s~0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 (= ~s~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (and .cse0 (= |KbFilter_PnP_#t~ret12| 0) (= ~s~0 ~NP~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L153(lines 153 276) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L120(lines 120 287) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point KbFilter_PnPEXIT(lines 81 294) the Hoare annotation is: (or (= ~compRegistered~0 1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (<= ~compRegistered~0 0) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L112(lines 111 290) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L269(lines 172 270) the Hoare annotation is: (or (= ~compRegistered~0 1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (<= ~compRegistered~0 0) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L162(lines 162 273) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L129(lines 129 284) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,208 INFO L854 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point KbFilter_PnPENTRY(lines 81 294) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L171(lines 117 288) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L138(lines 138 281) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point KbFilter_PnPFINAL(lines 81 294) the Hoare annotation is: (or (= ~compRegistered~0 1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (<= ~compRegistered~0 0) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L147(lines 147 278) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L114(lines 114 289) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L156(lines 156 275) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L123(lines 123 286) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L115(lines 114 289) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L239(lines 239 245) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L264(lines 264 265) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L264-1(lines 264 265) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (= ~compRegistered~0 0)) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L165(lines 165 272) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,209 INFO L854 garLoopResultBuilder]: At program point L132(lines 132 283) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,210 INFO L854 garLoopResultBuilder]: At program point L223(lines 223 229) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,210 INFO L854 garLoopResultBuilder]: At program point L182(lines 182 188) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,211 INFO L854 garLoopResultBuilder]: At program point L182-1(lines 177 189) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~s~0 |old(~s~0)|))) [2022-02-15 04:10:24,211 INFO L854 garLoopResultBuilder]: At program point L207(lines 207 213) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,211 INFO L854 garLoopResultBuilder]: At program point L141(lines 141 280) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,211 INFO L854 garLoopResultBuilder]: At program point L108(lines 108 291) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,211 INFO L854 garLoopResultBuilder]: At program point L199(lines 199 205) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (or (not (= ~NP~0 1)) (and .cse0 (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and .cse0 (= ~s~0 |old(~s~0)|)))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point L199-2(lines 172 268) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point L249(line 249) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point L249-1(line 249) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (= ~compRegistered~0 0)) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point L150(lines 150 277) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point L117(lines 117 288) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point L208(lines 208 212) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point L109(lines 108 291) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point L233(lines 233 234) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point L233-1(lines 233 234) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (= ~compRegistered~0 0)) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point L258(line 258) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point KeSetEventENTRY(lines 568 575) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point KeSetEventFINAL(lines 568 575) the Hoare annotation is: (or (= ~setEventCalled~0 1) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point KeSetEventEXIT(lines 568 575) the Hoare annotation is: (or (= ~setEventCalled~0 1) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-02-15 04:10:24,212 INFO L854 garLoopResultBuilder]: At program point L700(lines 700 729) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L861 garLoopResultBuilder]: At program point KbFilter_PowerEXIT(lines 689 744) the Hoare annotation is: true [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point L709(lines 709 726) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point L740(line 740) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point KbFilter_PowerENTRY(lines 689 744) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L861 garLoopResultBuilder]: At program point L740-1(line 740) the Hoare annotation is: true [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point L703(lines 703 728) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point L701(lines 700 729) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point L734-1(lines 730 736) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point L724(lines 699 743) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L861 garLoopResultBuilder]: At program point KbFilter_PowerFINAL(lines 689 744) the Hoare annotation is: true [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point L706(lines 706 727) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point stub_driver_initEXIT(lines 43 56) the Hoare annotation is: (or (and (not (= ~pended~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point stub_driver_initENTRY(lines 43 56) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L854 garLoopResultBuilder]: At program point stub_driver_initFINAL(lines 43 56) the Hoare annotation is: (or (and (not (= ~pended~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,213 INFO L861 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2022-02-15 04:10:24,213 INFO L861 garLoopResultBuilder]: At program point errorFnFINAL(lines 1009 1016) the Hoare annotation is: true [2022-02-15 04:10:24,214 INFO L861 garLoopResultBuilder]: At program point errorFnEXIT(lines 1009 1016) the Hoare annotation is: true [2022-02-15 04:10:24,214 INFO L861 garLoopResultBuilder]: At program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) the Hoare annotation is: true [2022-02-15 04:10:24,214 INFO L854 garLoopResultBuilder]: At program point L510(lines 509 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-02-15 04:10:24,214 INFO L854 garLoopResultBuilder]: At program point L532(lines 532 549) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0) .cse0) (not (= ~NP~0 1)) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse0 .cse1) (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 5 ~MPR1~0)) .cse3 .cse4 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse0 .cse1) (not (<= 6 ~MPR3~0)) .cse5 (not (= ~compRegistered~0 1)))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-02-15 04:10:24,214 INFO L854 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 481 553) the Hoare annotation is: (let ((.cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 (not (<= 5 ~MPR1~0)) .cse2 .cse3 (not (<= 6 ~MPR3~0)) .cse4 (not (= ~compRegistered~0 1))) (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-02-15 04:10:24,214 INFO L854 garLoopResultBuilder]: At program point L495(lines 495 499) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,214 INFO L854 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (not (= ~NP~0 1)) (and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0) .cse0 .cse1) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse0 .cse1) (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 5 ~MPR1~0)) .cse3 .cse4 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse0 .cse1) (not (<= 6 ~MPR3~0)) .cse5 (not (= ~compRegistered~0 1)))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-02-15 04:10:24,214 INFO L854 garLoopResultBuilder]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,214 INFO L854 garLoopResultBuilder]: At program point L491-1(line 491) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~setEventCalled~0 1) (= (+ |IofCallDriver_#t~ret37| 1073741802) 0) (= ~s~0 |old(~s~0)|)) .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,214 INFO L854 garLoopResultBuilder]: At program point IofCallDriverFINAL(lines 481 553) the Hoare annotation is: (let ((.cse0 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (.cse1 (= ~s~0 ~NP~0))) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259) (<= 259 IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse0) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and .cse1 .cse0) (and .cse1 (<= IofCallDriver_~returnVal2~0 0) (<= 0 |IofCallDriver_#res|) (<= 0 IofCallDriver_~returnVal2~0) (<= |IofCallDriver_#res| 0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)))) [2022-02-15 04:10:24,214 INFO L854 garLoopResultBuilder]: At program point L512(lines 511 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point L541(lines 541 548) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point L504(lines 504 527) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point IofCallDriverEXIT(lines 481 553) the Hoare annotation is: (let ((.cse0 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (.cse1 (= ~s~0 ~NP~0))) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259) (<= 259 IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse0) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and .cse1 .cse0) (and .cse1 (<= IofCallDriver_~returnVal2~0 0) (<= 0 |IofCallDriver_#res|) (<= 0 IofCallDriver_~returnVal2~0) (<= |IofCallDriver_#res| 0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point L533(lines 533 539) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0) .cse0) (not (= ~NP~0 1)) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse0 .cse1) (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 5 ~MPR1~0)) .cse3 .cse4 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse0 .cse1) (not (<= 6 ~MPR3~0)) .cse5 (not (= ~compRegistered~0 1)))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point L546(line 546) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point L546-1(lines 528 550) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (not (= ~NP~0 1)) (and .cse0 (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse1) (not (<= 4 ~SKIP2~0)) (and .cse0 .cse1) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point L509(lines 509 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point L505(lines 504 527) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point L489(lines 489 501) the Hoare annotation is: (let ((.cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 (not (<= 5 ~MPR1~0)) .cse2 .cse3 (not (<= 6 ~MPR3~0)) .cse4 (not (= ~compRegistered~0 1))) (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point L489-1(lines 489 501) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-02-15 04:10:24,215 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~DevicePowerState~0)| ~DevicePowerState~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-15 04:10:24,216 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-02-15 04:10:24,216 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-15 04:10:24,216 INFO L854 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-02-15 04:10:24,216 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-15 04:10:24,216 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-15 04:10:24,216 INFO L854 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughENTRY(lines 665 688) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,216 INFO L854 garLoopResultBuilder]: At program point L684(line 684) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,216 INFO L861 garLoopResultBuilder]: At program point L684-1(line 684) the Hoare annotation is: true [2022-02-15 04:10:24,216 INFO L861 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughFINAL(lines 665 688) the Hoare annotation is: true [2022-02-15 04:10:24,216 INFO L854 garLoopResultBuilder]: At program point L678(line 678) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,216 INFO L854 garLoopResultBuilder]: At program point L678-1(lines 674 680) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,216 INFO L861 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughEXIT(lines 665 688) the Hoare annotation is: true [2022-02-15 04:10:24,216 INFO L854 garLoopResultBuilder]: At program point L674(lines 674 680) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-02-15 04:10:24,218 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 04:10:24,219 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 04:10:24,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 04:10:24 BoogieIcfgContainer [2022-02-15 04:10:24,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 04:10:24,267 INFO L158 Benchmark]: Toolchain (without parser) took 20230.34ms. Allocated memory was 184.5MB in the beginning and 395.3MB in the end (delta: 210.8MB). Free memory was 128.1MB in the beginning and 205.6MB in the end (delta: -77.5MB). Peak memory consumption was 207.7MB. Max. memory is 8.0GB. [2022-02-15 04:10:24,267 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory was 145.5MB in the beginning and 145.4MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 04:10:24,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.23ms. Allocated memory was 184.5MB in the beginning and 273.7MB in the end (delta: 89.1MB). Free memory was 127.9MB in the beginning and 238.8MB in the end (delta: -110.9MB). Peak memory consumption was 16.4MB. Max. memory is 8.0GB. [2022-02-15 04:10:24,267 INFO L158 Benchmark]: Boogie Preprocessor took 60.65ms. Allocated memory is still 273.7MB. Free memory was 238.8MB in the beginning and 236.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 04:10:24,267 INFO L158 Benchmark]: RCFGBuilder took 720.82ms. Allocated memory is still 273.7MB. Free memory was 236.2MB in the beginning and 201.1MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-02-15 04:10:24,268 INFO L158 Benchmark]: TraceAbstraction took 19121.75ms. Allocated memory was 273.7MB in the beginning and 395.3MB in the end (delta: 121.6MB). Free memory was 200.6MB in the beginning and 205.6MB in the end (delta: -5.0MB). Peak memory consumption was 191.6MB. Max. memory is 8.0GB. [2022-02-15 04:10:24,268 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory was 145.5MB in the beginning and 145.4MB in the end (delta: 70.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 322.23ms. Allocated memory was 184.5MB in the beginning and 273.7MB in the end (delta: 89.1MB). Free memory was 127.9MB in the beginning and 238.8MB in the end (delta: -110.9MB). Peak memory consumption was 16.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.65ms. Allocated memory is still 273.7MB. Free memory was 238.8MB in the beginning and 236.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 720.82ms. Allocated memory is still 273.7MB. Free memory was 236.2MB in the beginning and 201.1MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 19121.75ms. Allocated memory was 273.7MB in the beginning and 395.3MB in the end (delta: 121.6MB). Free memory was 200.6MB in the beginning and 205.6MB in the end (delta: -5.0MB). Peak memory consumption was 191.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 242 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5413 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5398 mSDsluCounter, 6785 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3692 mSDsCounter, 1252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6922 IncrementalHoareTripleChecker+Invalid, 8174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1252 mSolverCounterUnsat, 3093 mSDtfsCounter, 6922 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 189 SyntacticMatches, 4 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=3, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 149 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 239 LocationsWithAnnotation, 911 PreInvPairs, 1233 NumberOfFragments, 10930 HoareAnnotationTreeSize, 911 FomulaSimplifications, 1861 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 239 FomulaSimplificationsInter, 9411 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || ((((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && status == 0) && compRegistered == 0) && s == \old(s))) || !(2 == DC) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((!(NP == 1) || ((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && s == \old(s))) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || (((returnVal2 <= 0 && 0 <= returnVal2) && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || ((1073741823 + returnVal2 <= 0 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || ((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= returnVal2) && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 1 || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || compRegistered <= 0) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 776]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) && (((((((((!(NP == 1) || ((setEventCalled == 1 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || status == 0) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || (((((((((6 <= MPR3 && status == 0) && 7 <= IPC) && 5 <= MPR1) && 2 == DC) && !(pended == 1)) && s == NP) && NP == 1) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - ProcedureContractResult [Line: 568]: Procedure Contract for KeSetEvent Derived contract for procedure KeSetEvent: ((((((((setEventCalled == 1 || pended == 1) || !(s == NP)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) || !(s == 1) - ProcedureContractResult [Line: 618]: Procedure Contract for KbFilter_Complete Derived contract for procedure KbFilter_Complete: ((((((((pended == 1 || !(s == NP)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || ((1073741802 + \result <= 0 && setEventCalled == 1) && 0 <= 1073741802 + \result)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) || !(s == 1) - ProcedureContractResult [Line: 43]: Procedure Contract for stub_driver_init Derived contract for procedure stub_driver_init: ((((((((((!(pended == 1) && compRegistered == 0) && s == \old(s)) || !(NP == 1)) || !(NP == \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC) - ProcedureContractResult [Line: 689]: Procedure Contract for KbFilter_Power Derived contract for procedure KbFilter_Power: 1 - ProcedureContractResult [Line: 57]: Procedure Contract for _BLAST_init Derived contract for procedure _BLAST_init: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || ((((((((6 <= MPR3 && 7 <= IPC) && 5 <= MPR1) && 2 == DC) && !(pended == 1)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && !(MPR3 == s))) || !(\old(s) == \old(MPR3)) - ProcedureContractResult [Line: 1009]: Procedure Contract for errorFn Derived contract for procedure errorFn: 1 - ProcedureContractResult [Line: 295]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 481]: Procedure Contract for IofCallDriver Derived contract for procedure IofCallDriver: ((((((((((!(NP == 1) || ((((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= \result) && \result <= 259) && 259 <= returnVal2) && MPR3 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (s == NP && __cil_tmp7 + 1073741802 == 0)) || ((((s == NP && returnVal2 <= 0) && 0 <= \result) && 0 <= returnVal2) && \result <= 0)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1) - ProcedureContractResult [Line: 467]: Procedure Contract for stubMoreProcessingRequired Derived contract for procedure stubMoreProcessingRequired: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(setEventCalled == 1)) || !(2 == DC)) || MPR1 == s) || !(compRegistered == 1) - ProcedureContractResult [Line: 745]: Procedure Contract for PoCallDriver Derived contract for procedure PoCallDriver: 1 - ProcedureContractResult [Line: 629]: Procedure Contract for KbFilter_CreateClose Derived contract for procedure KbFilter_CreateClose: 1 - ProcedureContractResult [Line: 822]: Procedure Contract for KbFilter_InternIoCtl Derived contract for procedure KbFilter_InternIoCtl: 1 - ProcedureContractResult [Line: 576]: Procedure Contract for KeWaitForSingleObject Derived contract for procedure KeWaitForSingleObject: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) - ProcedureContractResult [Line: 554]: Procedure Contract for IofCompleteRequest Derived contract for procedure IofCompleteRequest: ((((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || 2 == s) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC)) && ((((((!(NP == \old(s)) || pended == 1) || 2 == s) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC)) || !(compRegistered == 1)) - ProcedureContractResult [Line: 665]: Procedure Contract for KbFilter_DispatchPassThrough Derived contract for procedure KbFilter_DispatchPassThrough: 1 - ProcedureContractResult [Line: 81]: Procedure Contract for KbFilter_PnP Derived contract for procedure KbFilter_PnP: (((((((((compRegistered == 1 || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || compRegistered <= 0) || !(6 <= MPR3)) || !(2 == DC) RESULT: Ultimate proved your program to be correct! [2022-02-15 04:10:24,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...