/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 02:31:16,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 02:31:16,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 02:31:16,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 02:31:16,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 02:31:16,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 02:31:16,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 02:31:16,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 02:31:16,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 02:31:16,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 02:31:16,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 02:31:16,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 02:31:16,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 02:31:16,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 02:31:16,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 02:31:16,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 02:31:16,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 02:31:16,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 02:31:16,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 02:31:17,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 02:31:17,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 02:31:17,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 02:31:17,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 02:31:17,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 02:31:17,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 02:31:17,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 02:31:17,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 02:31:17,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 02:31:17,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 02:31:17,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 02:31:17,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 02:31:17,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 02:31:17,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 02:31:17,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 02:31:17,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 02:31:17,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 02:31:17,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 02:31:17,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 02:31:17,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 02:31:17,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 02:31:17,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 02:31:17,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-02-15 02:31:17,044 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 02:31:17,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 02:31:17,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 02:31:17,046 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 02:31:17,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 02:31:17,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 02:31:17,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 02:31:17,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 02:31:17,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 02:31:17,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 02:31:17,047 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 02:31:17,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 02:31:17,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 02:31:17,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 02:31:17,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 02:31:17,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 02:31:17,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 02:31:17,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 02:31:17,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 02:31:17,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 02:31:17,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 02:31:17,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 02:31:17,048 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-02-15 02:31:17,048 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 02:31:17,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 02:31:17,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 02:31:17,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 02:31:17,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 02:31:17,363 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 02:31:17,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-02-15 02:31:17,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4f1bf16/358e0442cfe3444681ed94e509cab470/FLAG8c45b4244 [2022-02-15 02:31:17,769 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 02:31:17,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-02-15 02:31:17,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4f1bf16/358e0442cfe3444681ed94e509cab470/FLAG8c45b4244 [2022-02-15 02:31:17,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4f1bf16/358e0442cfe3444681ed94e509cab470 [2022-02-15 02:31:17,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 02:31:17,808 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 02:31:17,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 02:31:17,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 02:31:17,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 02:31:17,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:31:17" (1/1) ... [2022-02-15 02:31:17,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411598b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:31:17, skipping insertion in model container [2022-02-15 02:31:17,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:31:17" (1/1) ... [2022-02-15 02:31:17,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 02:31:17,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 02:31:18,128 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_simpl1.cil.c[17080,17093] [2022-02-15 02:31:18,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 02:31:18,139 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 02:31:18,191 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_simpl1.cil.c[17080,17093] [2022-02-15 02:31:18,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 02:31:18,200 INFO L208 MainTranslator]: Completed translation [2022-02-15 02:31:18,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:31:18 WrapperNode [2022-02-15 02:31:18,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 02:31:18,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 02:31:18,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 02:31:18,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 02:31:18,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:31:18" (1/1) ... [2022-02-15 02:31:18,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:31:18" (1/1) ... [2022-02-15 02:31:18,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:31:18" (1/1) ... [2022-02-15 02:31:18,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:31:18" (1/1) ... [2022-02-15 02:31:18,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:31:18" (1/1) ... [2022-02-15 02:31:18,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:31:18" (1/1) ... [2022-02-15 02:31:18,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:31:18" (1/1) ... [2022-02-15 02:31:18,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 02:31:18,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 02:31:18,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 02:31:18,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 02:31:18,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:31:18" (1/1) ... [2022-02-15 02:31:18,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 02:31:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 02:31:18,273 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 02:31:18,279 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 02:31:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 02:31:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 02:31:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 02:31:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-02-15 02:31:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-02-15 02:31:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-02-15 02:31:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 02:31:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-02-15 02:31:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-02-15 02:31:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-02-15 02:31:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-02-15 02:31:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-02-15 02:31:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-02-15 02:31:18,308 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-02-15 02:31:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 02:31:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 02:31:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 02:31:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 02:31:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-02-15 02:31:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 02:31:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 02:31:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 02:31:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 02:31:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 02:31:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 02:31:18,380 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 02:31:18,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 02:31:18,499 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 02:31:18,577 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-02-15 02:31:18,578 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-02-15 02:31:18,578 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 02:31:18,607 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2022-02-15 02:31:18,607 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2022-02-15 02:31:18,622 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 02:31:18,641 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-02-15 02:31:18,642 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-02-15 02:31:18,652 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 02:31:18,742 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-02-15 02:31:18,742 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-02-15 02:31:18,752 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 02:31:18,757 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 02:31:18,757 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-15 02:31:18,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:31:18 BoogieIcfgContainer [2022-02-15 02:31:18,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 02:31:18,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 02:31:18,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 02:31:18,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 02:31:18,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 02:31:17" (1/3) ... [2022-02-15 02:31:18,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245d0f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:31:18, skipping insertion in model container [2022-02-15 02:31:18,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:31:18" (2/3) ... [2022-02-15 02:31:18,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245d0f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:31:18, skipping insertion in model container [2022-02-15 02:31:18,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:31:18" (3/3) ... [2022-02-15 02:31:18,769 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2022-02-15 02:31:18,775 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 02:31:18,775 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 02:31:18,809 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 02:31:18,817 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=JORDAN [2022-02-15 02:31:18,818 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 02:31:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-15 02:31:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 02:31:18,838 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:18,838 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 02:31:18,839 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:18,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:18,843 INFO L85 PathProgramCache]: Analyzing trace with hash -657298671, now seen corresponding path program 1 times [2022-02-15 02:31:18,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:18,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [388271556] [2022-02-15 02:31:18,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:18,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:18,896 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:19,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:19,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:19,166 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 02:31:19,167 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:19,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [388271556] [2022-02-15 02:31:19,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [388271556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:19,169 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:19,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 02:31:19,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883972836] [2022-02-15 02:31:19,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:19,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 02:31:19,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:19,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 02:31:19,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-15 02:31:19,200 INFO L87 Difference]: Start difference. First operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) 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 02:31:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:19,565 INFO L93 Difference]: Finished difference Result 302 states and 462 transitions. [2022-02-15 02:31:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 02:31:19,567 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 02:31:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:19,573 INFO L225 Difference]: With dead ends: 302 [2022-02-15 02:31:19,574 INFO L226 Difference]: Without dead ends: 157 [2022-02-15 02:31:19,577 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 02:31:19,579 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 180 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:19,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 286 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 02:31:19,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-15 02:31:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-02-15 02:31:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-15 02:31:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2022-02-15 02:31:19,617 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2022-02-15 02:31:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:19,618 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2022-02-15 02:31:19,618 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 02:31:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2022-02-15 02:31:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-15 02:31:19,618 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:19,619 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] [2022-02-15 02:31:19,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 02:31:19,619 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:19,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash 919351458, now seen corresponding path program 1 times [2022-02-15 02:31:19,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:19,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [461651684] [2022-02-15 02:31:19,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:19,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:19,621 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:19,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:19,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 02:31:19,756 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:19,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [461651684] [2022-02-15 02:31:19,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [461651684] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:19,761 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:19,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 02:31:19,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894427956] [2022-02-15 02:31:19,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:19,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 02:31:19,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:19,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 02:31:19,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 02:31:19,763 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 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 02:31:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:20,200 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2022-02-15 02:31:20,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 02:31:20,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 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 26 [2022-02-15 02:31:20,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:20,203 INFO L225 Difference]: With dead ends: 275 [2022-02-15 02:31:20,203 INFO L226 Difference]: Without dead ends: 219 [2022-02-15 02:31:20,204 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 02:31:20,205 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 212 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:20,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 285 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 02:31:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-02-15 02:31:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2022-02-15 02:31:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-02-15 02:31:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2022-02-15 02:31:20,234 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2022-02-15 02:31:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:20,235 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2022-02-15 02:31:20,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 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 02:31:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2022-02-15 02:31:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 02:31:20,245 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:20,250 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] [2022-02-15 02:31:20,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 02:31:20,250 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:20,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:20,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1564864640, now seen corresponding path program 1 times [2022-02-15 02:31:20,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:20,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [834398680] [2022-02-15 02:31:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:20,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:20,253 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:20,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:20,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:20,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:20,396 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 02:31:20,396 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:20,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [834398680] [2022-02-15 02:31:20,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [834398680] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:20,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:20,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 02:31:20,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135104003] [2022-02-15 02:31:20,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:20,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 02:31:20,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:20,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 02:31:20,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 02:31:20,397 INFO L87 Difference]: Start difference. First operand 195 states and 259 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, (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 02:31:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:20,769 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2022-02-15 02:31:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 02:31:20,769 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, (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 27 [2022-02-15 02:31:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:20,771 INFO L225 Difference]: With dead ends: 316 [2022-02-15 02:31:20,771 INFO L226 Difference]: Without dead ends: 254 [2022-02-15 02:31:20,772 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 02:31:20,772 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 228 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:20,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 252 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 02:31:20,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-02-15 02:31:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2022-02-15 02:31:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-02-15 02:31:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2022-02-15 02:31:20,794 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2022-02-15 02:31:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:20,795 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2022-02-15 02:31:20,795 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, (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 02:31:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2022-02-15 02:31:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-15 02:31:20,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:20,796 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] [2022-02-15 02:31:20,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 02:31:20,796 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:20,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1424448937, now seen corresponding path program 1 times [2022-02-15 02:31:20,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:20,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807927860] [2022-02-15 02:31:20,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:20,798 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:20,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:20,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:20,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:20,904 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 02:31:20,904 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:20,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807927860] [2022-02-15 02:31:20,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [807927860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:20,905 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:20,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 02:31:20,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89411679] [2022-02-15 02:31:20,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:20,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 02:31:20,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:20,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 02:31:20,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-15 02:31:20,906 INFO L87 Difference]: Start difference. First operand 217 states and 289 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, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:31:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:21,193 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2022-02-15 02:31:21,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 02:31:21,193 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, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-02-15 02:31:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:21,194 INFO L225 Difference]: With dead ends: 220 [2022-02-15 02:31:21,195 INFO L226 Difference]: Without dead ends: 217 [2022-02-15 02:31:21,195 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 02:31:21,196 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 278 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:21,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 233 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 02:31:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-02-15 02:31:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-02-15 02:31:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-02-15 02:31:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2022-02-15 02:31:21,213 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2022-02-15 02:31:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:21,214 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2022-02-15 02:31:21,214 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, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-15 02:31:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-02-15 02:31:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-15 02:31:21,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:21,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] [2022-02-15 02:31:21,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 02:31:21,215 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash -327288786, now seen corresponding path program 1 times [2022-02-15 02:31:21,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:21,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821083965] [2022-02-15 02:31:21,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:21,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:21,218 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 02:31:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,341 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 02:31:21,341 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:21,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821083965] [2022-02-15 02:31:21,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [821083965] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:21,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:21,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 02:31:21,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093129076] [2022-02-15 02:31:21,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:21,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 02:31:21,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:21,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 02:31:21,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-15 02:31:21,343 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 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 02:31:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:21,760 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2022-02-15 02:31:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 02:31:21,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 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 45 [2022-02-15 02:31:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:21,762 INFO L225 Difference]: With dead ends: 274 [2022-02-15 02:31:21,762 INFO L226 Difference]: Without dead ends: 208 [2022-02-15 02:31:21,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-02-15 02:31:21,770 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 379 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:21,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 447 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 02:31:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-02-15 02:31:21,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2022-02-15 02:31:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-02-15 02:31:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2022-02-15 02:31:21,790 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2022-02-15 02:31:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:21,790 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2022-02-15 02:31:21,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 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 02:31:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-02-15 02:31:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-15 02:31:21,812 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:21,812 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] [2022-02-15 02:31:21,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 02:31:21,812 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1063639731, now seen corresponding path program 1 times [2022-02-15 02:31:21,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:21,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1746790160] [2022-02-15 02:31:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:21,814 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-15 02:31:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:31:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-15 02:31:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:21,955 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 02:31:21,955 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:21,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1746790160] [2022-02-15 02:31:21,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1746790160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:21,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:21,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 02:31:21,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276840614] [2022-02-15 02:31:21,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:21,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 02:31:21,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:21,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 02:31:21,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-15 02:31:21,957 INFO L87 Difference]: Start difference. First operand 190 states and 250 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, (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 02:31:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:22,238 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2022-02-15 02:31:22,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 02:31:22,239 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, (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 51 [2022-02-15 02:31:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:22,240 INFO L225 Difference]: With dead ends: 258 [2022-02-15 02:31:22,240 INFO L226 Difference]: Without dead ends: 197 [2022-02-15 02:31:22,241 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 02:31:22,243 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 185 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:22,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 326 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 02:31:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-02-15 02:31:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-02-15 02:31:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-02-15 02:31:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2022-02-15 02:31:22,268 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2022-02-15 02:31:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:22,268 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2022-02-15 02:31:22,268 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, (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 02:31:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2022-02-15 02:31:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-15 02:31:22,271 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:22,271 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] [2022-02-15 02:31:22,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 02:31:22,271 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:22,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1356664997, now seen corresponding path program 1 times [2022-02-15 02:31:22,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:22,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1854111263] [2022-02-15 02:31:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:22,273 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:22,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:22,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:22,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:22,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-15 02:31:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:22,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:22,530 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 02:31:22,530 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:22,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1854111263] [2022-02-15 02:31:22,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1854111263] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:22,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:22,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 02:31:22,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386361990] [2022-02-15 02:31:22,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:22,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 02:31:22,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:22,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 02:31:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-15 02:31:22,531 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-15 02:31:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:23,316 INFO L93 Difference]: Finished difference Result 234 states and 300 transitions. [2022-02-15 02:31:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 02:31:23,316 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-02-15 02:31:23,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:23,317 INFO L225 Difference]: With dead ends: 234 [2022-02-15 02:31:23,317 INFO L226 Difference]: Without dead ends: 210 [2022-02-15 02:31:23,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-02-15 02:31:23,318 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 331 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:23,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 477 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 02:31:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-02-15 02:31:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2022-02-15 02:31:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-02-15 02:31:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2022-02-15 02:31:23,333 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 50 [2022-02-15 02:31:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:23,333 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2022-02-15 02:31:23,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-15 02:31:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2022-02-15 02:31:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-15 02:31:23,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:23,334 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] [2022-02-15 02:31:23,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 02:31:23,334 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:23,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash -957846954, now seen corresponding path program 1 times [2022-02-15 02:31:23,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:23,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177548644] [2022-02-15 02:31:23,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:23,336 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:23,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:23,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:23,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-15 02:31:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:23,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:23,497 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 02:31:23,497 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:23,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177548644] [2022-02-15 02:31:23,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1177548644] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:23,497 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:23,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 02:31:23,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233405382] [2022-02-15 02:31:23,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:23,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 02:31:23,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:23,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 02:31:23,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-15 02:31:23,498 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 02:31:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:23,834 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2022-02-15 02:31:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 02:31:23,835 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-02-15 02:31:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:23,836 INFO L225 Difference]: With dead ends: 203 [2022-02-15 02:31:23,836 INFO L226 Difference]: Without dead ends: 91 [2022-02-15 02:31:23,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-02-15 02:31:23,837 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 362 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:23,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 230 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-15 02:31:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-15 02:31:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-15 02:31:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 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 02:31:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-02-15 02:31:23,846 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2022-02-15 02:31:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:23,846 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-02-15 02:31:23,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-15 02:31:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-02-15 02:31:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-15 02:31:23,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:23,847 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] [2022-02-15 02:31:23,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 02:31:23,847 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1066997237, now seen corresponding path program 1 times [2022-02-15 02:31:23,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:23,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1918698342] [2022-02-15 02:31:23,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:23,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:23,849 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:23,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:23,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 02:31:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 02:31:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:31:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,024 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 02:31:24,025 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:24,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1918698342] [2022-02-15 02:31:24,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1918698342] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:24,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:24,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 02:31:24,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030961875] [2022-02-15 02:31:24,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:24,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 02:31:24,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:24,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 02:31:24,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-15 02:31:24,026 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 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 02:31:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:24,320 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-02-15 02:31:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 02:31:24,321 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 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 59 [2022-02-15 02:31:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:24,321 INFO L225 Difference]: With dead ends: 119 [2022-02-15 02:31:24,321 INFO L226 Difference]: Without dead ends: 91 [2022-02-15 02:31:24,322 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 02:31:24,322 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 96 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:24,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 234 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 02:31:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-15 02:31:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-15 02:31:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 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 02:31:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-02-15 02:31:24,330 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2022-02-15 02:31:24,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:24,330 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-02-15 02:31:24,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 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 02:31:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-02-15 02:31:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-15 02:31:24,330 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:24,331 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] [2022-02-15 02:31:24,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 02:31:24,331 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:24,331 INFO L85 PathProgramCache]: Analyzing trace with hash 438062746, now seen corresponding path program 1 times [2022-02-15 02:31:24,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:24,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [362438553] [2022-02-15 02:31:24,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:24,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:24,332 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 02:31:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 02:31:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:31:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,452 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 02:31:24,453 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:24,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [362438553] [2022-02-15 02:31:24,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [362438553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:24,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:24,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 02:31:24,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368831325] [2022-02-15 02:31:24,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:24,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 02:31:24,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 02:31:24,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 02:31:24,454 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 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 02:31:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:24,553 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-02-15 02:31:24,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 02:31:24,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 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 61 [2022-02-15 02:31:24,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:24,554 INFO L225 Difference]: With dead ends: 125 [2022-02-15 02:31:24,554 INFO L226 Difference]: Without dead ends: 97 [2022-02-15 02:31:24,555 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 02:31:24,555 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 80 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:24,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 178 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 02:31:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-15 02:31:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-02-15 02:31:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 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 02:31:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-02-15 02:31:24,563 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2022-02-15 02:31:24,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:24,563 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-02-15 02:31:24,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 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 02:31:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-02-15 02:31:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-15 02:31:24,564 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:24,564 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] [2022-02-15 02:31:24,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 02:31:24,564 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash -148743268, now seen corresponding path program 1 times [2022-02-15 02:31:24,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:24,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1476012437] [2022-02-15 02:31:24,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:24,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:24,565 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 02:31:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 02:31:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:31:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:24,738 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 02:31:24,738 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:24,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1476012437] [2022-02-15 02:31:24,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1476012437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:24,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:24,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 02:31:24,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29799010] [2022-02-15 02:31:24,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:24,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 02:31:24,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:24,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 02:31:24,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-15 02:31:24,740 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 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 02:31:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:24,949 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-02-15 02:31:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 02:31:24,949 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 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 61 [2022-02-15 02:31:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:24,950 INFO L225 Difference]: With dead ends: 112 [2022-02-15 02:31:24,950 INFO L226 Difference]: Without dead ends: 93 [2022-02-15 02:31:24,951 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 02:31:24,951 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 39 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:24,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 318 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 02:31:24,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-15 02:31:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-02-15 02:31:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 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 02:31:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-02-15 02:31:24,959 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2022-02-15 02:31:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:24,959 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-02-15 02:31:24,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 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 02:31:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-02-15 02:31:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-15 02:31:24,959 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:24,960 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 02:31:24,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 02:31:24,960 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash 457949083, now seen corresponding path program 1 times [2022-02-15 02:31:24,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:24,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1864440691] [2022-02-15 02:31:24,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:24,961 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 02:31:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 02:31:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:31:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,084 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 02:31:25,085 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:25,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1864440691] [2022-02-15 02:31:25,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1864440691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:25,085 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:25,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 02:31:25,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928064139] [2022-02-15 02:31:25,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:25,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 02:31:25,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:25,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 02:31:25,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 02:31:25,086 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 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 02:31:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:25,246 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-02-15 02:31:25,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 02:31:25,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 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 62 [2022-02-15 02:31:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:25,247 INFO L225 Difference]: With dead ends: 105 [2022-02-15 02:31:25,247 INFO L226 Difference]: Without dead ends: 100 [2022-02-15 02:31:25,247 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 02:31:25,248 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 101 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:25,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 220 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 02:31:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-15 02:31:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2022-02-15 02:31:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 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 02:31:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-02-15 02:31:25,256 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2022-02-15 02:31:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:25,257 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-02-15 02:31:25,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 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 02:31:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-02-15 02:31:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-15 02:31:25,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:25,257 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 02:31:25,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 02:31:25,257 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:25,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:25,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1607349772, now seen corresponding path program 1 times [2022-02-15 02:31:25,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:25,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1478048838] [2022-02-15 02:31:25,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:25,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:25,259 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 02:31:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 02:31:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:31:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,418 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 02:31:25,419 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:25,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1478048838] [2022-02-15 02:31:25,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1478048838] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:25,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:25,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 02:31:25,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036098140] [2022-02-15 02:31:25,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:25,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 02:31:25,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:25,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 02:31:25,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-15 02:31:25,420 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 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 02:31:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:25,588 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-02-15 02:31:25,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 02:31:25,589 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 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 62 [2022-02-15 02:31:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:25,589 INFO L225 Difference]: With dead ends: 98 [2022-02-15 02:31:25,589 INFO L226 Difference]: Without dead ends: 91 [2022-02-15 02:31:25,590 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 02:31:25,590 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:25,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 267 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 02:31:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-15 02:31:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-15 02:31:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 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 02:31:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-02-15 02:31:25,598 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2022-02-15 02:31:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:25,598 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-02-15 02:31:25,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 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 02:31:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-02-15 02:31:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-15 02:31:25,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:25,601 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] [2022-02-15 02:31:25,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 02:31:25,601 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1073874348, now seen corresponding path program 1 times [2022-02-15 02:31:25,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:25,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1746208347] [2022-02-15 02:31:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:25,603 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 02:31:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 02:31:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:31:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,751 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 02:31:25,751 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:25,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1746208347] [2022-02-15 02:31:25,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1746208347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:25,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:25,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 02:31:25,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47649054] [2022-02-15 02:31:25,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:25,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 02:31:25,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:25,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 02:31:25,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 02:31:25,752 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 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 02:31:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:25,932 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-02-15 02:31:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 02:31:25,933 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 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 63 [2022-02-15 02:31:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:25,933 INFO L225 Difference]: With dead ends: 107 [2022-02-15 02:31:25,933 INFO L226 Difference]: Without dead ends: 76 [2022-02-15 02:31:25,934 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 02:31:25,934 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 49 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:25,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 178 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 02:31:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-15 02:31:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-02-15 02:31:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 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 02:31:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-02-15 02:31:25,941 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2022-02-15 02:31:25,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:25,941 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-02-15 02:31:25,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 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 02:31:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-02-15 02:31:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-15 02:31:25,942 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:25,942 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] [2022-02-15 02:31:25,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 02:31:25,942 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:25,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1942054886, now seen corresponding path program 1 times [2022-02-15 02:31:25,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:25,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [557984995] [2022-02-15 02:31:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:25,944 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:25,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 02:31:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 02:31:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:31:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,067 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 02:31:26,067 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:26,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [557984995] [2022-02-15 02:31:26,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [557984995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:26,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:26,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 02:31:26,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094931530] [2022-02-15 02:31:26,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:26,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 02:31:26,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:26,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 02:31:26,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-15 02:31:26,069 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 02:31:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:26,307 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-02-15 02:31:26,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-15 02:31:26,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-02-15 02:31:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:26,308 INFO L225 Difference]: With dead ends: 141 [2022-02-15 02:31:26,308 INFO L226 Difference]: Without dead ends: 134 [2022-02-15 02:31:26,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-02-15 02:31:26,309 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 85 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:26,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 186 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-15 02:31:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-15 02:31:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-02-15 02:31:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-15 02:31:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2022-02-15 02:31:26,321 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2022-02-15 02:31:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:26,321 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2022-02-15 02:31:26,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-15 02:31:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2022-02-15 02:31:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-15 02:31:26,322 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:26,322 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] [2022-02-15 02:31:26,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 02:31:26,322 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:26,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:26,322 INFO L85 PathProgramCache]: Analyzing trace with hash -577905048, now seen corresponding path program 1 times [2022-02-15 02:31:26,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:26,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [529384424] [2022-02-15 02:31:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:26,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:26,323 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 02:31:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 02:31:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:31:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,495 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 02:31:26,495 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:26,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [529384424] [2022-02-15 02:31:26,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [529384424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:26,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:26,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-15 02:31:26,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112587166] [2022-02-15 02:31:26,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:26,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-15 02:31:26,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:26,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-15 02:31:26,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-15 02:31:26,496 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 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 02:31:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:26,665 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-02-15 02:31:26,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 02:31:26,665 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 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 63 [2022-02-15 02:31:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:26,666 INFO L225 Difference]: With dead ends: 144 [2022-02-15 02:31:26,666 INFO L226 Difference]: Without dead ends: 133 [2022-02-15 02:31:26,666 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 02:31:26,666 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 55 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:26,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 277 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 02:31:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-15 02:31:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-02-15 02:31:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-15 02:31:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-02-15 02:31:26,678 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2022-02-15 02:31:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:26,678 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-02-15 02:31:26,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 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 02:31:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-02-15 02:31:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-15 02:31:26,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 02:31:26,679 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] [2022-02-15 02:31:26,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 02:31:26,679 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 02:31:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 02:31:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1364815011, now seen corresponding path program 1 times [2022-02-15 02:31:26,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 02:31:26,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [491025723] [2022-02-15 02:31:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 02:31:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 02:31:26,680 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 02:31:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 02:31:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-15 02:31:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-15 02:31:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-15 02:31:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-15 02:31:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-15 02:31:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-15 02:31:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 02:31:26,820 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 02:31:26,820 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 02:31:26,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [491025723] [2022-02-15 02:31:26,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [491025723] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 02:31:26,820 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 02:31:26,821 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-15 02:31:26,821 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181404305] [2022-02-15 02:31:26,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 02:31:26,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-15 02:31:26,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 02:31:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-15 02:31:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-15 02:31:26,821 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 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 02:31:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 02:31:26,983 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-02-15 02:31:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 02:31:26,983 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 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 74 [2022-02-15 02:31:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 02:31:26,983 INFO L225 Difference]: With dead ends: 133 [2022-02-15 02:31:26,983 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 02:31:26,984 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 02:31:26,984 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 22 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 02:31:26,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 153 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 02:31:26,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 02:31:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 02:31:26,985 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 02:31:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 02:31:26,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-02-15 02:31:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 02:31:26,985 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 02:31:26,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 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 02:31:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 02:31:26,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 02:31:26,987 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 02:31:26,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 02:31:26,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-15 02:31:32,794 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-02-15 02:31:32,794 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-02-15 02:31:32,794 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-02-15 02:31:32,795 INFO L854 garLoopResultBuilder]: At program point KeSetEventENTRY(lines 515 522) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,795 INFO L854 garLoopResultBuilder]: At program point KeSetEventFINAL(lines 515 522) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,795 INFO L854 garLoopResultBuilder]: At program point KeSetEventEXIT(lines 515 522) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,795 INFO L854 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 565 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,795 INFO L854 garLoopResultBuilder]: At program point L571(line 571) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,795 INFO L854 garLoopResultBuilder]: At program point L571-1(line 571) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,795 INFO L854 garLoopResultBuilder]: At program point KbFilter_CompleteFINAL(lines 565 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,795 INFO L854 garLoopResultBuilder]: At program point KbFilter_CompleteEXIT(lines 565 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,795 INFO L854 garLoopResultBuilder]: At program point stub_driver_initEXIT(lines 37 50) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= |old(~pended~0)| 0)) (and (= ~s~0 ~NP~0) (= ~pended~0 0) (= ~compRegistered~0 0))) [2022-02-15 02:31:32,795 INFO L854 garLoopResultBuilder]: At program point stub_driver_initENTRY(lines 37 50) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= |old(~pended~0)| 0))) [2022-02-15 02:31:32,795 INFO L854 garLoopResultBuilder]: At program point stub_driver_initFINAL(lines 37 50) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= |old(~pended~0)| 0)) (and (= ~s~0 ~NP~0) (= ~pended~0 0) (= ~compRegistered~0 0))) [2022-02-15 02:31:32,796 INFO L854 garLoopResultBuilder]: At program point _BLAST_initFINAL(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,796 INFO L854 garLoopResultBuilder]: At program point _BLAST_initENTRY(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~DC~0 |old(~DC~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,796 INFO L854 garLoopResultBuilder]: At program point _BLAST_initEXIT(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,796 INFO L861 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2022-02-15 02:31:32,796 INFO L861 garLoopResultBuilder]: At program point errorFnFINAL(lines 577 584) the Hoare annotation is: true [2022-02-15 02:31:32,796 INFO L861 garLoopResultBuilder]: At program point errorFnEXIT(lines 577 584) the Hoare annotation is: true [2022-02-15 02:31:32,796 INFO L861 garLoopResultBuilder]: At program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) the Hoare annotation is: true [2022-02-15 02:31:32,796 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 288 422) the Hoare annotation is: true [2022-02-15 02:31:32,796 INFO L854 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,796 INFO L854 garLoopResultBuilder]: At program point L359(line 359) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,796 INFO L854 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,796 INFO L861 garLoopResultBuilder]: At program point L409(lines 409 411) the Hoare annotation is: true [2022-02-15 02:31:32,796 INFO L854 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,796 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 288 422) the Hoare annotation is: true [2022-02-15 02:31:32,797 INFO L861 garLoopResultBuilder]: At program point L385(lines 369 418) the Hoare annotation is: true [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L352(lines 352 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 288 422) the Hoare annotation is: (or (and (= |old(~Executive~0)| ~Executive~0) (= ~DC~0 |old(~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)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L386(lines 386 415) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L378(lines 378 382) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L370(lines 370 374) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (= ~s~0 ~NP~0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L337(lines 323 368) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L387(lines 387 414) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L321-1(lines 297 421) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L861 garLoopResultBuilder]: At program point L404(lines 404 412) the Hoare annotation is: true [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L388(lines 388 394) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,797 INFO L854 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,798 INFO L861 garLoopResultBuilder]: At program point L405(lines 405 407) the Hoare annotation is: true [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point L389(lines 389 391) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point L323(lines 297 421) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point L340-1(lines 339 349) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point L398(lines 398 402) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point L332(lines 332 335) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point L332-2(lines 332 335) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~MPR1~0 ~s~0) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point L445(lines 445 448) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3) (or .cse0 .cse1 (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point L445-1(lines 445 448) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3) (or .cse0 .cse1 (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point IofCallDriverFINAL(lines 437 500) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2) (let ((.cse3 (= ~setEventCalled~0 1)) (.cse5 (<= 259 |IofCallDriver_#res|)) (.cse8 (<= 259 IofCallDriver_~returnVal2~0)) (.cse4 (= ~NP~0 |old(~s~0)|)) (.cse6 (not .cse0)) (.cse7 (= ~NP~0 1)) (.cse9 (= ~s~0 |old(~s~0)|))) (or .cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not .cse7) (not .cse4) (not (<= 5 ~MPR1~0)) (and .cse3 (<= IofCallDriver_~returnVal2~0 259) .cse5 (<= |IofCallDriver_#res| 259) .cse8 (= ~MPR3~0 ~s~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse4 .cse6 .cse7 .cse9 (<= |IofCallDriver_#res| 0)) .cse1 .cse2)))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point L479(lines 479 496) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0))) (or .cse0 (and (<= IofCallDriver_~returnVal2~0 0) .cse1) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3)) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-02-15 02:31:32,798 INFO L854 garLoopResultBuilder]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (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)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L446-1(line 446) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0))) (or .cse0 (and (<= IofCallDriver_~returnVal2~0 0) .cse1) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3)) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point IofCallDriverEXIT(lines 437 500) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2) (let ((.cse3 (= ~setEventCalled~0 1)) (.cse5 (<= 259 |IofCallDriver_#res|)) (.cse8 (<= 259 IofCallDriver_~returnVal2~0)) (.cse4 (= ~NP~0 |old(~s~0)|)) (.cse6 (not .cse0)) (.cse7 (= ~NP~0 1)) (.cse9 (= ~s~0 |old(~s~0)|))) (or .cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not .cse7) (not .cse4) (not (<= 5 ~MPR1~0)) (and .cse3 (<= IofCallDriver_~returnVal2~0 259) .cse5 (<= |IofCallDriver_#res| 259) .cse8 (= ~MPR3~0 ~s~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse4 .cse6 .cse7 .cse9 (<= |IofCallDriver_#res| 0)) .cse1 .cse2)))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L488(lines 488 495) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L451(lines 451 474) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L480(lines 480 486) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~MPR1~0 ~s~0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) .cse1 (= ~s~0 |old(~s~0)|)) (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or .cse0 (and (<= IofCallDriver_~returnVal2~0 0) .cse1) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L447(line 447) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L493-1(lines 475 497) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2) (let ((.cse6 (= ~setEventCalled~0 1)) (.cse7 (<= 259 IofCallDriver_~returnVal2~0)) (.cse5 (<= 5 ~MPR1~0)) (.cse4 (= ~NP~0 |old(~s~0)|)) (.cse8 (not .cse0)) (.cse3 (= ~NP~0 1)) (.cse9 (= ~s~0 |old(~s~0)|))) (or .cse0 (not .cse3) (not .cse4) (not .cse5) (and .cse6 (<= IofCallDriver_~returnVal2~0 259) .cse7 (= ~MPR3~0 ~s~0)) (and .cse6 .cse5 .cse4 .cse8 .cse3 .cse7 .cse9) (and .cse5 (<= IofCallDriver_~returnVal2~0 0) .cse4 .cse8 .cse3 .cse9) .cse1 .cse2)))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L456(lines 456 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~MPR1~0 ~s~0) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,799 INFO L854 garLoopResultBuilder]: At program point L431-1(lines 423 436) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 423 436) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point stubMoreProcessingRequiredEXIT(lines 423 436) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-02-15 02:31:32,800 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) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point L541(lines 541 545) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point L541-1(lines 528 547) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point KeWaitForSingleObjectEXIT(lines 523 564) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point L529(lines 529 534) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (= ~compRegistered~0 0)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point L550(lines 550 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point KeWaitForSingleObjectFINAL(lines 523 564) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,800 INFO L854 garLoopResultBuilder]: At program point L528(lines 528 547) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (= ~compRegistered~0 0)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 523 564) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (= ~compRegistered~0 0)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point L509(line 509) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-02-15 02:31:32,801 INFO L861 garLoopResultBuilder]: At program point L509-1(lines 501 514) the Hoare annotation is: true [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 501 514) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point L505(lines 505 511) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-02-15 02:31:32,801 INFO L861 garLoopResultBuilder]: At program point IofCompleteRequestEXIT(lines 501 514) the Hoare annotation is: true [2022-02-15 02:31:32,801 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-02-15 02:31:32,801 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-15 02:31:32,801 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point L192(lines 192 198) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0))) (let ((.cse8 (= ~setEventCalled~0 1)) (.cse10 (<= 259 KbFilter_PnP_~status~0)) (.cse9 (not (= ~compRegistered~0 0))) (.cse13 (not .cse0)) (.cse15 (= ~s~0 |old(~s~0)|)) (.cse11 (<= 5 ~MPR1~0)) (.cse12 (= ~NP~0 |old(~s~0)|)) (.cse14 (= ~NP~0 1))) (let ((.cse1 (not .cse14)) (.cse2 (not .cse12)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not .cse11)) (.cse5 (and .cse11 .cse9 (not (= KbFilter_PnP_~__cil_tmp23~0 259)) .cse12 .cse13 .cse14 .cse15)) (.cse6 (and .cse8 .cse11 .cse9 .cse12 .cse13 .cse14 .cse10 .cse15)) (.cse7 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 (and .cse8 (< 258 KbFilter_PnP_~__cil_tmp23~0) .cse9 (<= KbFilter_PnP_~__cil_tmp23~0 259) .cse10 (= ~MPR3~0 ~s~0)) .cse4 .cse5 .cse6 .cse7))))) [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point L159(lines 159 265) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point L126(lines 126 276) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point L192-2(lines 166 261) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,801 INFO L854 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L242-1(line 242) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compRegistered~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L176(lines 176 182) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L176-1(lines 171 183) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= 5 ~MPR1~0))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~compRegistered~0 0)) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse5))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L201(lines 201 205) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L135(lines 135 273) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L102(lines 102 284) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L226(lines 226 227) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L226-1(lines 226 227) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compRegistered~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L251-1(lines 247 253) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L144(lines 144 270) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L111(lines 111 281) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L194(lines 194 196) the Hoare annotation is: (let ((.cse4 (= ~setEventCalled~0 1)) (.cse5 (not (= ~compRegistered~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse6 (<= 259 KbFilter_PnP_~status~0)) (.cse10 (<= 5 ~MPR1~0)) (.cse11 (= ~NP~0 |old(~s~0)|)) (.cse12 (= ~NP~0 1))) (let ((.cse1 (not .cse12)) (.cse2 (not .cse11)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse7 (not .cse10)) (.cse8 (and .cse4 .cse10 .cse5 .cse11 (not .cse0) .cse12 .cse6 (= ~s~0 |old(~s~0)|))) (.cse9 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 (< 258 KbFilter_PnP_~__cil_tmp23~0) .cse5 (<= KbFilter_PnP_~__cil_tmp23~0 259) .cse6 (= ~MPR3~0 ~s~0)) .cse7 .cse8 .cse9) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse7 .cse8 .cse9)))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L194-1(lines 194 196) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,802 INFO L854 garLoopResultBuilder]: At program point L153(lines 153 267) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L120(lines 120 278) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L178(line 178) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L861 garLoopResultBuilder]: At program point KbFilter_PnPEXIT(lines 75 287) the Hoare annotation is: true [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L236-1(lines 232 238) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L162(lines 162 264) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L129(lines 129 275) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L187(lines 187 188) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= 5 ~MPR1~0))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~compRegistered~0 0)) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse5))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L220-1(lines 216 222) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L187-1(lines 187 188) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0))) (let ((.cse2 (= ~setEventCalled~0 1)) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (<= 259 |KbFilter_PnP_#t~ret12|)) (.cse11 (not .cse0)) (.cse13 (= ~s~0 |old(~s~0)|)) (.cse14 (<= 5 ~MPR1~0)) (.cse15 (= ~NP~0 |old(~s~0)|)) (.cse12 (= ~NP~0 1))) (let ((.cse1 (not .cse12)) (.cse5 (not .cse15)) (.cse6 (not (= |old(~compRegistered~0)| 0))) (.cse7 (not .cse14)) (.cse8 (and .cse2 .cse14 .cse3 .cse4 .cse15 .cse11 .cse12 .cse13)) (.cse9 (and .cse3 (not (= |KbFilter_PnP_#t~ret12| 259)) .cse11 .cse12 .cse13)) (.cse10 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (and .cse2 (<= |KbFilter_PnP_#t~ret12| 259) .cse3 .cse4 (= ~MPR3~0 ~s~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point KbFilter_PnPENTRY(lines 75 287) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L171(lines 171 183) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L138(lines 138 272) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L854 garLoopResultBuilder]: At program point L105(lines 105 283) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,803 INFO L861 garLoopResultBuilder]: At program point KbFilter_PnPFINAL(lines 75 287) the Hoare annotation is: true [2022-02-15 02:31:32,804 INFO L861 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: true [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L147(lines 147 269) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L114(lines 114 280) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L156(lines 156 266) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L123(lines 123 277) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L132(lines 132 274) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L141(lines 141 271) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L108(lines 108 282) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L232(lines 232 238) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L257(lines 257 258) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L257-1(lines 257 258) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compRegistered~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L216(lines 216 222) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L150(lines 150 268) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,804 INFO L854 garLoopResultBuilder]: At program point L117(lines 117 279) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,805 INFO L854 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~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 (= ~pended~0 0))) [2022-02-15 02:31:32,805 INFO L854 garLoopResultBuilder]: At program point L200(lines 200 206) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-02-15 02:31:32,807 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 02:31:32,813 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 02:31:32,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 02:31:32 BoogieIcfgContainer [2022-02-15 02:31:32,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 02:31:32,858 INFO L158 Benchmark]: Toolchain (without parser) took 15050.19ms. Allocated memory was 172.0MB in the beginning and 371.2MB in the end (delta: 199.2MB). Free memory was 115.9MB in the beginning and 250.5MB in the end (delta: -134.6MB). Peak memory consumption was 155.0MB. Max. memory is 8.0GB. [2022-02-15 02:31:32,858 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory was 132.4MB in the beginning and 132.2MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 02:31:32,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.85ms. Allocated memory was 172.0MB in the beginning and 248.5MB in the end (delta: 76.5MB). Free memory was 115.8MB in the beginning and 219.2MB in the end (delta: -103.4MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2022-02-15 02:31:32,859 INFO L158 Benchmark]: Boogie Preprocessor took 37.04ms. Allocated memory is still 248.5MB. Free memory was 219.2MB in the beginning and 217.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 02:31:32,859 INFO L158 Benchmark]: RCFGBuilder took 523.03ms. Allocated memory is still 248.5MB. Free memory was 217.1MB in the beginning and 193.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-02-15 02:31:32,859 INFO L158 Benchmark]: TraceAbstraction took 14093.53ms. Allocated memory was 248.5MB in the beginning and 371.2MB in the end (delta: 122.7MB). Free memory was 192.5MB in the beginning and 250.5MB in the end (delta: -58.0MB). Peak memory consumption was 154.8MB. Max. memory is 8.0GB. [2022-02-15 02:31:32,860 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.12ms. Allocated memory is still 172.0MB. Free memory was 132.4MB in the beginning and 132.2MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 390.85ms. Allocated memory was 172.0MB in the beginning and 248.5MB in the end (delta: 76.5MB). Free memory was 115.8MB in the beginning and 219.2MB in the end (delta: -103.4MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.04ms. Allocated memory is still 248.5MB. Free memory was 219.2MB in the beginning and 217.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 523.03ms. Allocated memory is still 248.5MB. Free memory was 217.1MB in the beginning and 193.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 14093.53ms. Allocated memory was 248.5MB in the beginning and 371.2MB in the end (delta: 122.7MB). Free memory was 192.5MB in the beginning and 250.5MB in the end (delta: -58.0MB). Peak memory consumption was 154.8MB. 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: 581]: 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 14 procedures, 154 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2753 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2745 mSDsluCounter, 4547 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2536 mSDsCounter, 786 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4901 IncrementalHoareTripleChecker+Invalid, 5687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 786 mSolverCounterUnsat, 2011 mSDtfsCounter, 4901 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 144 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 151 LocationsWithAnnotation, 805 PreInvPairs, 1062 NumberOfFragments, 6214 HoareAnnotationTreeSize, 805 FomulaSimplifications, 426 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 151 FomulaSimplificationsInter, 11576 FormulaSimplificationTreeSizeReductionInter, 5.5s 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: 352]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || (((((((status == 0 && 5 <= MPR1) && s == NP) && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || (returnVal2 <= 0 && MPR1 == s)) || (((setEventCalled == 1 && returnVal2 <= 259) && 259 <= returnVal2) && MPR1 == s)) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || status == 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || ((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && s == \old(s))) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) && ((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - ProcedureContractResult [Line: 515]: Procedure Contract for KeSetEvent Derived contract for procedure KeSetEvent: (((((SKIP1 == NP || !(NP == 1)) || setEventCalled == 1) || !(s == NP)) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0) - ProcedureContractResult [Line: 565]: Procedure Contract for KbFilter_Complete Derived contract for procedure KbFilter_Complete: (((((SKIP1 == NP || !(NP == 1)) || setEventCalled == 1) || !(s == NP)) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0) - ProcedureContractResult [Line: 37]: Procedure Contract for stub_driver_init Derived contract for procedure stub_driver_init: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(\old(pended) == 0)) || ((s == NP && pended == 0) && compRegistered == 0) - ProcedureContractResult [Line: 51]: Procedure Contract for _BLAST_init Derived contract for procedure _BLAST_init: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || (((((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && pended == 0) && compRegistered == 0) && !(MPR3 == s))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - ProcedureContractResult [Line: 577]: Procedure Contract for errorFn Derived contract for procedure errorFn: 1 - ProcedureContractResult [Line: 288]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 437]: Procedure Contract for IofCallDriver Derived contract for procedure IofCallDriver: ((((SKIP1 == NP || setEventCalled == \old(setEventCalled)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) && ((((((((SKIP1 == NP || ((((((setEventCalled == 1 && NP == \old(s)) && 259 <= \result) && !(SKIP1 == NP)) && NP == 1) && 259 <= returnVal2) && s == \old(s))) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= \result) && \result <= 259) && 259 <= returnVal2) && MPR3 == s)) || (((((returnVal2 <= 0 && NP == \old(s)) && !(SKIP1 == NP)) && NP == 1) && s == \old(s)) && \result <= 0)) || compRegistered == 0) || !(pended == 0)) - ProcedureContractResult [Line: 423]: Procedure Contract for stubMoreProcessingRequired Derived contract for procedure stubMoreProcessingRequired: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(setEventCalled == 1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0) - ProcedureContractResult [Line: 523]: Procedure Contract for KeWaitForSingleObject Derived contract for procedure KeWaitForSingleObject: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - ProcedureContractResult [Line: 501]: Procedure Contract for IofCompleteRequest Derived contract for procedure IofCompleteRequest: 1 - ProcedureContractResult [Line: 75]: Procedure Contract for KbFilter_PnP Derived contract for procedure KbFilter_PnP: 1 RESULT: Ultimate proved your program to be correct! [2022-02-15 02:31:32,899 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...