/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:25:30,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:25:30,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:25:30,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:25:30,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:25:30,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:25:30,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:25:30,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:25:30,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:25:30,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:25:30,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:25:30,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:25:30,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:25:30,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:25:30,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:25:30,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:25:30,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:25:30,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:25:30,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:25:30,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:25:30,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:25:30,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:25:30,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:25:30,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:25:30,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:25:30,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:25:30,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:25:30,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:25:30,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:25:30,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:25:30,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:25:30,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:25:30,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:25:30,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:25:30,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:25:30,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:25:30,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:25:30,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:25:30,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:25:30,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:25:30,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:25:31,000 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:25:31,060 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:25:31,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:25:31,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:25:31,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:25:31,063 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:25:31,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:25:31,064 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:25:31,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:25:31,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:25:31,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:25:31,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:25:31,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:25:31,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:25:31,067 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:25:31,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:25:31,067 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:25:31,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:25:31,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:25:31,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:25:31,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:25:31,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:25:31,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:25:31,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:25:31,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:25:31,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:25:31,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:25:31,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:25:31,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:25:31,070 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:25:31,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:25:31,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:25:31,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:25:31,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:25:31,568 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:25:31,569 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:25:31,570 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2020-11-06 22:25:31,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30872239a/ba1d17f5cfa54bdab37e9e166c58c570/FLAG2866b1527 [2020-11-06 22:25:32,350 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:25:32,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2020-11-06 22:25:32,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30872239a/ba1d17f5cfa54bdab37e9e166c58c570/FLAG2866b1527 [2020-11-06 22:25:32,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30872239a/ba1d17f5cfa54bdab37e9e166c58c570 [2020-11-06 22:25:32,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:25:32,675 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:25:32,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:25:32,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:25:32,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:25:32,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:32" (1/1) ... [2020-11-06 22:25:32,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c795cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:32, skipping insertion in model container [2020-11-06 22:25:32,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:32" (1/1) ... [2020-11-06 22:25:32,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:25:32,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:25:33,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:25:33,138 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:25:33,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:25:33,285 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:25:33,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:33 WrapperNode [2020-11-06 22:25:33,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:25:33,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:25:33,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:25:33,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:25:33,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:33" (1/1) ... [2020-11-06 22:25:33,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:33" (1/1) ... [2020-11-06 22:25:33,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:33" (1/1) ... [2020-11-06 22:25:33,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:33" (1/1) ... [2020-11-06 22:25:33,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:33" (1/1) ... [2020-11-06 22:25:33,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:33" (1/1) ... [2020-11-06 22:25:33,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:33" (1/1) ... [2020-11-06 22:25:33,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:25:33,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:25:33,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:25:33,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:25:33,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:25:33,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:25:33,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:25:33,477 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:25:33,477 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-11-06 22:25:33,477 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-11-06 22:25:33,477 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-11-06 22:25:33,478 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:25:33,478 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-11-06 22:25:33,478 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-11-06 22:25:33,478 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-11-06 22:25:33,478 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-11-06 22:25:33,478 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-11-06 22:25:33,479 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-11-06 22:25:33,479 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2020-11-06 22:25:33,479 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2020-11-06 22:25:33,479 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2020-11-06 22:25:33,479 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2020-11-06 22:25:33,479 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2020-11-06 22:25:33,479 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-11-06 22:25:33,480 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:25:33,480 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:25:33,480 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:25:33,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:25:33,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-11-06 22:25:33,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:25:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-11-06 22:25:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2020-11-06 22:25:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-11-06 22:25:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-11-06 22:25:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-11-06 22:25:33,481 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-11-06 22:25:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-11-06 22:25:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2020-11-06 22:25:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2020-11-06 22:25:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2020-11-06 22:25:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2020-11-06 22:25:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-11-06 22:25:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-11-06 22:25:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-11-06 22:25:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-11-06 22:25:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:25:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-11-06 22:25:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:25:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:25:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:25:33,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:25:33,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:25:33,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:25:33,859 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-06 22:25:34,075 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2020-11-06 22:25:34,075 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2020-11-06 22:25:34,128 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-06 22:25:34,218 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-11-06 22:25:34,218 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-11-06 22:25:34,299 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-06 22:25:34,319 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-11-06 22:25:34,320 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-11-06 22:25:34,329 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-06 22:25:34,471 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-11-06 22:25:34,471 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-11-06 22:25:34,476 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-06 22:25:34,500 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2020-11-06 22:25:34,501 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2020-11-06 22:25:34,507 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-06 22:25:34,539 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-11-06 22:25:34,539 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-11-06 22:25:34,592 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:25:34,592 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-06 22:25:34,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:34 BoogieIcfgContainer [2020-11-06 22:25:34,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:25:34,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:25:34,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:25:34,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:25:34,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:25:32" (1/3) ... [2020-11-06 22:25:34,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7142ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:34, skipping insertion in model container [2020-11-06 22:25:34,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:33" (2/3) ... [2020-11-06 22:25:34,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7142ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:34, skipping insertion in model container [2020-11-06 22:25:34,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:34" (3/3) ... [2020-11-06 22:25:34,606 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2020-11-06 22:25:34,626 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:25:34,631 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:25:34,646 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:25:34,678 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:25:34,678 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:25:34,678 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:25:34,678 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:25:34,678 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:25:34,678 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:25:34,679 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:25:34,679 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:25:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states. [2020-11-06 22:25:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-06 22:25:34,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:34,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:25:34,715 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:34,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:34,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2097743147, now seen corresponding path program 1 times [2020-11-06 22:25:34,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:34,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799148781] [2020-11-06 22:25:34,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:35,140 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:25:35,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:35,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:35,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799148781] [2020-11-06 22:25:35,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:35,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:25:35,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082565022] [2020-11-06 22:25:35,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:25:35,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:35,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:25:35,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:25:35,322 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 5 states. [2020-11-06 22:25:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:36,536 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2020-11-06 22:25:36,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:25:36,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-06 22:25:36,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:36,557 INFO L225 Difference]: With dead ends: 420 [2020-11-06 22:25:36,557 INFO L226 Difference]: Without dead ends: 257 [2020-11-06 22:25:36,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:25:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-11-06 22:25:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 229. [2020-11-06 22:25:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-11-06 22:25:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 323 transitions. [2020-11-06 22:25:36,659 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 323 transitions. Word has length 21 [2020-11-06 22:25:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:36,659 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 323 transitions. [2020-11-06 22:25:36,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:25:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 323 transitions. [2020-11-06 22:25:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:25:36,661 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:36,661 INFO L422 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] [2020-11-06 22:25:36,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:25:36,662 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:36,663 INFO L82 PathProgramCache]: Analyzing trace with hash -360253698, now seen corresponding path program 1 times [2020-11-06 22:25:36,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:36,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903745111] [2020-11-06 22:25:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:36,921 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:25:36,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:37,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:37,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:37,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903745111] [2020-11-06 22:25:37,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:37,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:25:37,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21971508] [2020-11-06 22:25:37,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:25:37,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:37,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:25:37,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:25:37,059 INFO L87 Difference]: Start difference. First operand 229 states and 323 transitions. Second operand 6 states. [2020-11-06 22:25:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:39,018 INFO L93 Difference]: Finished difference Result 404 states and 556 transitions. [2020-11-06 22:25:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:25:39,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-11-06 22:25:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:39,030 INFO L225 Difference]: With dead ends: 404 [2020-11-06 22:25:39,030 INFO L226 Difference]: Without dead ends: 345 [2020-11-06 22:25:39,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:25:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-11-06 22:25:39,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 302. [2020-11-06 22:25:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-11-06 22:25:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 412 transitions. [2020-11-06 22:25:39,107 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 412 transitions. Word has length 29 [2020-11-06 22:25:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:39,108 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 412 transitions. [2020-11-06 22:25:39,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:25:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 412 transitions. [2020-11-06 22:25:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:25:39,109 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:39,109 INFO L422 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] [2020-11-06 22:25:39,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:25:39,112 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:39,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:39,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1068199997, now seen corresponding path program 1 times [2020-11-06 22:25:39,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:39,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353175262] [2020-11-06 22:25:39,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:39,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:39,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:39,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:39,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353175262] [2020-11-06 22:25:39,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:39,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:25:39,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660912143] [2020-11-06 22:25:39,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:25:39,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:39,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:25:39,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:25:39,454 INFO L87 Difference]: Start difference. First operand 302 states and 412 transitions. Second operand 6 states. [2020-11-06 22:25:39,597 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-06 22:25:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:40,787 INFO L93 Difference]: Finished difference Result 481 states and 638 transitions. [2020-11-06 22:25:40,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:25:40,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-11-06 22:25:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:40,797 INFO L225 Difference]: With dead ends: 481 [2020-11-06 22:25:40,799 INFO L226 Difference]: Without dead ends: 364 [2020-11-06 22:25:40,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:25:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-11-06 22:25:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 342. [2020-11-06 22:25:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-11-06 22:25:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 463 transitions. [2020-11-06 22:25:40,902 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 463 transitions. Word has length 29 [2020-11-06 22:25:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:40,903 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 463 transitions. [2020-11-06 22:25:40,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:25:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 463 transitions. [2020-11-06 22:25:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-06 22:25:40,906 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:40,906 INFO L422 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] [2020-11-06 22:25:40,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:25:40,906 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash -397096216, now seen corresponding path program 1 times [2020-11-06 22:25:40,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:40,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50916234] [2020-11-06 22:25:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:41,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50916234] [2020-11-06 22:25:41,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:41,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:25:41,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448427082] [2020-11-06 22:25:41,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:25:41,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:41,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:25:41,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:25:41,209 INFO L87 Difference]: Start difference. First operand 342 states and 463 transitions. Second operand 6 states. [2020-11-06 22:25:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:42,455 INFO L93 Difference]: Finished difference Result 346 states and 466 transitions. [2020-11-06 22:25:42,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:25:42,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-11-06 22:25:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:42,460 INFO L225 Difference]: With dead ends: 346 [2020-11-06 22:25:42,461 INFO L226 Difference]: Without dead ends: 341 [2020-11-06 22:25:42,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:25:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-11-06 22:25:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2020-11-06 22:25:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-11-06 22:25:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 460 transitions. [2020-11-06 22:25:42,503 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 460 transitions. Word has length 39 [2020-11-06 22:25:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:42,503 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 460 transitions. [2020-11-06 22:25:42,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:25:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 460 transitions. [2020-11-06 22:25:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-06 22:25:42,507 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:42,507 INFO L422 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] [2020-11-06 22:25:42,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:25:42,508 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:42,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1947652478, now seen corresponding path program 1 times [2020-11-06 22:25:42,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:42,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621213560] [2020-11-06 22:25:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:25:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:42,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621213560] [2020-11-06 22:25:42,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:42,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:25:42,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121412247] [2020-11-06 22:25:42,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:25:42,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:42,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:25:42,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:25:42,846 INFO L87 Difference]: Start difference. First operand 341 states and 460 transitions. Second operand 8 states. [2020-11-06 22:25:43,536 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-06 22:25:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:44,721 INFO L93 Difference]: Finished difference Result 388 states and 511 transitions. [2020-11-06 22:25:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:25:44,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-11-06 22:25:44,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:44,726 INFO L225 Difference]: With dead ends: 388 [2020-11-06 22:25:44,726 INFO L226 Difference]: Without dead ends: 321 [2020-11-06 22:25:44,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:44,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-11-06 22:25:44,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 302. [2020-11-06 22:25:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-11-06 22:25:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 403 transitions. [2020-11-06 22:25:44,762 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 403 transitions. Word has length 47 [2020-11-06 22:25:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:44,762 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 403 transitions. [2020-11-06 22:25:44,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:25:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 403 transitions. [2020-11-06 22:25:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-06 22:25:44,765 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:44,766 INFO L422 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] [2020-11-06 22:25:44,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:25:44,766 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:44,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:44,767 INFO L82 PathProgramCache]: Analyzing trace with hash -789486523, now seen corresponding path program 1 times [2020-11-06 22:25:44,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:44,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805223197] [2020-11-06 22:25:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:25:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:25:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:45,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805223197] [2020-11-06 22:25:45,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:45,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:25:45,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464107378] [2020-11-06 22:25:45,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:25:45,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:45,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:25:45,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:45,340 INFO L87 Difference]: Start difference. First operand 302 states and 403 transitions. Second operand 12 states. [2020-11-06 22:25:45,622 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:25:46,855 WARN L194 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-11-06 22:25:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:47,108 INFO L93 Difference]: Finished difference Result 330 states and 433 transitions. [2020-11-06 22:25:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:25:47,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2020-11-06 22:25:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:47,112 INFO L225 Difference]: With dead ends: 330 [2020-11-06 22:25:47,112 INFO L226 Difference]: Without dead ends: 324 [2020-11-06 22:25:47,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:25:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-11-06 22:25:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 316. [2020-11-06 22:25:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-11-06 22:25:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 419 transitions. [2020-11-06 22:25:47,163 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 419 transitions. Word has length 46 [2020-11-06 22:25:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:47,164 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 419 transitions. [2020-11-06 22:25:47,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:25:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 419 transitions. [2020-11-06 22:25:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-06 22:25:47,167 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:47,167 INFO L422 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] [2020-11-06 22:25:47,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:25:47,168 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:47,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1873050503, now seen corresponding path program 1 times [2020-11-06 22:25:47,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:47,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269239676] [2020-11-06 22:25:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:47,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:47,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:47,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:47,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:25:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:47,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:25:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:47,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269239676] [2020-11-06 22:25:47,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:47,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:25:47,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864239216] [2020-11-06 22:25:47,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:25:47,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:47,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:25:47,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:47,630 INFO L87 Difference]: Start difference. First operand 316 states and 419 transitions. Second operand 12 states. [2020-11-06 22:25:47,778 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-06 22:25:47,936 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:25:49,348 WARN L194 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-11-06 22:25:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:49,681 INFO L93 Difference]: Finished difference Result 330 states and 432 transitions. [2020-11-06 22:25:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:25:49,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2020-11-06 22:25:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:49,689 INFO L225 Difference]: With dead ends: 330 [2020-11-06 22:25:49,689 INFO L226 Difference]: Without dead ends: 324 [2020-11-06 22:25:49,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:25:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-11-06 22:25:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 317. [2020-11-06 22:25:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-11-06 22:25:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 420 transitions. [2020-11-06 22:25:49,758 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 420 transitions. Word has length 47 [2020-11-06 22:25:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:49,758 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 420 transitions. [2020-11-06 22:25:49,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:25:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 420 transitions. [2020-11-06 22:25:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-06 22:25:49,760 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:49,761 INFO L422 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] [2020-11-06 22:25:49,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:25:49,762 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash -188257329, now seen corresponding path program 1 times [2020-11-06 22:25:49,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:49,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426332302] [2020-11-06 22:25:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:49,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:49,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:50,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:50,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:25:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:50,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:25:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:50,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426332302] [2020-11-06 22:25:50,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:50,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:25:50,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523153691] [2020-11-06 22:25:50,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:25:50,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:50,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:25:50,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:25:50,103 INFO L87 Difference]: Start difference. First operand 317 states and 420 transitions. Second operand 8 states. [2020-11-06 22:25:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:51,400 INFO L93 Difference]: Finished difference Result 332 states and 438 transitions. [2020-11-06 22:25:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:25:51,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2020-11-06 22:25:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:51,404 INFO L225 Difference]: With dead ends: 332 [2020-11-06 22:25:51,404 INFO L226 Difference]: Without dead ends: 103 [2020-11-06 22:25:51,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-06 22:25:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-11-06 22:25:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-06 22:25:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2020-11-06 22:25:51,426 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 48 [2020-11-06 22:25:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:51,426 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2020-11-06 22:25:51,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:25:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2020-11-06 22:25:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-06 22:25:51,428 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:51,428 INFO L422 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] [2020-11-06 22:25:51,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:25:51,428 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash -423326175, now seen corresponding path program 1 times [2020-11-06 22:25:51,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:51,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633009609] [2020-11-06 22:25:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:51,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:51,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:51,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:51,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:25:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:51,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:51,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:25:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:51,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633009609] [2020-11-06 22:25:51,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:51,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:25:51,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003829483] [2020-11-06 22:25:51,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:25:51,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:51,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:25:51,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:25:51,758 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 8 states. [2020-11-06 22:25:51,907 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-06 22:25:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:52,413 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2020-11-06 22:25:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:25:52,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-11-06 22:25:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:52,415 INFO L225 Difference]: With dead ends: 132 [2020-11-06 22:25:52,415 INFO L226 Difference]: Without dead ends: 101 [2020-11-06 22:25:52,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:25:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-06 22:25:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-11-06 22:25:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-06 22:25:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2020-11-06 22:25:52,435 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 54 [2020-11-06 22:25:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:52,436 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2020-11-06 22:25:52,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:25:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2020-11-06 22:25:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-06 22:25:52,437 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:52,438 INFO L422 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] [2020-11-06 22:25:52,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:25:52,438 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:52,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash 66580976, now seen corresponding path program 1 times [2020-11-06 22:25:52,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:52,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875499280] [2020-11-06 22:25:52,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:52,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:52,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:52,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:52,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:25:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:52,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:52,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:52,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875499280] [2020-11-06 22:25:52,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:52,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:25:52,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526657263] [2020-11-06 22:25:52,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:25:52,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:52,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:25:52,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:25:52,886 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 11 states. [2020-11-06 22:25:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:53,298 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2020-11-06 22:25:53,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:25:53,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2020-11-06 22:25:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:53,301 INFO L225 Difference]: With dead ends: 154 [2020-11-06 22:25:53,301 INFO L226 Difference]: Without dead ends: 112 [2020-11-06 22:25:53,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-06 22:25:53,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-11-06 22:25:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-06 22:25:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2020-11-06 22:25:53,315 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 58 [2020-11-06 22:25:53,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:53,316 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2020-11-06 22:25:53,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:25:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2020-11-06 22:25:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-06 22:25:53,317 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:53,317 INFO L422 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] [2020-11-06 22:25:53,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:25:53,318 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:53,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:53,318 INFO L82 PathProgramCache]: Analyzing trace with hash 836849471, now seen corresponding path program 1 times [2020-11-06 22:25:53,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:53,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000894131] [2020-11-06 22:25:53,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:53,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:53,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:53,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:53,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:25:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:53,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:53,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:53,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000894131] [2020-11-06 22:25:53,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:53,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:25:53,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743230848] [2020-11-06 22:25:53,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:25:53,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:53,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:25:53,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:25:53,666 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 11 states. [2020-11-06 22:25:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:54,146 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2020-11-06 22:25:54,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:25:54,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2020-11-06 22:25:54,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:54,149 INFO L225 Difference]: With dead ends: 118 [2020-11-06 22:25:54,149 INFO L226 Difference]: Without dead ends: 110 [2020-11-06 22:25:54,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-11-06 22:25:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-06 22:25:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2020-11-06 22:25:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-06 22:25:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2020-11-06 22:25:54,169 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 58 [2020-11-06 22:25:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:54,171 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2020-11-06 22:25:54,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:25:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2020-11-06 22:25:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-06 22:25:54,173 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:54,173 INFO L422 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] [2020-11-06 22:25:54,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-06 22:25:54,174 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:54,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:54,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1738148909, now seen corresponding path program 1 times [2020-11-06 22:25:54,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:54,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509551394] [2020-11-06 22:25:54,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:54,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:54,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:54,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:54,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:25:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:54,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:54,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:54,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509551394] [2020-11-06 22:25:54,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:54,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:25:54,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986506878] [2020-11-06 22:25:54,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:25:54,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:54,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:25:54,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:25:54,489 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 8 states. [2020-11-06 22:25:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:54,991 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2020-11-06 22:25:54,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:25:54,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2020-11-06 22:25:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:54,994 INFO L225 Difference]: With dead ends: 206 [2020-11-06 22:25:54,995 INFO L226 Difference]: Without dead ends: 198 [2020-11-06 22:25:54,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:25:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-11-06 22:25:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2020-11-06 22:25:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-11-06 22:25:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 211 transitions. [2020-11-06 22:25:55,038 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 211 transitions. Word has length 59 [2020-11-06 22:25:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:55,038 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 211 transitions. [2020-11-06 22:25:55,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:25:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 211 transitions. [2020-11-06 22:25:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-06 22:25:55,039 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:55,040 INFO L422 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] [2020-11-06 22:25:55,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:25:55,040 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:55,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1747471761, now seen corresponding path program 1 times [2020-11-06 22:25:55,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:55,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228698720] [2020-11-06 22:25:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:55,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:55,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:55,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:55,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:25:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:55,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:55,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:55,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228698720] [2020-11-06 22:25:55,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:55,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:25:55,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768815689] [2020-11-06 22:25:55,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:25:55,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:55,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:25:55,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:25:55,429 INFO L87 Difference]: Start difference. First operand 185 states and 211 transitions. Second operand 10 states. [2020-11-06 22:25:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:55,728 INFO L93 Difference]: Finished difference Result 250 states and 286 transitions. [2020-11-06 22:25:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:25:55,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2020-11-06 22:25:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:55,731 INFO L225 Difference]: With dead ends: 250 [2020-11-06 22:25:55,731 INFO L226 Difference]: Without dead ends: 173 [2020-11-06 22:25:55,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:25:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-06 22:25:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-11-06 22:25:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-11-06 22:25:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 193 transitions. [2020-11-06 22:25:55,757 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 193 transitions. Word has length 59 [2020-11-06 22:25:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:55,758 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 193 transitions. [2020-11-06 22:25:55,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:25:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 193 transitions. [2020-11-06 22:25:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-06 22:25:55,760 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:55,760 INFO L422 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] [2020-11-06 22:25:55,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-06 22:25:55,761 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:55,761 INFO L82 PathProgramCache]: Analyzing trace with hash 298750794, now seen corresponding path program 1 times [2020-11-06 22:25:55,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:55,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398337484] [2020-11-06 22:25:55,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:55,958 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:25:55,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:56,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:56,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:56,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:25:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:56,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:56,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:56,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:25:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:56,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398337484] [2020-11-06 22:25:56,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:56,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:25:56,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444848864] [2020-11-06 22:25:56,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:25:56,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:56,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:25:56,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:56,259 INFO L87 Difference]: Start difference. First operand 173 states and 193 transitions. Second operand 12 states. [2020-11-06 22:25:56,420 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-06 22:25:56,571 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:25:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:56,969 INFO L93 Difference]: Finished difference Result 222 states and 252 transitions. [2020-11-06 22:25:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:25:56,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-11-06 22:25:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:56,971 INFO L225 Difference]: With dead ends: 222 [2020-11-06 22:25:56,971 INFO L226 Difference]: Without dead ends: 157 [2020-11-06 22:25:56,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:25:56,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-11-06 22:25:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-11-06 22:25:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-11-06 22:25:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2020-11-06 22:25:57,001 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 63 [2020-11-06 22:25:57,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:57,001 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2020-11-06 22:25:57,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:25:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2020-11-06 22:25:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-06 22:25:57,002 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:57,002 INFO L422 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] [2020-11-06 22:25:57,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-06 22:25:57,004 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:57,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:57,005 INFO L82 PathProgramCache]: Analyzing trace with hash -622762419, now seen corresponding path program 1 times [2020-11-06 22:25:57,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:57,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353866948] [2020-11-06 22:25:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:57,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:57,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:57,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:57,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:25:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:57,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:57,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:57,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:25:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:57,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353866948] [2020-11-06 22:25:57,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:57,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:25:57,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781346486] [2020-11-06 22:25:57,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:25:57,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:57,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:25:57,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:25:57,317 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand 9 states. [2020-11-06 22:25:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:57,750 INFO L93 Difference]: Finished difference Result 218 states and 246 transitions. [2020-11-06 22:25:57,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:25:57,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-11-06 22:25:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:57,755 INFO L225 Difference]: With dead ends: 218 [2020-11-06 22:25:57,755 INFO L226 Difference]: Without dead ends: 169 [2020-11-06 22:25:57,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:25:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-11-06 22:25:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2020-11-06 22:25:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-11-06 22:25:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2020-11-06 22:25:57,799 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 65 [2020-11-06 22:25:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:57,800 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2020-11-06 22:25:57,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:25:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2020-11-06 22:25:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-06 22:25:57,802 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:57,802 INFO L422 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] [2020-11-06 22:25:57,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-06 22:25:57,802 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:57,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1633879669, now seen corresponding path program 1 times [2020-11-06 22:25:57,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:57,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012199321] [2020-11-06 22:25:57,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:57,966 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:25:57,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:25:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:25:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:58,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012199321] [2020-11-06 22:25:58,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:58,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:25:58,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610934426] [2020-11-06 22:25:58,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:25:58,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:58,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:25:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:25:58,123 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand 9 states. [2020-11-06 22:25:58,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:58,460 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2020-11-06 22:25:58,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:25:58,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-11-06 22:25:58,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:58,461 INFO L225 Difference]: With dead ends: 185 [2020-11-06 22:25:58,462 INFO L226 Difference]: Without dead ends: 179 [2020-11-06 22:25:58,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:25:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-11-06 22:25:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2020-11-06 22:25:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-11-06 22:25:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2020-11-06 22:25:58,486 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 65 [2020-11-06 22:25:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:58,487 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2020-11-06 22:25:58,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:25:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2020-11-06 22:25:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-06 22:25:58,488 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:58,488 INFO L422 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] [2020-11-06 22:25:58,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-06 22:25:58,488 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash 859980764, now seen corresponding path program 1 times [2020-11-06 22:25:58,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:58,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889688287] [2020-11-06 22:25:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:25:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:25:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:58,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889688287] [2020-11-06 22:25:58,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:58,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:25:58,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410383077] [2020-11-06 22:25:58,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:25:58,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:58,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:25:58,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:58,830 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand 12 states. [2020-11-06 22:25:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:59,171 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2020-11-06 22:25:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:25:59,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2020-11-06 22:25:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:59,173 INFO L225 Difference]: With dead ends: 184 [2020-11-06 22:25:59,174 INFO L226 Difference]: Without dead ends: 176 [2020-11-06 22:25:59,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:25:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-11-06 22:25:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2020-11-06 22:25:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-11-06 22:25:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2020-11-06 22:25:59,204 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 65 [2020-11-06 22:25:59,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:59,204 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2020-11-06 22:25:59,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:25:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2020-11-06 22:25:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-06 22:25:59,206 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:59,206 INFO L422 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] [2020-11-06 22:25:59,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-06 22:25:59,206 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:59,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2107663365, now seen corresponding path program 1 times [2020-11-06 22:25:59,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:59,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345460933] [2020-11-06 22:25:59,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:59,488 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:25:59,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:59,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:59,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:59,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:25:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:59,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:59,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:59,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:25:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:59,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345460933] [2020-11-06 22:25:59,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:59,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:25:59,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729861401] [2020-11-06 22:25:59,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:25:59,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:25:59,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:59,793 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 12 states. [2020-11-06 22:25:59,951 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:26:00,264 WARN L194 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-11-06 22:26:00,733 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:26:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:00,885 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2020-11-06 22:26:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:26:00,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2020-11-06 22:26:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:00,888 INFO L225 Difference]: With dead ends: 171 [2020-11-06 22:26:00,888 INFO L226 Difference]: Without dead ends: 145 [2020-11-06 22:26:00,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:26:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-06 22:26:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-11-06 22:26:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-11-06 22:26:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2020-11-06 22:26:00,911 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 66 [2020-11-06 22:26:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:00,912 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2020-11-06 22:26:00,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:26:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2020-11-06 22:26:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-06 22:26:00,913 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:00,914 INFO L422 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] [2020-11-06 22:26:00,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-06 22:26:00,914 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:00,915 INFO L82 PathProgramCache]: Analyzing trace with hash -295561405, now seen corresponding path program 1 times [2020-11-06 22:26:00,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:00,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119398175] [2020-11-06 22:26:00,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:26:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:26:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:26:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:26:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:26:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:26:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:01,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119398175] [2020-11-06 22:26:01,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:01,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:26:01,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496629910] [2020-11-06 22:26:01,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:26:01,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:01,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:26:01,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:26:01,272 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 9 states. [2020-11-06 22:26:01,534 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-06 22:26:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:01,635 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2020-11-06 22:26:01,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:26:01,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-11-06 22:26:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:01,638 INFO L225 Difference]: With dead ends: 171 [2020-11-06 22:26:01,638 INFO L226 Difference]: Without dead ends: 138 [2020-11-06 22:26:01,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:26:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-11-06 22:26:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-11-06 22:26:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-11-06 22:26:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2020-11-06 22:26:01,662 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 66 [2020-11-06 22:26:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:01,662 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2020-11-06 22:26:01,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:26:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2020-11-06 22:26:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-06 22:26:01,664 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:01,664 INFO L422 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] [2020-11-06 22:26:01,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-06 22:26:01,664 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1830425452, now seen corresponding path program 1 times [2020-11-06 22:26:01,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:01,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213174727] [2020-11-06 22:26:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:26:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:26:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:01,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:26:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:26:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:26:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:26:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:02,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213174727] [2020-11-06 22:26:02,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:02,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:26:02,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643869360] [2020-11-06 22:26:02,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:26:02,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:02,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:26:02,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:26:02,119 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 12 states. [2020-11-06 22:26:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:02,589 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2020-11-06 22:26:02,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:26:02,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2020-11-06 22:26:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:02,591 INFO L225 Difference]: With dead ends: 150 [2020-11-06 22:26:02,591 INFO L226 Difference]: Without dead ends: 138 [2020-11-06 22:26:02,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:26:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-11-06 22:26:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-11-06 22:26:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-11-06 22:26:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2020-11-06 22:26:02,613 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 66 [2020-11-06 22:26:02,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:02,613 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2020-11-06 22:26:02,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:26:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2020-11-06 22:26:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-06 22:26:02,615 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:02,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:02,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-06 22:26:02,615 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:02,616 INFO L82 PathProgramCache]: Analyzing trace with hash 281047691, now seen corresponding path program 1 times [2020-11-06 22:26:02,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:02,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169588145] [2020-11-06 22:26:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:26:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:26:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:26:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:26:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:26:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:26:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:26:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:02,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169588145] [2020-11-06 22:26:02,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:02,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:26:02,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125100197] [2020-11-06 22:26:02,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:26:02,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:02,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:26:02,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:26:02,974 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand 11 states. [2020-11-06 22:26:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:03,283 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2020-11-06 22:26:03,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:26:03,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2020-11-06 22:26:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:03,284 INFO L225 Difference]: With dead ends: 138 [2020-11-06 22:26:03,284 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:26:03,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:26:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:26:03,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:26:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:26:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:26:03,286 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2020-11-06 22:26:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:03,286 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:26:03,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:26:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:26:03,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:26:03,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-06 22:26:03,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:26:04,596 WARN L194 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 56 [2020-11-06 22:26:04,840 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-11-06 22:26:05,025 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2020-11-06 22:26:05,408 WARN L194 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2020-11-06 22:26:05,537 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-11-06 22:26:05,752 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-11-06 22:26:06,219 WARN L194 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 30 [2020-11-06 22:26:06,437 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 64 [2020-11-06 22:26:06,803 WARN L194 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 50 [2020-11-06 22:26:07,114 WARN L194 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 36 [2020-11-06 22:26:07,378 WARN L194 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-11-06 22:26:07,928 WARN L194 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2020-11-06 22:26:08,220 WARN L194 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2020-11-06 22:26:08,466 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 51 [2020-11-06 22:26:08,614 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-11-06 22:26:09,108 WARN L194 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 53 [2020-11-06 22:26:09,461 WARN L194 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 68 [2020-11-06 22:26:09,611 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-11-06 22:26:09,726 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-11-06 22:26:09,829 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2020-11-06 22:26:10,078 WARN L194 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 56 [2020-11-06 22:26:10,208 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2020-11-06 22:26:10,455 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 51 [2020-11-06 22:26:10,701 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-11-06 22:26:11,058 WARN L194 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 38 [2020-11-06 22:26:11,370 WARN L194 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 36 [2020-11-06 22:26:11,832 WARN L194 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 52 [2020-11-06 22:26:11,972 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-11-06 22:26:12,077 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2020-11-06 22:26:12,483 WARN L194 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-11-06 22:26:12,661 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-11-06 22:26:13,029 WARN L194 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 51 [2020-11-06 22:26:13,263 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-11-06 22:26:13,409 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2020-11-06 22:26:13,631 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-11-06 22:26:13,832 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-11-06 22:26:14,083 WARN L194 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 76 [2020-11-06 22:26:14,236 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-11-06 22:26:14,383 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-11-06 22:26:14,627 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-11-06 22:26:14,872 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-11-06 22:26:15,025 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-11-06 22:26:15,365 WARN L194 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 51 [2020-11-06 22:26:15,595 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2020-11-06 22:26:15,741 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-11-06 22:26:15,848 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-11-06 22:26:15,996 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-11-06 22:26:16,101 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-11-06 22:26:16,474 WARN L194 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 49 [2020-11-06 22:26:16,582 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-11-06 22:26:16,741 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2020-11-06 22:26:17,052 WARN L194 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 57 [2020-11-06 22:26:17,165 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2020-11-06 22:26:17,357 WARN L194 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-11-06 22:26:17,728 WARN L194 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 36 [2020-11-06 22:26:17,873 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-11-06 22:26:18,023 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-11-06 22:26:18,030 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2020-11-06 22:26:18,030 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-06 22:26:18,030 INFO L266 CegarLoopResult]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2020-11-06 22:26:18,031 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-06 22:26:18,031 INFO L262 CegarLoopResult]: At program point L624(line 624) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (= ~s~0 ~NP~0))) [2020-11-06 22:26:18,031 INFO L262 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 618 628) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (= ~s~0 ~NP~0))) [2020-11-06 22:26:18,031 INFO L266 CegarLoopResult]: For program point L624-1(line 624) no Hoare annotation was computed. [2020-11-06 22:26:18,032 INFO L266 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 618 628) no Hoare annotation was computed. [2020-11-06 22:26:18,032 INFO L266 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 618 628) no Hoare annotation was computed. [2020-11-06 22:26:18,032 INFO L262 CegarLoopResult]: At program point KeSetEventENTRY(lines 568 575) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (= ~s~0 ~NP~0))) [2020-11-06 22:26:18,032 INFO L266 CegarLoopResult]: For program point KeSetEventFINAL(lines 568 575) no Hoare annotation was computed. [2020-11-06 22:26:18,032 INFO L266 CegarLoopResult]: For program point KeSetEventEXIT(lines 568 575) no Hoare annotation was computed. [2020-11-06 22:26:18,032 INFO L266 CegarLoopResult]: For program point L700(lines 700 729) no Hoare annotation was computed. [2020-11-06 22:26:18,032 INFO L266 CegarLoopResult]: For program point KbFilter_PowerEXIT(lines 689 744) no Hoare annotation was computed. [2020-11-06 22:26:18,032 INFO L266 CegarLoopResult]: For program point L709(lines 709 726) no Hoare annotation was computed. [2020-11-06 22:26:18,032 INFO L262 CegarLoopResult]: At program point L740(line 740) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~SKIP1~0 ~s~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,033 INFO L262 CegarLoopResult]: At program point KbFilter_PowerENTRY(lines 689 744) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,033 INFO L266 CegarLoopResult]: For program point L740-1(line 740) no Hoare annotation was computed. [2020-11-06 22:26:18,033 INFO L266 CegarLoopResult]: For program point L703(lines 703 728) no Hoare annotation was computed. [2020-11-06 22:26:18,033 INFO L262 CegarLoopResult]: At program point L734(line 734) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,033 INFO L262 CegarLoopResult]: At program point L701(lines 700 729) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,033 INFO L266 CegarLoopResult]: For program point L734-1(lines 730 736) no Hoare annotation was computed. [2020-11-06 22:26:18,034 INFO L262 CegarLoopResult]: At program point L724(lines 699 743) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,034 INFO L266 CegarLoopResult]: For program point KbFilter_PowerFINAL(lines 689 744) no Hoare annotation was computed. [2020-11-06 22:26:18,034 INFO L266 CegarLoopResult]: For program point L706(lines 706 727) no Hoare annotation was computed. [2020-11-06 22:26:18,034 INFO L266 CegarLoopResult]: For program point stub_driver_initEXIT(lines 43 56) no Hoare annotation was computed. [2020-11-06 22:26:18,034 INFO L262 CegarLoopResult]: At program point stub_driver_initENTRY(lines 43 56) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= |old(~pended~0)| 1) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,034 INFO L266 CegarLoopResult]: For program point stub_driver_initFINAL(lines 43 56) no Hoare annotation was computed. [2020-11-06 22:26:18,034 INFO L266 CegarLoopResult]: For program point _BLAST_initFINAL(lines 57 78) no Hoare annotation was computed. [2020-11-06 22:26:18,035 INFO L262 CegarLoopResult]: At program point _BLAST_initENTRY(lines 57 78) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-11-06 22:26:18,035 INFO L266 CegarLoopResult]: For program point _BLAST_initEXIT(lines 57 78) no Hoare annotation was computed. [2020-11-06 22:26:18,035 INFO L269 CegarLoopResult]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2020-11-06 22:26:18,035 INFO L266 CegarLoopResult]: For program point errorFnFINAL(lines 1009 1016) no Hoare annotation was computed. [2020-11-06 22:26:18,035 INFO L266 CegarLoopResult]: For program point errorFnEXIT(lines 1009 1016) no Hoare annotation was computed. [2020-11-06 22:26:18,035 INFO L266 CegarLoopResult]: For program point L1013(line 1013) no Hoare annotation was computed. [2020-11-06 22:26:18,035 INFO L266 CegarLoopResult]: For program point L415(lines 415 419) no Hoare annotation was computed. [2020-11-06 22:26:18,035 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 295 466) no Hoare annotation was computed. [2020-11-06 22:26:18,036 INFO L262 CegarLoopResult]: At program point L374(lines 373 408) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (= 2 ~DC~0) (not (= ~pended~0 1)))) [2020-11-06 22:26:18,036 INFO L266 CegarLoopResult]: For program point L432(lines 432 459) no Hoare annotation was computed. [2020-11-06 22:26:18,036 INFO L266 CegarLoopResult]: For program point L358(lines 358 411) no Hoare annotation was computed. [2020-11-06 22:26:18,036 INFO L266 CegarLoopResult]: For program point L449(lines 449 457) no Hoare annotation was computed. [2020-11-06 22:26:18,036 INFO L262 CegarLoopResult]: At program point L441(lines 432 459) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (<= ~compRegistered~0 0) (= ~compRegistered~0 1))) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-11-06 22:26:18,036 INFO L266 CegarLoopResult]: For program point L433(lines 433 439) no Hoare annotation was computed. [2020-11-06 22:26:18,036 INFO L266 CegarLoopResult]: For program point L400(line 400) no Hoare annotation was computed. [2020-11-06 22:26:18,037 INFO L262 CegarLoopResult]: At program point L359(lines 358 411) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (= 2 ~DC~0) (not (= ~pended~0 1)))) [2020-11-06 22:26:18,037 INFO L266 CegarLoopResult]: For program point L450(lines 450 452) no Hoare annotation was computed. [2020-11-06 22:26:18,037 INFO L262 CegarLoopResult]: At program point L376(lines 375 408) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-11-06 22:26:18,037 INFO L266 CegarLoopResult]: For program point L434(lines 434 436) no Hoare annotation was computed. [2020-11-06 22:26:18,037 INFO L266 CegarLoopResult]: For program point L368(lines 368 409) no Hoare annotation was computed. [2020-11-06 22:26:18,037 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 295 466) no Hoare annotation was computed. [2020-11-06 22:26:18,037 INFO L266 CegarLoopResult]: For program point L385(line 385) no Hoare annotation was computed. [2020-11-06 22:26:18,038 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 295 466) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0) (= |old(~DevicePowerState~0)| ~DevicePowerState~0) (= ~myStatus~0 |old(~myStatus~0)|))) [2020-11-06 22:26:18,038 INFO L266 CegarLoopResult]: For program point L443(lines 443 447) no Hoare annotation was computed. [2020-11-06 22:26:18,038 INFO L266 CegarLoopResult]: For program point L344(lines 330 413) no Hoare annotation was computed. [2020-11-06 22:26:18,038 INFO L262 CegarLoopResult]: At program point L369(lines 368 409) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (= 2 ~DC~0) (not (= ~pended~0 1)))) [2020-11-06 22:26:18,038 INFO L262 CegarLoopResult]: At program point L328(line 328) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~MPR3~0 ~s~0) (<= ~s~0 ~DC~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= main_~status~1 0) (<= ~DC~0 ~s~0) (not (= ~pended~0 1)))) [2020-11-06 22:26:18,038 INFO L266 CegarLoopResult]: For program point L328-1(lines 324 465) no Hoare annotation was computed. [2020-11-06 22:26:18,038 INFO L266 CegarLoopResult]: For program point L353(lines 353 412) no Hoare annotation was computed. [2020-11-06 22:26:18,038 INFO L266 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2020-11-06 22:26:18,039 INFO L262 CegarLoopResult]: At program point L354(lines 353 412) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (= 2 ~DC~0) (not (= ~pended~0 1)))) [2020-11-06 22:26:18,039 INFO L262 CegarLoopResult]: At program point L445(line 445) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-11-06 22:26:18,039 INFO L262 CegarLoopResult]: At program point L429(lines 422 462) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (<= ~compRegistered~0 0) (= ~compRegistered~0 1))) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-11-06 22:26:18,039 INFO L266 CegarLoopResult]: For program point L363(lines 363 410) no Hoare annotation was computed. [2020-11-06 22:26:18,039 INFO L262 CegarLoopResult]: At program point L330(lines 324 465) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (<= ~compRegistered~0 0) (= ~compRegistered~0 1))) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-11-06 22:26:18,039 INFO L266 CegarLoopResult]: For program point L454(lines 454 456) no Hoare annotation was computed. [2020-11-06 22:26:18,040 INFO L262 CegarLoopResult]: At program point L421(lines 414 463) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (<= ~compRegistered~0 0) (= ~compRegistered~0 1))) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-11-06 22:26:18,040 INFO L266 CegarLoopResult]: For program point L380(line 380) no Hoare annotation was computed. [2020-11-06 22:26:18,040 INFO L266 CegarLoopResult]: For program point L339(lines 339 342) no Hoare annotation was computed. [2020-11-06 22:26:18,040 INFO L262 CegarLoopResult]: At program point L339-2(lines 339 342) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~NP~0 1) (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 5 ~MPR1~0))) [2020-11-06 22:26:18,040 INFO L266 CegarLoopResult]: For program point L430(lines 414 463) no Hoare annotation was computed. [2020-11-06 22:26:18,040 INFO L262 CegarLoopResult]: At program point L364(lines 363 410) the Hoare annotation is: (or (not (<= |old(~DC~0)| |old(~s~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (= |old(~pended~0)| 1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~NP~0 1) (<= 7 ~IPC~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (<= 6 ~MPR3~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 5 ~MPR1~0))) [2020-11-06 22:26:18,040 INFO L266 CegarLoopResult]: For program point L373(lines 373 408) no Hoare annotation was computed. [2020-11-06 22:26:18,041 INFO L266 CegarLoopResult]: For program point L431(lines 431 460) no Hoare annotation was computed. [2020-11-06 22:26:18,041 INFO L266 CegarLoopResult]: For program point L423(lines 423 427) no Hoare annotation was computed. [2020-11-06 22:26:18,041 INFO L266 CegarLoopResult]: For program point L390(line 390) no Hoare annotation was computed. [2020-11-06 22:26:18,041 INFO L262 CegarLoopResult]: At program point L510(lines 509 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse3) (or .cse0 .cse1 .cse2 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-11-06 22:26:18,041 INFO L266 CegarLoopResult]: For program point L532(lines 532 549) no Hoare annotation was computed. [2020-11-06 22:26:18,041 INFO L262 CegarLoopResult]: At program point IofCallDriverENTRY(lines 481 553) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse1 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse5 (not (<= 4 ~SKIP2~0)))) (and (or (and .cse0 .cse1 (= ~s~0 ~NP~0)) (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse2 .cse3 .cse4 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) .cse5) (or .cse2 .cse3 .cse4 (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-11-06 22:26:18,042 INFO L266 CegarLoopResult]: For program point L495(lines 495 499) no Hoare annotation was computed. [2020-11-06 22:26:18,042 INFO L262 CegarLoopResult]: At program point L524(lines 488 552) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0)) (.cse2 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 (and .cse1 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse2) (and .cse1 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse2) .cse3 .cse4 (not (<= 5 ~MPR1~0)) (not (= |old(~s~0)| 1)) (and (<= IofCallDriver_~returnVal2~0 0) .cse1 (<= 0 IofCallDriver_~returnVal2~0) .cse2) (not (= ~NP~0 1)) .cse5)) (or .cse0 .cse3 .cse4 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-11-06 22:26:18,042 INFO L262 CegarLoopResult]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) .cse3) (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-11-06 22:26:18,042 INFO L266 CegarLoopResult]: For program point L491-1(line 491) no Hoare annotation was computed. [2020-11-06 22:26:18,042 INFO L266 CegarLoopResult]: For program point IofCallDriverFINAL(lines 481 553) no Hoare annotation was computed. [2020-11-06 22:26:18,043 INFO L262 CegarLoopResult]: At program point L512(lines 511 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) .cse3 (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or .cse0 .cse1 .cse2 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-11-06 22:26:18,043 INFO L266 CegarLoopResult]: For program point L541(lines 541 548) no Hoare annotation was computed. [2020-11-06 22:26:18,043 INFO L266 CegarLoopResult]: For program point L504(lines 504 527) no Hoare annotation was computed. [2020-11-06 22:26:18,043 INFO L266 CegarLoopResult]: For program point IofCallDriverEXIT(lines 481 553) no Hoare annotation was computed. [2020-11-06 22:26:18,043 INFO L266 CegarLoopResult]: For program point L533(lines 533 539) no Hoare annotation was computed. [2020-11-06 22:26:18,043 INFO L262 CegarLoopResult]: At program point L546(line 546) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) .cse3))) [2020-11-06 22:26:18,043 INFO L266 CegarLoopResult]: For program point L546-1(lines 528 550) no Hoare annotation was computed. [2020-11-06 22:26:18,043 INFO L266 CegarLoopResult]: For program point L509(lines 509 526) no Hoare annotation was computed. [2020-11-06 22:26:18,044 INFO L262 CegarLoopResult]: At program point L505(lines 504 527) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse3) (or .cse0 .cse1 .cse2 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-11-06 22:26:18,044 INFO L262 CegarLoopResult]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 (and (= ~s~0 1) (= ~setEventCalled~0 1) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) .cse3))) [2020-11-06 22:26:18,044 INFO L266 CegarLoopResult]: For program point L489(lines 489 501) no Hoare annotation was computed. [2020-11-06 22:26:18,044 INFO L266 CegarLoopResult]: For program point L489-1(lines 489 501) no Hoare annotation was computed. [2020-11-06 22:26:18,044 INFO L262 CegarLoopResult]: At program point L475(line 475) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~setEventCalled~0 1)) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,044 INFO L266 CegarLoopResult]: For program point L475-1(lines 467 480) no Hoare annotation was computed. [2020-11-06 22:26:18,044 INFO L262 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 467 480) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (not (= ~compRegistered~0 1)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~s~0 ~NP~0) (not (= ~setEventCalled~0 1)) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,044 INFO L266 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 467 480) no Hoare annotation was computed. [2020-11-06 22:26:18,045 INFO L262 CegarLoopResult]: At program point L762(line 762) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,045 INFO L266 CegarLoopResult]: For program point PoCallDriverEXIT(lines 745 821) no Hoare annotation was computed. [2020-11-06 22:26:18,045 INFO L266 CegarLoopResult]: For program point L754(lines 754 766) no Hoare annotation was computed. [2020-11-06 22:26:18,045 INFO L266 CegarLoopResult]: For program point L754-1(lines 754 766) no Hoare annotation was computed. [2020-11-06 22:26:18,045 INFO L262 CegarLoopResult]: At program point L775(lines 774 791) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,045 INFO L266 CegarLoopResult]: For program point L800(lines 800 806) no Hoare annotation was computed. [2020-11-06 22:26:18,045 INFO L266 CegarLoopResult]: For program point PoCallDriverFINAL(lines 745 821) no Hoare annotation was computed. [2020-11-06 22:26:18,045 INFO L262 CegarLoopResult]: At program point PoCallDriverENTRY(lines 745 821) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,046 INFO L266 CegarLoopResult]: For program point L809(lines 809 816) no Hoare annotation was computed. [2020-11-06 22:26:18,046 INFO L266 CegarLoopResult]: For program point L797(lines 797 817) no Hoare annotation was computed. [2020-11-06 22:26:18,046 INFO L266 CegarLoopResult]: For program point L760(lines 760 764) no Hoare annotation was computed. [2020-11-06 22:26:18,046 INFO L262 CegarLoopResult]: At program point L789(lines 753 820) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,046 INFO L262 CegarLoopResult]: At program point L756(line 756) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,046 INFO L266 CegarLoopResult]: For program point L756-1(line 756) no Hoare annotation was computed. [2020-11-06 22:26:18,046 INFO L262 CegarLoopResult]: At program point L814(line 814) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,046 INFO L266 CegarLoopResult]: For program point L814-1(lines 793 818) no Hoare annotation was computed. [2020-11-06 22:26:18,047 INFO L262 CegarLoopResult]: At program point L777(lines 776 791) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,047 INFO L266 CegarLoopResult]: For program point L769(lines 769 792) no Hoare annotation was computed. [2020-11-06 22:26:18,047 INFO L266 CegarLoopResult]: For program point L774(lines 774 791) no Hoare annotation was computed. [2020-11-06 22:26:18,047 INFO L262 CegarLoopResult]: At program point L770(lines 769 792) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,047 INFO L266 CegarLoopResult]: For program point L638(lines 638 656) no Hoare annotation was computed. [2020-11-06 22:26:18,047 INFO L266 CegarLoopResult]: For program point KbFilter_CreateCloseEXIT(lines 629 664) no Hoare annotation was computed. [2020-11-06 22:26:18,047 INFO L262 CegarLoopResult]: At program point L653(lines 641 655) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,048 INFO L262 CegarLoopResult]: At program point L645(lines 638 656) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,048 INFO L266 CegarLoopResult]: For program point L641(lines 641 655) no Hoare annotation was computed. [2020-11-06 22:26:18,048 INFO L262 CegarLoopResult]: At program point KbFilter_CreateCloseENTRY(lines 629 664) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,048 INFO L262 CegarLoopResult]: At program point L660(line 660) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,048 INFO L266 CegarLoopResult]: For program point L660-1(line 660) no Hoare annotation was computed. [2020-11-06 22:26:18,048 INFO L266 CegarLoopResult]: For program point KbFilter_CreateCloseFINAL(lines 629 664) no Hoare annotation was computed. [2020-11-06 22:26:18,048 INFO L266 CegarLoopResult]: For program point L644(lines 644 654) no Hoare annotation was computed. [2020-11-06 22:26:18,048 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:26:18,049 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~NP~0 |old(~NP~0)|) (= ~DevicePowerState~0 |old(~DevicePowerState~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#valid)| |#valid|) (= ~IPC~0 |old(~IPC~0)|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~DC~0 |old(~DC~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= ~Executive~0 |old(~Executive~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~MPR3~0 |old(~MPR3~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-11-06 22:26:18,049 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:26:18,049 INFO L266 CegarLoopResult]: For program point L956(lines 956 958) no Hoare annotation was computed. [2020-11-06 22:26:18,049 INFO L266 CegarLoopResult]: For program point L956-2(lines 934 971) no Hoare annotation was computed. [2020-11-06 22:26:18,049 INFO L266 CegarLoopResult]: For program point KbFilter_InternIoCtlEXIT(lines 822 1007) no Hoare annotation was computed. [2020-11-06 22:26:18,049 INFO L266 CegarLoopResult]: For program point L940(lines 940 943) no Hoare annotation was computed. [2020-11-06 22:26:18,049 INFO L266 CegarLoopResult]: For program point L903(lines 903 982) no Hoare annotation was computed. [2020-11-06 22:26:18,049 INFO L266 CegarLoopResult]: For program point L924(lines 924 976) no Hoare annotation was computed. [2020-11-06 22:26:18,049 INFO L266 CegarLoopResult]: For program point L891(lines 891 986) no Hoare annotation was computed. [2020-11-06 22:26:18,049 INFO L266 CegarLoopResult]: For program point L883(lines 883 988) no Hoare annotation was computed. [2020-11-06 22:26:18,049 INFO L266 CegarLoopResult]: For program point L875(lines 875 990) no Hoare annotation was computed. [2020-11-06 22:26:18,050 INFO L262 CegarLoopResult]: At program point L1003(line 1003) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,050 INFO L266 CegarLoopResult]: For program point L1003-1(line 1003) no Hoare annotation was computed. [2020-11-06 22:26:18,050 INFO L266 CegarLoopResult]: For program point L896(lines 896 984) no Hoare annotation was computed. [2020-11-06 22:26:18,050 INFO L262 CegarLoopResult]: At program point L892(lines 891 986) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,050 INFO L266 CegarLoopResult]: For program point L917(lines 917 978) no Hoare annotation was computed. [2020-11-06 22:26:18,050 INFO L262 CegarLoopResult]: At program point L884(lines 883 988) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,050 INFO L266 CegarLoopResult]: For program point L934(lines 934 973) no Hoare annotation was computed. [2020-11-06 22:26:18,050 INFO L266 CegarLoopResult]: For program point L959-1(lines 959 961) no Hoare annotation was computed. [2020-11-06 22:26:18,051 INFO L262 CegarLoopResult]: At program point KbFilter_InternIoCtlENTRY(lines 822 1007) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,051 INFO L266 CegarLoopResult]: For program point L910(lines 910 980) no Hoare annotation was computed. [2020-11-06 22:26:18,051 INFO L262 CegarLoopResult]: At program point L972(lines 867 1006) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,051 INFO L262 CegarLoopResult]: At program point L935(lines 875 990) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,051 INFO L262 CegarLoopResult]: At program point L997(line 997) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,051 INFO L266 CegarLoopResult]: For program point L997-1(line 997) no Hoare annotation was computed. [2020-11-06 22:26:18,052 INFO L266 CegarLoopResult]: For program point KbFilter_InternIoCtlFINAL(lines 822 1007) no Hoare annotation was computed. [2020-11-06 22:26:18,052 INFO L266 CegarLoopResult]: For program point L931(lines 931 974) no Hoare annotation was computed. [2020-11-06 22:26:18,052 INFO L266 CegarLoopResult]: For program point L603(lines 603 615) no Hoare annotation was computed. [2020-11-06 22:26:18,052 INFO L266 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 576 617) no Hoare annotation was computed. [2020-11-06 22:26:18,052 INFO L262 CegarLoopResult]: At program point L589(lines 581 600) the Hoare annotation is: (let ((.cse0 (not (<= 6 ~MPR3~0))) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 5 ~MPR1~0))) (.cse6 (not (= ~NP~0 1))) (.cse7 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| 1)) .cse6 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|)) .cse7))) [2020-11-06 22:26:18,052 INFO L266 CegarLoopResult]: For program point L581(lines 581 600) no Hoare annotation was computed. [2020-11-06 22:26:18,052 INFO L262 CegarLoopResult]: At program point L606(lines 605 615) the Hoare annotation is: (let ((.cse0 (not (<= 6 ~MPR3~0))) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (= ~s~0 ~NP~0)) (.cse6 (not (<= 5 ~MPR1~0))) (.cse7 (not (= ~NP~0 1))) (.cse8 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~s~0)| 1)) .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|)) .cse8))) [2020-11-06 22:26:18,053 INFO L266 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 576 617) no Hoare annotation was computed. [2020-11-06 22:26:18,053 INFO L262 CegarLoopResult]: At program point L604(lines 603 615) the Hoare annotation is: (let ((.cse0 (not (<= 6 ~MPR3~0))) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (= ~s~0 ~NP~0)) (.cse6 (not (<= 5 ~MPR1~0))) (.cse7 (not (= ~NP~0 1))) (.cse8 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~s~0)| 1)) .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|)) .cse8))) [2020-11-06 22:26:18,053 INFO L262 CegarLoopResult]: At program point L596(line 596) the Hoare annotation is: (let ((.cse0 (not (<= 6 ~MPR3~0))) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 5 ~MPR1~0))) (.cse6 (not (= ~NP~0 1))) (.cse7 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| 1)) .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|)) .cse7))) [2020-11-06 22:26:18,053 INFO L266 CegarLoopResult]: For program point L594(lines 594 598) no Hoare annotation was computed. [2020-11-06 22:26:18,053 INFO L266 CegarLoopResult]: For program point L594-1(lines 581 600) no Hoare annotation was computed. [2020-11-06 22:26:18,054 INFO L262 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 576 617) the Hoare annotation is: (let ((.cse0 (not (<= 6 ~MPR3~0))) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (= ~pended~0 1)) (.cse3 (not (= 2 ~DC~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 5 ~MPR1~0))) (.cse8 (not (= ~NP~0 1))) (.cse6 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse9 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~setEventCalled~0)| 1)) .cse5 (and (= ~MPR3~0 ~s~0) .cse6 .cse7) .cse8 (not (= ~MPR3~0 |old(~s~0)|)) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| 1)) .cse8 (and .cse6 (= ~s~0 ~NP~0) .cse7) .cse9))) [2020-11-06 22:26:18,054 INFO L266 CegarLoopResult]: For program point L582(lines 582 587) no Hoare annotation was computed. [2020-11-06 22:26:18,054 INFO L266 CegarLoopResult]: For program point L562-1(lines 554 567) no Hoare annotation was computed. [2020-11-06 22:26:18,054 INFO L266 CegarLoopResult]: For program point L558(lines 558 564) no Hoare annotation was computed. [2020-11-06 22:26:18,054 INFO L262 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 554 567) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 0))) (or (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-11-06 22:26:18,054 INFO L266 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 554 567) no Hoare annotation was computed. [2020-11-06 22:26:18,054 INFO L262 CegarLoopResult]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (= 2 ~DC~0))) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (= ~NP~0 |old(~s~0)|))) (.cse4 (not (<= 4 ~SKIP2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~compRegistered~0 0))) (or (not (= ~compRegistered~0 1)) .cse0 .cse1 .cse2 .cse3 .cse4))) [2020-11-06 22:26:18,055 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:26:18,055 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR3~0 ~s~0) (<= ~s~0 ~DC~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~DC~0 ~s~0) (not (= ~pended~0 1))) [2020-11-06 22:26:18,055 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:26:18,055 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:26:18,055 INFO L262 CegarLoopResult]: At program point KbFilter_DispatchPassThroughENTRY(lines 665 688) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,055 INFO L262 CegarLoopResult]: At program point L684(line 684) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (= ~SKIP1~0 ~s~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,055 INFO L266 CegarLoopResult]: For program point L684-1(line 684) no Hoare annotation was computed. [2020-11-06 22:26:18,056 INFO L266 CegarLoopResult]: For program point KbFilter_DispatchPassThroughFINAL(lines 665 688) no Hoare annotation was computed. [2020-11-06 22:26:18,056 INFO L262 CegarLoopResult]: At program point L678(line 678) the Hoare annotation is: (or (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (= ~compRegistered~0 0))) [2020-11-06 22:26:18,056 INFO L266 CegarLoopResult]: For program point L678-1(lines 674 680) no Hoare annotation was computed. [2020-11-06 22:26:18,056 INFO L266 CegarLoopResult]: For program point KbFilter_DispatchPassThroughEXIT(lines 665 688) no Hoare annotation was computed. [2020-11-06 22:26:18,056 INFO L266 CegarLoopResult]: For program point L674(lines 674 680) no Hoare annotation was computed. [2020-11-06 22:26:18,056 INFO L266 CegarLoopResult]: For program point L258-1(lines 254 260) no Hoare annotation was computed. [2020-11-06 22:26:18,056 INFO L266 CegarLoopResult]: For program point L159(lines 159 274) no Hoare annotation was computed. [2020-11-06 22:26:18,056 INFO L266 CegarLoopResult]: For program point L126(lines 126 285) no Hoare annotation was computed. [2020-11-06 22:26:18,056 INFO L262 CegarLoopResult]: At program point L184(line 184) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,057 INFO L262 CegarLoopResult]: At program point L201(lines 201 203) the Hoare annotation is: (let ((.cse12 (= ~NP~0 1)) (.cse11 (<= 4 ~SKIP2~0)) (.cse1 (= ~pended~0 1)) (.cse10 (= ~compRegistered~0 1)) (.cse13 (<= 5 ~MPR1~0)) (.cse14 (<= 7 ~IPC~0)) (.cse16 (= 2 ~DC~0)) (.cse15 (<= 6 ~MPR3~0))) (let ((.cse0 (not .cse15)) (.cse2 (not .cse16)) (.cse3 (not .cse14)) (.cse4 (and .cse12 .cse14 .cse11 (= ~s~0 ~NP~0) .cse15 (= ~s~0 |old(~s~0)|) .cse16 (not .cse1) .cse10 .cse13)) (.cse5 (not .cse13)) (.cse6 (not (= |old(~s~0)| 1))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (not .cse12)) (.cse9 (not .cse11))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and (= ~MPR3~0 ~s~0) (<= 259 KbFilter_PnP_~status~0) (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259) .cse10)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0))))) [2020-11-06 22:26:18,057 INFO L266 CegarLoopResult]: For program point L168(lines 168 271) no Hoare annotation was computed. [2020-11-06 22:26:18,057 INFO L266 CegarLoopResult]: For program point L201-1(lines 201 203) no Hoare annotation was computed. [2020-11-06 22:26:18,057 INFO L266 CegarLoopResult]: For program point L135(lines 135 282) no Hoare annotation was computed. [2020-11-06 22:26:18,057 INFO L262 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (and (= ~s~0 ~NP~0) (= ~compRegistered~0 1))) [2020-11-06 22:26:18,057 INFO L262 CegarLoopResult]: At program point L243(line 243) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,058 INFO L266 CegarLoopResult]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2020-11-06 22:26:18,058 INFO L266 CegarLoopResult]: For program point L177(lines 177 189) no Hoare annotation was computed. [2020-11-06 22:26:18,058 INFO L266 CegarLoopResult]: For program point L144(lines 144 279) no Hoare annotation was computed. [2020-11-06 22:26:18,058 INFO L266 CegarLoopResult]: For program point L111(lines 111 290) no Hoare annotation was computed. [2020-11-06 22:26:18,058 INFO L262 CegarLoopResult]: At program point L227(line 227) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,058 INFO L262 CegarLoopResult]: At program point L194(lines 194 195) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= KbFilter_PnP_~status~0 0) (= ~s~0 1) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~compRegistered~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,058 INFO L266 CegarLoopResult]: For program point L227-1(lines 223 229) no Hoare annotation was computed. [2020-11-06 22:26:18,058 INFO L266 CegarLoopResult]: For program point L194-1(lines 194 195) no Hoare annotation was computed. [2020-11-06 22:26:18,058 INFO L266 CegarLoopResult]: For program point L153(lines 153 276) no Hoare annotation was computed. [2020-11-06 22:26:18,059 INFO L266 CegarLoopResult]: For program point L120(lines 120 287) no Hoare annotation was computed. [2020-11-06 22:26:18,059 INFO L266 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 81 294) no Hoare annotation was computed. [2020-11-06 22:26:18,059 INFO L262 CegarLoopResult]: At program point L112(lines 111 290) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,059 INFO L262 CegarLoopResult]: At program point L269(lines 172 270) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (<= ~compRegistered~0 0) (not (<= 5 ~MPR1~0)) (not (= |old(~s~0)| 1)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 1)) (= ~compRegistered~0 1) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,059 INFO L266 CegarLoopResult]: For program point L162(lines 162 273) no Hoare annotation was computed. [2020-11-06 22:26:18,059 INFO L266 CegarLoopResult]: For program point L129(lines 129 284) no Hoare annotation was computed. [2020-11-06 22:26:18,059 INFO L262 CegarLoopResult]: At program point L179(line 179) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,060 INFO L262 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 81 294) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,060 INFO L262 CegarLoopResult]: At program point L171(lines 117 288) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,060 INFO L266 CegarLoopResult]: For program point L138(lines 138 281) no Hoare annotation was computed. [2020-11-06 22:26:18,060 INFO L266 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 81 294) no Hoare annotation was computed. [2020-11-06 22:26:18,060 INFO L266 CegarLoopResult]: For program point L147(lines 147 278) no Hoare annotation was computed. [2020-11-06 22:26:18,060 INFO L266 CegarLoopResult]: For program point L114(lines 114 289) no Hoare annotation was computed. [2020-11-06 22:26:18,060 INFO L266 CegarLoopResult]: For program point L156(lines 156 275) no Hoare annotation was computed. [2020-11-06 22:26:18,060 INFO L266 CegarLoopResult]: For program point L123(lines 123 286) no Hoare annotation was computed. [2020-11-06 22:26:18,061 INFO L262 CegarLoopResult]: At program point L115(lines 114 289) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,061 INFO L266 CegarLoopResult]: For program point L239(lines 239 245) no Hoare annotation was computed. [2020-11-06 22:26:18,061 INFO L262 CegarLoopResult]: At program point L264(lines 264 265) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,061 INFO L266 CegarLoopResult]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2020-11-06 22:26:18,061 INFO L266 CegarLoopResult]: For program point L165(lines 165 272) no Hoare annotation was computed. [2020-11-06 22:26:18,061 INFO L266 CegarLoopResult]: For program point L132(lines 132 283) no Hoare annotation was computed. [2020-11-06 22:26:18,061 INFO L266 CegarLoopResult]: For program point L223(lines 223 229) no Hoare annotation was computed. [2020-11-06 22:26:18,061 INFO L266 CegarLoopResult]: For program point L182(lines 182 188) no Hoare annotation was computed. [2020-11-06 22:26:18,061 INFO L266 CegarLoopResult]: For program point L182-1(lines 177 189) no Hoare annotation was computed. [2020-11-06 22:26:18,061 INFO L266 CegarLoopResult]: For program point L207(lines 207 213) no Hoare annotation was computed. [2020-11-06 22:26:18,062 INFO L266 CegarLoopResult]: For program point L141(lines 141 280) no Hoare annotation was computed. [2020-11-06 22:26:18,062 INFO L266 CegarLoopResult]: For program point L108(lines 108 291) no Hoare annotation was computed. [2020-11-06 22:26:18,062 INFO L266 CegarLoopResult]: For program point L199(lines 199 205) no Hoare annotation was computed. [2020-11-06 22:26:18,062 INFO L266 CegarLoopResult]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2020-11-06 22:26:18,062 INFO L262 CegarLoopResult]: At program point L249(line 249) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,062 INFO L266 CegarLoopResult]: For program point L249-1(line 249) no Hoare annotation was computed. [2020-11-06 22:26:18,062 INFO L266 CegarLoopResult]: For program point L150(lines 150 277) no Hoare annotation was computed. [2020-11-06 22:26:18,062 INFO L266 CegarLoopResult]: For program point L117(lines 117 288) no Hoare annotation was computed. [2020-11-06 22:26:18,062 INFO L266 CegarLoopResult]: For program point L208(lines 208 212) no Hoare annotation was computed. [2020-11-06 22:26:18,063 INFO L262 CegarLoopResult]: At program point L109(lines 108 291) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (and (= KbFilter_PnP_~status~0 0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,063 INFO L262 CegarLoopResult]: At program point L233(lines 233 234) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,063 INFO L266 CegarLoopResult]: For program point L233-1(lines 233 234) no Hoare annotation was computed. [2020-11-06 22:26:18,063 INFO L262 CegarLoopResult]: At program point L258(line 258) the Hoare annotation is: (or (not (<= 6 ~MPR3~0)) (= ~pended~0 1) (not (= 2 ~DC~0)) (not (<= 7 ~IPC~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0))) [2020-11-06 22:26:18,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:26:18 BoogieIcfgContainer [2020-11-06 22:26:18,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:26:18,126 INFO L168 Benchmark]: Toolchain (without parser) took 45456.19 ms. Allocated memory was 151.0 MB in the beginning and 433.1 MB in the end (delta: 282.1 MB). Free memory was 126.2 MB in the beginning and 305.2 MB in the end (delta: -179.1 MB). Peak memory consumption was 256.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:26:18,127 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory was 124.2 MB in the beginning and 124.1 MB in the end (delta: 99.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:26:18,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.32 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 107.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:26:18,128 INFO L168 Benchmark]: Boogie Preprocessor took 111.57 ms. Allocated memory is still 151.0 MB. Free memory was 107.0 MB in the beginning and 103.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:26:18,128 INFO L168 Benchmark]: RCFGBuilder took 1193.29 ms. Allocated memory is still 151.0 MB. Free memory was 103.9 MB in the beginning and 93.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 34.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:26:18,128 INFO L168 Benchmark]: TraceAbstraction took 43526.95 ms. Allocated memory was 151.0 MB in the beginning and 433.1 MB in the end (delta: 282.1 MB). Free memory was 92.9 MB in the beginning and 305.2 MB in the end (delta: -212.4 MB). Peak memory consumption was 223.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:26:18,131 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.18 ms. Allocated memory is still 151.0 MB. Free memory was 124.2 MB in the beginning and 124.1 MB in the end (delta: 99.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 606.32 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 107.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 111.57 ms. Allocated memory is still 151.0 MB. Free memory was 107.0 MB in the beginning and 103.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1193.29 ms. Allocated memory is still 151.0 MB. Free memory was 103.9 MB in the beginning and 93.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 34.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 43526.95 ms. Allocated memory was 151.0 MB in the beginning and 433.1 MB in the end (delta: 282.1 MB). Free memory was 92.9 MB in the beginning and 305.2 MB in the end (delta: -212.4 MB). Peak memory consumption was 223.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((((7 <= IPC && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(pended == 1)) - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(NP == \old(s))) || !(NP == 1)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) && ((((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || s == NP) || !(5 <= MPR1)) || !(\old(s) == 1)) || !(NP == 1)) || !(4 <= SKIP2)) && ((((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(\old(setEventCalled) == 1)) || s == NP) || !(5 <= MPR1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((((7 <= IPC && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(pended == 1)) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(s) <= \old(DC))) || ((((7 <= IPC && 4 <= SKIP2) && 2 == DC) && !(pended == 1)) && (compRegistered <= 0 || compRegistered == 1))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || status == 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || compRegistered <= 0) || !(5 <= MPR1)) || !(\old(s) == 1)) || !(\old(compRegistered) == 0)) || !(NP == 1)) || compRegistered == 1) || !(4 <= SKIP2) - InvariantResult [Line: 776]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((((7 <= IPC && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(pended == 1)) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0) - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || s == NP) || !(5 <= MPR1)) || !(\old(s) == 1)) || !(NP == 1)) || !(4 <= SKIP2)) && ((((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(\old(setEventCalled) == 1)) || s == NP) || !(5 <= MPR1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((!(6 <= MPR3) || (((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus))) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP == 1)) || !(4 <= SKIP2) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((!(6 <= MPR3) || (((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus))) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP == 1)) || !(4 <= SKIP2) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || (((((((((NP == 1 && 7 <= IPC) && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && 6 <= MPR3) && 2 == DC) && !(pended == 1)) && 5 <= MPR1) - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((!(6 <= MPR3) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || ((((((status == 0 && lowerDriverReturn == \old(lowerDriverReturn)) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus))) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP == 1)) || !(4 <= SKIP2) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || ((((7 <= IPC && 4 <= SKIP2) && 2 == DC) && !(pended == 1)) && (compRegistered <= 0 || compRegistered == 1))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || ((MPR1 == s && returnVal2 + 1073741823 <= 0) && __cil_tmp7 + 1073741802 == 0)) || ((((MPR1 == s && setEventCalled == 1) && returnVal2 <= 259) && 259 <= returnVal2) && __cil_tmp7 + 1073741802 == 0)) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(\old(s) == 1)) || (((returnVal2 <= 0 && MPR1 == s) && 0 <= returnVal2) && __cil_tmp7 + 1073741802 == 0)) || !(NP == 1)) || !(4 <= SKIP2)) && ((((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(\old(s) == 1)) || !(NP == 1)) || ((setEventCalled == \old(setEventCalled) && s == NP) && \old(customIrp) == customIrp)) || !(4 <= SKIP2)) && (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(\old(setEventCalled) == 1)) || !(5 <= MPR1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(s) <= \old(DC))) || ((((7 <= IPC && 4 <= SKIP2) && 2 == DC) && !(pended == 1)) && (compRegistered <= 0 || compRegistered == 1))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(NP == \old(s))) || !(NP == 1)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) && ((((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((!(6 <= MPR3) || (((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus))) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP == 1)) || !(4 <= SKIP2) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || ((((((7 <= IPC && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && 2 == DC) && !(pended == 1)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: (((((((((!(6 <= MPR3) || !(compRegistered == 1)) || pended == 1) || !(2 == DC)) || !(7 <= IPC)) || !(5 <= MPR1)) || !(NP == \old(s))) || !(NP == 1)) || !(4 <= SKIP2)) || ((MPR1 == s && setEventCalled == 1) && __cil_tmp7 + 1073741802 == 0)) && ((((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == NP) && myStatus == \old(myStatus))) || !(NP == \old(s))) || !(4 <= SKIP2)) || !(compRegistered == 0) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((!(\old(DC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(s) <= \old(DC))) || ((((7 <= IPC && 4 <= SKIP2) && 2 == DC) && !(pended == 1)) && (compRegistered <= 0 || compRegistered == 1))) || \old(pended) == 1) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: (((((pended == 1 || !(2 == DC)) || !(7 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 243 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28.6s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3178 SDtfs, 4912 SDslu, 3732 SDs, 0 SdLazy, 6978 SolverSat, 1206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 176 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 85 LocationsWithAnnotation, 401 PreInvPairs, 505 NumberOfFragments, 4184 HoareAnnotationTreeSize, 401 FomulaSimplifications, 1748 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 85 FomulaSimplificationsInter, 10274 FormulaSimplificationTreeSizeReductionInter, 13.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1127 NumberOfCodeBlocks, 1127 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1106 ConstructedInterpolants, 0 QuantifiedInterpolants, 307787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...