java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:42:25,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:42:25,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:42:25,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:42:25,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:42:25,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:42:25,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:42:25,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:42:25,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:42:25,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:42:25,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:42:25,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:42:25,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:42:25,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:42:25,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:42:25,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:42:25,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:42:25,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:42:25,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:42:25,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:42:25,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:42:25,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:42:25,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:42:25,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:42:25,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:42:25,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:42:25,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:42:25,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:42:25,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:42:25,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:42:25,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:42:25,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:42:25,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:42:25,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:42:25,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:42:25,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:42:25,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:42:25,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:42:25,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:42:25,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:42:25,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:42:25,151 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 [2019-10-02 11:42:25,165 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:42:25,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:42:25,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:42:25,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:42:25,167 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:42:25,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:42:25,167 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:42:25,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:42:25,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:42:25,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:42:25,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:42:25,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:42:25,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:42:25,168 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:42:25,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:42:25,169 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:42:25,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:42:25,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:42:25,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:42:25,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:42:25,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:42:25,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:42:25,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:42:25,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:42:25,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:42:25,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:42:25,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:42:25,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:42:25,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:42:25,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:42:25,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:42:25,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:42:25,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:42:25,220 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:42:25,221 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-10-02 11:42:25,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a323cbce8/ad9de34f793348f3bec2399edec60a2b/FLAGd8915e752 [2019-10-02 11:42:25,775 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:42:25,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-10-02 11:42:25,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a323cbce8/ad9de34f793348f3bec2399edec60a2b/FLAGd8915e752 [2019-10-02 11:42:26,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a323cbce8/ad9de34f793348f3bec2399edec60a2b [2019-10-02 11:42:26,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:42:26,119 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:42:26,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:42:26,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:42:26,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:42:26,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:42:26" (1/1) ... [2019-10-02 11:42:26,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d46bbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:26, skipping insertion in model container [2019-10-02 11:42:26,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:42:26" (1/1) ... [2019-10-02 11:42:26,134 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:42:26,198 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:42:26,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:42:26,597 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:42:26,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:42:26,703 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:42:26,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:26 WrapperNode [2019-10-02 11:42:26,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:42:26,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:42:26,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:42:26,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:42:26,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:26" (1/1) ... [2019-10-02 11:42:26,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:26" (1/1) ... [2019-10-02 11:42:26,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:26" (1/1) ... [2019-10-02 11:42:26,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:26" (1/1) ... [2019-10-02 11:42:26,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:26" (1/1) ... [2019-10-02 11:42:26,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:26" (1/1) ... [2019-10-02 11:42:26,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:26" (1/1) ... [2019-10-02 11:42:26,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:42:26,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:42:26,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:42:26,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:42:26,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:26" (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 [2019-10-02 11:42:26,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:42:26,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:42:26,852 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-02 11:42:26,852 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-02 11:42:26,853 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-10-02 11:42:26,853 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:42:26,853 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-02 11:42:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-02 11:42:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-02 11:42:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-02 11:42:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-02 11:42:26,856 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-10-02 11:42:26,856 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-10-02 11:42:26,856 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-10-02 11:42:26,857 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-10-02 11:42:26,857 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-02 11:42:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-10-02 11:42:26,860 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-02 11:42:26,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:42:26,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 11:42:26,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:42:26,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 11:42:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 11:42:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-10-02 11:42:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-02 11:42:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-02 11:42:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-02 11:42:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-10-02 11:42:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-10-02 11:42:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-10-02 11:42:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-10-02 11:42:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-02 11:42:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-10-02 11:42:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-02 11:42:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-02 11:42:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-02 11:42:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-02 11:42:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:42:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-02 11:42:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:42:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:42:27,173 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:27,248 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-02 11:42:27,248 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-02 11:42:27,282 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:27,429 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-02 11:42:27,429 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-02 11:42:27,432 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:27,484 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-02 11:42:27,484 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-02 11:42:27,503 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:27,549 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-02 11:42:27,549 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-02 11:42:27,633 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:27,650 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-02 11:42:27,650 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-02 11:42:27,670 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:27,772 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-10-02 11:42:27,773 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-10-02 11:42:27,781 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:42:27,781 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 11:42:27,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:42:27 BoogieIcfgContainer [2019-10-02 11:42:27,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:42:27,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:42:27,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:42:27,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:42:27,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:42:26" (1/3) ... [2019-10-02 11:42:27,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67364ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:42:27, skipping insertion in model container [2019-10-02 11:42:27,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:26" (2/3) ... [2019-10-02 11:42:27,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67364ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:42:27, skipping insertion in model container [2019-10-02 11:42:27,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:42:27" (3/3) ... [2019-10-02 11:42:27,791 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2019-10-02 11:42:27,801 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:42:27,810 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:42:27,827 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:42:27,861 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:42:27,861 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:42:27,862 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:42:27,862 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:42:27,862 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:42:27,862 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:42:27,862 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:42:27,863 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:42:27,863 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:42:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states. [2019-10-02 11:42:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:42:27,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:27,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:27,899 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1129426977, now seen corresponding path program 1 times [2019-10-02 11:42:27,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:27,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:27,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:27,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:28,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:28,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:28,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:28,191 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 3 states. [2019-10-02 11:42:28,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:28,378 INFO L93 Difference]: Finished difference Result 390 states and 586 transitions. [2019-10-02 11:42:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:28,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:42:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:28,409 INFO L225 Difference]: With dead ends: 390 [2019-10-02 11:42:28,410 INFO L226 Difference]: Without dead ends: 231 [2019-10-02 11:42:28,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-02 11:42:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-10-02 11:42:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-02 11:42:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2019-10-02 11:42:28,553 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 20 [2019-10-02 11:42:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:28,553 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2019-10-02 11:42:28,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2019-10-02 11:42:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:42:28,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:28,556 INFO L411 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] [2019-10-02 11:42:28,558 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1811427322, now seen corresponding path program 1 times [2019-10-02 11:42:28,560 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:28,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:28,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:28,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:28,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:28,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:28,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:28,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:28,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:28,818 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 3 states. [2019-10-02 11:42:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:29,024 INFO L93 Difference]: Finished difference Result 375 states and 514 transitions. [2019-10-02 11:42:29,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:29,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-02 11:42:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:29,028 INFO L225 Difference]: With dead ends: 375 [2019-10-02 11:42:29,029 INFO L226 Difference]: Without dead ends: 314 [2019-10-02 11:42:29,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-02 11:42:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 298. [2019-10-02 11:42:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-02 11:42:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 408 transitions. [2019-10-02 11:42:29,060 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 408 transitions. Word has length 28 [2019-10-02 11:42:29,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:29,060 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 408 transitions. [2019-10-02 11:42:29,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 408 transitions. [2019-10-02 11:42:29,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:42:29,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:29,062 INFO L411 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] [2019-10-02 11:42:29,063 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:29,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:29,063 INFO L82 PathProgramCache]: Analyzing trace with hash 439620198, now seen corresponding path program 1 times [2019-10-02 11:42:29,063 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:29,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:29,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:29,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:29,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:29,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:29,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:29,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:29,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:29,125 INFO L87 Difference]: Start difference. First operand 298 states and 408 transitions. Second operand 3 states. [2019-10-02 11:42:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:29,160 INFO L93 Difference]: Finished difference Result 481 states and 640 transitions. [2019-10-02 11:42:29,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:29,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-02 11:42:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:29,164 INFO L225 Difference]: With dead ends: 481 [2019-10-02 11:42:29,164 INFO L226 Difference]: Without dead ends: 362 [2019-10-02 11:42:29,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-02 11:42:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 338. [2019-10-02 11:42:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-10-02 11:42:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 459 transitions. [2019-10-02 11:42:29,191 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 459 transitions. Word has length 28 [2019-10-02 11:42:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:29,191 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 459 transitions. [2019-10-02 11:42:29,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 459 transitions. [2019-10-02 11:42:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:42:29,194 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:29,194 INFO L411 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] [2019-10-02 11:42:29,194 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:29,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1607848921, now seen corresponding path program 1 times [2019-10-02 11:42:29,195 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:29,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:29,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:29,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:29,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:29,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:29,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:29,267 INFO L87 Difference]: Start difference. First operand 338 states and 459 transitions. Second operand 3 states. [2019-10-02 11:42:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:29,359 INFO L93 Difference]: Finished difference Result 341 states and 461 transitions. [2019-10-02 11:42:29,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:29,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-02 11:42:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:29,364 INFO L225 Difference]: With dead ends: 341 [2019-10-02 11:42:29,364 INFO L226 Difference]: Without dead ends: 337 [2019-10-02 11:42:29,365 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-10-02 11:42:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2019-10-02 11:42:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-02 11:42:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 456 transitions. [2019-10-02 11:42:29,388 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 456 transitions. Word has length 38 [2019-10-02 11:42:29,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:29,389 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 456 transitions. [2019-10-02 11:42:29,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 456 transitions. [2019-10-02 11:42:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:42:29,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:29,393 INFO L411 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] [2019-10-02 11:42:29,393 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:29,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1742109340, now seen corresponding path program 1 times [2019-10-02 11:42:29,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:29,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:29,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:29,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:29,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:29,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:42:29,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:42:29,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:42:29,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:42:29,460 INFO L87 Difference]: Start difference. First operand 337 states and 456 transitions. Second operand 4 states. [2019-10-02 11:42:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:29,606 INFO L93 Difference]: Finished difference Result 388 states and 513 transitions. [2019-10-02 11:42:29,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:42:29,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-02 11:42:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:29,609 INFO L225 Difference]: With dead ends: 388 [2019-10-02 11:42:29,609 INFO L226 Difference]: Without dead ends: 319 [2019-10-02 11:42:29,610 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:42:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-10-02 11:42:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 298. [2019-10-02 11:42:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-02 11:42:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 399 transitions. [2019-10-02 11:42:29,628 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 399 transitions. Word has length 46 [2019-10-02 11:42:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:29,628 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 399 transitions. [2019-10-02 11:42:29,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:42:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 399 transitions. [2019-10-02 11:42:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 11:42:29,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:29,631 INFO L411 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] [2019-10-02 11:42:29,631 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:29,632 INFO L82 PathProgramCache]: Analyzing trace with hash 750041855, now seen corresponding path program 1 times [2019-10-02 11:42:29,632 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:29,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:29,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:29,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:29,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:29,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:29,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:29,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:29,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:29,685 INFO L87 Difference]: Start difference. First operand 298 states and 399 transitions. Second operand 3 states. [2019-10-02 11:42:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:29,713 INFO L93 Difference]: Finished difference Result 310 states and 414 transitions. [2019-10-02 11:42:29,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:29,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-02 11:42:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:29,716 INFO L225 Difference]: With dead ends: 310 [2019-10-02 11:42:29,716 INFO L226 Difference]: Without dead ends: 294 [2019-10-02 11:42:29,717 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:29,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-02 11:42:29,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 264. [2019-10-02 11:42:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-02 11:42:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 357 transitions. [2019-10-02 11:42:29,732 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 357 transitions. Word has length 45 [2019-10-02 11:42:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:29,733 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 357 transitions. [2019-10-02 11:42:29,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 357 transitions. [2019-10-02 11:42:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:42:29,734 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:29,735 INFO L411 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] [2019-10-02 11:42:29,735 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:29,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:29,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1784783245, now seen corresponding path program 1 times [2019-10-02 11:42:29,735 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:29,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:29,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:29,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:29,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:29,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:29,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:29,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:29,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:29,799 INFO L87 Difference]: Start difference. First operand 264 states and 357 transitions. Second operand 3 states. [2019-10-02 11:42:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:29,869 INFO L93 Difference]: Finished difference Result 284 states and 378 transitions. [2019-10-02 11:42:29,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:29,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-02 11:42:29,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:29,872 INFO L225 Difference]: With dead ends: 284 [2019-10-02 11:42:29,872 INFO L226 Difference]: Without dead ends: 242 [2019-10-02 11:42:29,873 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-02 11:42:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-10-02 11:42:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-02 11:42:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2019-10-02 11:42:29,886 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 46 [2019-10-02 11:42:29,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:29,886 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2019-10-02 11:42:29,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2019-10-02 11:42:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 11:42:29,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:29,888 INFO L411 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] [2019-10-02 11:42:29,888 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:29,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:29,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1852297644, now seen corresponding path program 1 times [2019-10-02 11:42:29,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:29,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:29,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:29,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:29,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:29,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:29,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:29,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:29,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:29,941 INFO L87 Difference]: Start difference. First operand 242 states and 321 transitions. Second operand 3 states. [2019-10-02 11:42:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:29,997 INFO L93 Difference]: Finished difference Result 270 states and 354 transitions. [2019-10-02 11:42:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:29,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-02 11:42:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:30,000 INFO L225 Difference]: With dead ends: 270 [2019-10-02 11:42:30,000 INFO L226 Difference]: Without dead ends: 240 [2019-10-02 11:42:30,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-02 11:42:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-10-02 11:42:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-02 11:42:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2019-10-02 11:42:30,013 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 53 [2019-10-02 11:42:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:30,014 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2019-10-02 11:42:30,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2019-10-02 11:42:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 11:42:30,015 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:30,015 INFO L411 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] [2019-10-02 11:42:30,016 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:30,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1745163498, now seen corresponding path program 1 times [2019-10-02 11:42:30,016 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:30,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:30,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:30,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:30,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:30,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:30,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:42:30,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:42:30,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:42:30,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:30,087 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand 8 states. [2019-10-02 11:42:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:30,212 INFO L93 Difference]: Finished difference Result 252 states and 329 transitions. [2019-10-02 11:42:30,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:42:30,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-02 11:42:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:30,215 INFO L225 Difference]: With dead ends: 252 [2019-10-02 11:42:30,215 INFO L226 Difference]: Without dead ends: 211 [2019-10-02 11:42:30,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-02 11:42:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-10-02 11:42:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-02 11:42:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 277 transitions. [2019-10-02 11:42:30,243 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 277 transitions. Word has length 51 [2019-10-02 11:42:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:30,243 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 277 transitions. [2019-10-02 11:42:30,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:42:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 277 transitions. [2019-10-02 11:42:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:42:30,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:30,245 INFO L411 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] [2019-10-02 11:42:30,246 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:30,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:30,246 INFO L82 PathProgramCache]: Analyzing trace with hash 143486070, now seen corresponding path program 1 times [2019-10-02 11:42:30,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:30,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:30,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:30,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:30,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:30,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:30,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:30,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:30,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:30,371 INFO L87 Difference]: Start difference. First operand 211 states and 277 transitions. Second operand 9 states. [2019-10-02 11:42:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:30,545 INFO L93 Difference]: Finished difference Result 227 states and 293 transitions. [2019-10-02 11:42:30,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:30,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-10-02 11:42:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:30,547 INFO L225 Difference]: With dead ends: 227 [2019-10-02 11:42:30,548 INFO L226 Difference]: Without dead ends: 206 [2019-10-02 11:42:30,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-02 11:42:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-10-02 11:42:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-02 11:42:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 270 transitions. [2019-10-02 11:42:30,560 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 270 transitions. Word has length 52 [2019-10-02 11:42:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:30,560 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 270 transitions. [2019-10-02 11:42:30,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2019-10-02 11:42:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 11:42:30,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:30,562 INFO L411 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] [2019-10-02 11:42:30,562 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1278878233, now seen corresponding path program 1 times [2019-10-02 11:42:30,563 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:30,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:30,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:30,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:30,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:30,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:30,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:30,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:30,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:30,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:30,602 INFO L87 Difference]: Start difference. First operand 206 states and 270 transitions. Second operand 3 states. [2019-10-02 11:42:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:30,618 INFO L93 Difference]: Finished difference Result 246 states and 315 transitions. [2019-10-02 11:42:30,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:30,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 11:42:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:30,621 INFO L225 Difference]: With dead ends: 246 [2019-10-02 11:42:30,621 INFO L226 Difference]: Without dead ends: 205 [2019-10-02 11:42:30,622 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-02 11:42:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-10-02 11:42:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-02 11:42:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 265 transitions. [2019-10-02 11:42:30,633 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 265 transitions. Word has length 58 [2019-10-02 11:42:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:30,633 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-10-02 11:42:30,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 265 transitions. [2019-10-02 11:42:30,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 11:42:30,635 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:30,635 INFO L411 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] [2019-10-02 11:42:30,635 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:30,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:30,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1933570889, now seen corresponding path program 1 times [2019-10-02 11:42:30,636 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:30,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:30,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:30,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:30,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:30,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:30,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:42:30,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:42:30,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:42:30,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:42:30,723 INFO L87 Difference]: Start difference. First operand 205 states and 265 transitions. Second operand 10 states. [2019-10-02 11:42:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:30,879 INFO L93 Difference]: Finished difference Result 217 states and 277 transitions. [2019-10-02 11:42:30,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:42:30,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-02 11:42:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:30,881 INFO L225 Difference]: With dead ends: 217 [2019-10-02 11:42:30,882 INFO L226 Difference]: Without dead ends: 203 [2019-10-02 11:42:30,882 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-02 11:42:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-10-02 11:42:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-02 11:42:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 261 transitions. [2019-10-02 11:42:30,893 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 261 transitions. Word has length 54 [2019-10-02 11:42:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:30,893 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 261 transitions. [2019-10-02 11:42:30,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:42:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 261 transitions. [2019-10-02 11:42:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 11:42:30,895 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:30,895 INFO L411 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] [2019-10-02 11:42:30,895 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:30,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:30,895 INFO L82 PathProgramCache]: Analyzing trace with hash -309007876, now seen corresponding path program 1 times [2019-10-02 11:42:30,896 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:30,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:30,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:30,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:30,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:30,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:42:30,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:42:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:42:30,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:30,960 INFO L87 Difference]: Start difference. First operand 203 states and 261 transitions. Second operand 8 states. [2019-10-02 11:42:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:31,255 INFO L93 Difference]: Finished difference Result 351 states and 434 transitions. [2019-10-02 11:42:31,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:42:31,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-02 11:42:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:31,258 INFO L225 Difference]: With dead ends: 351 [2019-10-02 11:42:31,258 INFO L226 Difference]: Without dead ends: 279 [2019-10-02 11:42:31,259 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:42:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-02 11:42:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 213. [2019-10-02 11:42:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-02 11:42:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 275 transitions. [2019-10-02 11:42:31,273 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 275 transitions. Word has length 53 [2019-10-02 11:42:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:31,274 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 275 transitions. [2019-10-02 11:42:31,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:42:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 275 transitions. [2019-10-02 11:42:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 11:42:31,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:31,276 INFO L411 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] [2019-10-02 11:42:31,276 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:31,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:31,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1433722057, now seen corresponding path program 1 times [2019-10-02 11:42:31,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:31,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:31,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:31,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:31,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:31,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:31,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:31,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:31,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:31,354 INFO L87 Difference]: Start difference. First operand 213 states and 275 transitions. Second operand 9 states. [2019-10-02 11:42:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:31,495 INFO L93 Difference]: Finished difference Result 229 states and 291 transitions. [2019-10-02 11:42:31,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:31,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-10-02 11:42:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:31,497 INFO L225 Difference]: With dead ends: 229 [2019-10-02 11:42:31,497 INFO L226 Difference]: Without dead ends: 191 [2019-10-02 11:42:31,498 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-02 11:42:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-10-02 11:42:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-02 11:42:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2019-10-02 11:42:31,508 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 53 [2019-10-02 11:42:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:31,508 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2019-10-02 11:42:31,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2019-10-02 11:42:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 11:42:31,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:31,509 INFO L411 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] [2019-10-02 11:42:31,510 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:31,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1317699651, now seen corresponding path program 1 times [2019-10-02 11:42:31,510 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:31,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:31,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:31,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:31,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:31,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:31,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:42:31,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:42:31,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:42:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:42:31,628 INFO L87 Difference]: Start difference. First operand 191 states and 232 transitions. Second operand 10 states. [2019-10-02 11:42:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:32,358 INFO L93 Difference]: Finished difference Result 277 states and 325 transitions. [2019-10-02 11:42:32,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:42:32,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-02 11:42:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:32,360 INFO L225 Difference]: With dead ends: 277 [2019-10-02 11:42:32,360 INFO L226 Difference]: Without dead ends: 271 [2019-10-02 11:42:32,361 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:42:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-02 11:42:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 218. [2019-10-02 11:42:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-10-02 11:42:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 261 transitions. [2019-10-02 11:42:32,376 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 261 transitions. Word has length 54 [2019-10-02 11:42:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:32,376 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 261 transitions. [2019-10-02 11:42:32,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:42:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 261 transitions. [2019-10-02 11:42:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 11:42:32,377 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:32,378 INFO L411 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] [2019-10-02 11:42:32,378 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:32,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1204113239, now seen corresponding path program 1 times [2019-10-02 11:42:32,378 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:32,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:32,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:32,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:32,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:32,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:32,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:32,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:32,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:32,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:32,428 INFO L87 Difference]: Start difference. First operand 218 states and 261 transitions. Second operand 6 states. [2019-10-02 11:42:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:32,480 INFO L93 Difference]: Finished difference Result 262 states and 313 transitions. [2019-10-02 11:42:32,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:32,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-02 11:42:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:32,482 INFO L225 Difference]: With dead ends: 262 [2019-10-02 11:42:32,483 INFO L226 Difference]: Without dead ends: 226 [2019-10-02 11:42:32,483 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-02 11:42:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2019-10-02 11:42:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-02 11:42:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2019-10-02 11:42:32,497 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 57 [2019-10-02 11:42:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:32,497 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2019-10-02 11:42:32,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2019-10-02 11:42:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 11:42:32,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:32,499 INFO L411 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] [2019-10-02 11:42:32,499 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:32,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:32,500 INFO L82 PathProgramCache]: Analyzing trace with hash -527681510, now seen corresponding path program 1 times [2019-10-02 11:42:32,500 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:32,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:32,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:32,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:32,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:32,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:32,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:32,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:32,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:32,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:32,559 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand 6 states. [2019-10-02 11:42:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:32,616 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2019-10-02 11:42:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:32,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-02 11:42:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:32,618 INFO L225 Difference]: With dead ends: 231 [2019-10-02 11:42:32,618 INFO L226 Difference]: Without dead ends: 224 [2019-10-02 11:42:32,619 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-02 11:42:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-10-02 11:42:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-02 11:42:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 263 transitions. [2019-10-02 11:42:32,632 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 263 transitions. Word has length 57 [2019-10-02 11:42:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:32,632 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 263 transitions. [2019-10-02 11:42:32,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 263 transitions. [2019-10-02 11:42:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 11:42:32,634 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:32,634 INFO L411 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] [2019-10-02 11:42:32,634 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1222442102, now seen corresponding path program 1 times [2019-10-02 11:42:32,635 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:32,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:32,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:32,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:32,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:32,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:32,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:32,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:32,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:32,713 INFO L87 Difference]: Start difference. First operand 221 states and 263 transitions. Second operand 9 states. [2019-10-02 11:42:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:33,225 INFO L93 Difference]: Finished difference Result 267 states and 309 transitions. [2019-10-02 11:42:33,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:42:33,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-02 11:42:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:33,228 INFO L225 Difference]: With dead ends: 267 [2019-10-02 11:42:33,228 INFO L226 Difference]: Without dead ends: 233 [2019-10-02 11:42:33,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:42:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-02 11:42:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 194. [2019-10-02 11:42:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-02 11:42:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 232 transitions. [2019-10-02 11:42:33,245 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 232 transitions. Word has length 55 [2019-10-02 11:42:33,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:33,246 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 232 transitions. [2019-10-02 11:42:33,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:33,246 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 232 transitions. [2019-10-02 11:42:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 11:42:33,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:33,248 INFO L411 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] [2019-10-02 11:42:33,248 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:33,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:33,249 INFO L82 PathProgramCache]: Analyzing trace with hash -639520605, now seen corresponding path program 1 times [2019-10-02 11:42:33,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:33,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:33,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:33,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:33,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:33,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:33,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:33,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:33,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:33,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:33,344 INFO L87 Difference]: Start difference. First operand 194 states and 232 transitions. Second operand 5 states. [2019-10-02 11:42:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:33,366 INFO L93 Difference]: Finished difference Result 230 states and 273 transitions. [2019-10-02 11:42:33,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:33,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-02 11:42:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:33,369 INFO L225 Difference]: With dead ends: 230 [2019-10-02 11:42:33,369 INFO L226 Difference]: Without dead ends: 188 [2019-10-02 11:42:33,370 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-02 11:42:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-10-02 11:42:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-02 11:42:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 223 transitions. [2019-10-02 11:42:33,382 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 223 transitions. Word has length 58 [2019-10-02 11:42:33,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:33,383 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 223 transitions. [2019-10-02 11:42:33,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 223 transitions. [2019-10-02 11:42:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 11:42:33,384 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:33,384 INFO L411 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] [2019-10-02 11:42:33,384 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1656625880, now seen corresponding path program 1 times [2019-10-02 11:42:33,385 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:33,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:33,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:33,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:33,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 11:42:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 11:42:33,492 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-02 11:42:33,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:42:33 BoogieIcfgContainer [2019-10-02 11:42:33,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:42:33,637 INFO L168 Benchmark]: Toolchain (without parser) took 7518.23 ms. Allocated memory was 134.7 MB in the beginning and 344.5 MB in the end (delta: 209.7 MB). Free memory was 90.3 MB in the beginning and 254.6 MB in the end (delta: -164.2 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:33,639 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-02 11:42:33,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.43 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 90.1 MB in the beginning and 170.4 MB in the end (delta: -80.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:33,642 INFO L168 Benchmark]: Boogie Preprocessor took 94.46 ms. Allocated memory is still 201.3 MB. Free memory was 170.4 MB in the beginning and 167.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:33,642 INFO L168 Benchmark]: RCFGBuilder took 983.88 ms. Allocated memory is still 201.3 MB. Free memory was 167.0 MB in the beginning and 96.5 MB in the end (delta: 70.5 MB). Peak memory consumption was 70.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:33,645 INFO L168 Benchmark]: TraceAbstraction took 5850.83 ms. Allocated memory was 201.3 MB in the beginning and 344.5 MB in the end (delta: 143.1 MB). Free memory was 95.9 MB in the beginning and 254.6 MB in the end (delta: -158.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 11:42:33,651 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 583.43 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 90.1 MB in the beginning and 170.4 MB in the end (delta: -80.3 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.46 ms. Allocated memory is still 201.3 MB. Free memory was 170.4 MB in the beginning and 167.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 983.88 ms. Allocated memory is still 201.3 MB. Free memory was 167.0 MB in the beginning and 96.5 MB in the end (delta: 70.5 MB). Peak memory consumption was 70.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5850.83 ms. Allocated memory was 201.3 MB in the beginning and 344.5 MB in the end (delta: 143.1 MB). Free memory was 95.9 MB in the beginning and 254.6 MB in the end (delta: -158.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1012]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] int KernelMode ; [L23] int Executive ; [L24] int DevicePowerState ; [L25] int s ; [L26] int UNLOADED ; [L27] int NP ; [L28] int DC ; [L29] int SKIP1 ; [L30] int SKIP2 ; [L31] int MPR1 ; [L32] int MPR3 ; [L33] int IPC ; [L34] int pended ; [L35] int compFptr ; [L36] int compRegistered ; [L37] int lowerDriverReturn ; [L38] int setEventCalled ; [L39] int customIrp ; [L40] int myStatus ; VAL [\old(compFptr)=19, \old(compRegistered)=11, \old(customIrp)=14, \old(DC)=7, \old(DevicePowerState)=20, \old(Executive)=12, \old(IPC)=8, \old(KernelMode)=24, \old(lowerDriverReturn)=22, \old(MPR1)=18, \old(MPR3)=16, \old(myStatus)=21, \old(NP)=13, \old(pended)=23, \old(s)=9, \old(setEventCalled)=17, \old(SKIP1)=15, \old(SKIP2)=10, \old(UNLOADED)=6, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L293] int status ; [L294] int irp = __VERIFIER_nondet_int() ; [L295] int pirp ; [L296] int pirp__IoStatus__Status ; [L297] int irp_choice = __VERIFIER_nondet_int() ; [L298] int devobj = __VERIFIER_nondet_int() ; [L299] int __cil_tmp8 ; [L301] KernelMode = 0 [L302] Executive = 0 [L303] DevicePowerState = 1 [L304] s = 0 [L305] UNLOADED = 0 [L306] NP = 0 [L307] DC = 0 [L308] SKIP1 = 0 [L309] SKIP2 = 0 [L310] MPR1 = 0 [L311] MPR3 = 0 [L312] IPC = 0 [L313] pended = 0 [L314] compFptr = 0 [L315] compRegistered = 0 [L316] lowerDriverReturn = 0 [L317] setEventCalled = 0 [L318] customIrp = 0 [L319] myStatus = 0 [L323] status = 0 [L324] pirp = irp VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=1, devobj=0, Executive=0, IPC=0, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, status=0, UNLOADED=0] [L325] CALL _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=1, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L60] UNLOADED = 0 [L61] NP = 1 [L62] DC = 2 [L63] SKIP1 = 3 [L64] SKIP2 = 4 [L65] MPR1 = 5 [L66] MPR3 = 6 [L67] IPC = 7 [L68] s = UNLOADED [L69] pended = 0 [L70] compFptr = 0 [L71] compRegistered = 0 [L72] lowerDriverReturn = 0 [L73] setEventCalled = 0 [L74] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L325] RET _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L327] COND TRUE status >= 0 [L328] s = NP [L329] customIrp = 0 [L330] setEventCalled = customIrp [L331] lowerDriverReturn = setEventCalled [L332] compRegistered = lowerDriverReturn [L333] pended = compRegistered [L334] pirp__IoStatus__Status = 0 [L335] myStatus = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L336] COND FALSE !(irp_choice == 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L341] CALL stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L46] s = NP [L47] pended = 0 [L48] compFptr = 0 [L49] compRegistered = 0 [L50] lowerDriverReturn = 0 [L51] setEventCalled = 0 [L52] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L341] RET stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L344] COND FALSE !(status < 0) [L348] int tmp_ndt_1; [L349] tmp_ndt_1 = __VERIFIER_nondet_int() [L350] COND FALSE !(tmp_ndt_1 == 0) [L353] int tmp_ndt_2; [L354] tmp_ndt_2 = __VERIFIER_nondet_int() [L355] COND FALSE !(tmp_ndt_2 == 1) [L358] int tmp_ndt_3; [L359] tmp_ndt_3 = __VERIFIER_nondet_int() [L360] COND TRUE tmp_ndt_3 == 3 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L387] CALL, EXPR KbFilter_PnP(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L79] int devExt ; [L80] int irpStack ; [L81] int status ; [L82] int event = __VERIFIER_nondet_int() ; [L83] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L84] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L85] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L86] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L87] int devExt__Started ; [L88] int devExt__Removed ; [L89] int devExt__SurpriseRemoved ; [L90] int Irp__IoStatus__Status ; [L91] int Irp__IoStatus__Information ; [L92] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L93] int irpSp ; [L94] int nextIrpSp ; [L95] int nextIrpSp__Control ; [L96] int irpSp___0 ; [L97] int irpSp__Context ; [L98] int irpSp__Control ; [L99] long __cil_tmp23 ; [L102] status = 0 [L103] devExt = DeviceObject__DeviceExtension [L104] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L105] COND FALSE !(irpStack__MinorFunction == 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L108] COND FALSE !(irpStack__MinorFunction == 23) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L111] COND TRUE irpStack__MinorFunction == 2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L235] devExt__Removed = 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L236] COND TRUE s == NP [L237] s = SKIP1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L244] Irp__CurrentLocation ++ [L245] Irp__Tail__Overlay__CurrentStackLocation ++ VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L246] CALL IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L482] int returnVal2 ; [L483] int compRetStatus ; [L484] int lcontext = __VERIFIER_nondet_int() ; [L485] long long __cil_tmp7 ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L488] COND FALSE !(\read(compRegistered)) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L501] int tmp_ndt_6; [L502] tmp_ndt_6 = __VERIFIER_nondet_int() [L503] COND FALSE !(tmp_ndt_6 == 0) [L506] int tmp_ndt_7; [L507] tmp_ndt_7 = __VERIFIER_nondet_int() [L508] COND TRUE tmp_ndt_7 == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L517] returnVal2 = -1073741823 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L527] COND FALSE !(s == NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L531] COND FALSE !(s == MPR1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L540] COND TRUE s == SKIP1 [L541] s = SKIP2 [L542] lowerDriverReturn = returnVal2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L550] return (returnVal2); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, \result=-1073741823, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L246] RET IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IofCallDriver(devExt__TopOfStack, Irp)=-1073741823, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L247] status = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L289] return (status); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, \result=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L387] RET, EXPR KbFilter_PnP(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KbFilter_PnP(devobj, pirp)=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L387] status = KbFilter_PnP(devobj, pirp) [L411] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L419] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L427] COND TRUE s != UNLOADED VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L428] COND TRUE status != -1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L429] COND FALSE !(s != SKIP2) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L439] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L446] COND FALSE !(s == DC) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L451] COND TRUE status != lowerDriverReturn VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L452] CALL errorFn() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1012] __VERIFIER_error() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 240 locations, 1 error locations. UNSAFE Result, 5.7s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4870 SDtfs, 2604 SDslu, 12062 SDs, 0 SdLazy, 2203 SolverSat, 385 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 258 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 962 NumberOfCodeBlocks, 962 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 887 ConstructedInterpolants, 0 QuantifiedInterpolants, 75649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...