/usr/bin/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-fb55353 [2019-11-06 21:27:35,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:27:35,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:27:35,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:27:35,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:27:35,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:27:35,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:27:35,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:27:35,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:27:35,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:27:35,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:27:35,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:27:35,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:27:35,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:27:35,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:27:35,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:27:35,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:27:35,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:27:35,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:27:35,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:27:35,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:27:35,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:27:35,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:27:35,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:27:35,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:27:35,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:27:35,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:27:35,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:27:35,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:27:35,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:27:35,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:27:35,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:27:35,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:27:35,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:27:35,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:27:35,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:27:35,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:27:35,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:27:35,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:27:35,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:27:35,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:27:35,203 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-11-06 21:27:35,217 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:27:35,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:27:35,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:27:35,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:27:35,219 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:27:35,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:27:35,219 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:27:35,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:27:35,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:27:35,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:27:35,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:27:35,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:27:35,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:27:35,221 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:27:35,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:27:35,221 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:27:35,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:27:35,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:27:35,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:27:35,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:27:35,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:27:35,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:27:35,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:27:35,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:27:35,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:27:35,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:27:35,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:27:35,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:27:35,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:27:35,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:27:35,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:27:35,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:27:35,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:27:35,544 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:27:35,545 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-11-06 21:27:35,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06804255b/f77ef597df7e49b19d9d27c9eef995d2/FLAG9f36090d1 [2019-11-06 21:27:36,146 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:27:36,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-06 21:27:36,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06804255b/f77ef597df7e49b19d9d27c9eef995d2/FLAG9f36090d1 [2019-11-06 21:27:36,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06804255b/f77ef597df7e49b19d9d27c9eef995d2 [2019-11-06 21:27:36,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:27:36,393 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:27:36,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:27:36,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:27:36,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:27:36,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:36,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd2903e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36, skipping insertion in model container [2019-11-06 21:27:36,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:36,412 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:27:36,471 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:27:36,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:27:36,805 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:27:36,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:27:36,994 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:27:36,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36 WrapperNode [2019-11-06 21:27:36,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:27:36,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:27:36,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:27:36,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:27:37,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:37,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:37,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:37,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:37,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:37,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:37,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:37,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:27:37,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:27:37,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:27:37,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:27:37,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (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-11-06 21:27:37,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:27:37,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:27:37,134 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-06 21:27:37,134 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-06 21:27:37,134 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-11-06 21:27:37,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:27:37,134 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-06 21:27:37,134 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-06 21:27:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-06 21:27:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-06 21:27:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-06 21:27:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-11-06 21:27:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-11-06 21:27:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-11-06 21:27:37,136 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-11-06 21:27:37,136 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-11-06 21:27:37,136 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-11-06 21:27:37,136 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-06 21:27:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:27:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 21:27:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:27:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 21:27:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 21:27:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-11-06 21:27:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-06 21:27:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-06 21:27:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-06 21:27:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-11-06 21:27:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-11-06 21:27:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-11-06 21:27:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-11-06 21:27:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-11-06 21:27:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-11-06 21:27:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-06 21:27:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-06 21:27:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-06 21:27:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-06 21:27:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:27:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-06 21:27:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:27:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:27:37,432 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:37,522 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-11-06 21:27:37,523 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-11-06 21:27:37,554 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:37,724 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-06 21:27:37,724 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-06 21:27:37,725 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:37,777 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-06 21:27:37,777 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-06 21:27:37,783 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:37,828 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-06 21:27:37,829 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-06 21:27:37,920 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:37,950 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-06 21:27:37,950 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-06 21:27:37,977 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:38,088 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-11-06 21:27:38,088 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-11-06 21:27:38,104 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:27:38,104 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 21:27:38,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:38 BoogieIcfgContainer [2019-11-06 21:27:38,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:27:38,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:27:38,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:27:38,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:27:38,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:27:36" (1/3) ... [2019-11-06 21:27:38,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628181f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:38, skipping insertion in model container [2019-11-06 21:27:38,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (2/3) ... [2019-11-06 21:27:38,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628181f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:38, skipping insertion in model container [2019-11-06 21:27:38,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:38" (3/3) ... [2019-11-06 21:27:38,120 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2019-11-06 21:27:38,131 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:27:38,152 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:27:38,168 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:27:38,207 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:27:38,207 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:27:38,207 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:27:38,208 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:27:38,208 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:27:38,208 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:27:38,209 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:27:38,209 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:27:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states. [2019-11-06 21:27:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:27:38,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:38,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:38,246 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:38,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1129426977, now seen corresponding path program 1 times [2019-11-06 21:27:38,261 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:38,261 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868351528] [2019-11-06 21:27:38,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:38,701 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868351528] [2019-11-06 21:27:38,702 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:38,703 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:27:38,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533378123] [2019-11-06 21:27:38,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:27:38,710 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:38,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:27:38,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:27:38,728 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 5 states. [2019-11-06 21:27:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:39,846 INFO L93 Difference]: Finished difference Result 418 states and 629 transitions. [2019-11-06 21:27:39,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:27:39,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-06 21:27:39,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:39,865 INFO L225 Difference]: With dead ends: 418 [2019-11-06 21:27:39,865 INFO L226 Difference]: Without dead ends: 259 [2019-11-06 21:27:39,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:27:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-06 21:27:39,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 231. [2019-11-06 21:27:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-06 21:27:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2019-11-06 21:27:39,987 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 20 [2019-11-06 21:27:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:39,988 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2019-11-06 21:27:39,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:27:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2019-11-06 21:27:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:27:39,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:39,992 INFO L410 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-11-06 21:27:39,993 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:39,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1811427322, now seen corresponding path program 1 times [2019-11-06 21:27:39,993 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:39,994 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927640324] [2019-11-06 21:27:39,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:40,383 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927640324] [2019-11-06 21:27:40,383 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:40,384 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:40,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110190374] [2019-11-06 21:27:40,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:40,388 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:40,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:40,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:40,389 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 6 states. [2019-11-06 21:27:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:41,705 INFO L93 Difference]: Finished difference Result 410 states and 565 transitions. [2019-11-06 21:27:41,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:41,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-06 21:27:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:41,710 INFO L225 Difference]: With dead ends: 410 [2019-11-06 21:27:41,710 INFO L226 Difference]: Without dead ends: 349 [2019-11-06 21:27:41,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:41,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-06 21:27:41,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 304. [2019-11-06 21:27:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-06 21:27:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 415 transitions. [2019-11-06 21:27:41,756 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 415 transitions. Word has length 28 [2019-11-06 21:27:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:41,759 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 415 transitions. [2019-11-06 21:27:41,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 415 transitions. [2019-11-06 21:27:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:27:41,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:41,761 INFO L410 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-11-06 21:27:41,762 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:41,762 INFO L82 PathProgramCache]: Analyzing trace with hash 439620198, now seen corresponding path program 1 times [2019-11-06 21:27:41,763 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:41,763 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151099303] [2019-11-06 21:27:41,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:41,963 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151099303] [2019-11-06 21:27:41,963 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:41,963 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:41,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321988130] [2019-11-06 21:27:41,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:41,964 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:41,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:41,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:41,965 INFO L87 Difference]: Start difference. First operand 304 states and 415 transitions. Second operand 6 states. [2019-11-06 21:27:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:42,818 INFO L93 Difference]: Finished difference Result 487 states and 647 transitions. [2019-11-06 21:27:42,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:42,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-06 21:27:42,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:42,822 INFO L225 Difference]: With dead ends: 487 [2019-11-06 21:27:42,823 INFO L226 Difference]: Without dead ends: 368 [2019-11-06 21:27:42,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-06 21:27:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 344. [2019-11-06 21:27:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-06 21:27:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 466 transitions. [2019-11-06 21:27:42,857 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 466 transitions. Word has length 28 [2019-11-06 21:27:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:42,858 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 466 transitions. [2019-11-06 21:27:42,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 466 transitions. [2019-11-06 21:27:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 21:27:42,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:42,861 INFO L410 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-11-06 21:27:42,861 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:42,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1607848921, now seen corresponding path program 1 times [2019-11-06 21:27:42,862 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:42,862 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766988325] [2019-11-06 21:27:42,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:43,011 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766988325] [2019-11-06 21:27:43,011 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:43,011 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:43,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813747552] [2019-11-06 21:27:43,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:43,012 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:43,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:43,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:43,013 INFO L87 Difference]: Start difference. First operand 344 states and 466 transitions. Second operand 6 states. [2019-11-06 21:27:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:43,893 INFO L93 Difference]: Finished difference Result 347 states and 468 transitions. [2019-11-06 21:27:43,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:43,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-11-06 21:27:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:43,897 INFO L225 Difference]: With dead ends: 347 [2019-11-06 21:27:43,897 INFO L226 Difference]: Without dead ends: 343 [2019-11-06 21:27:43,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:27:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-06 21:27:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-11-06 21:27:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-06 21:27:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2019-11-06 21:27:43,925 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 38 [2019-11-06 21:27:43,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:43,925 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2019-11-06 21:27:43,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2019-11-06 21:27:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-06 21:27:43,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:43,929 INFO L410 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-11-06 21:27:43,929 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:43,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:43,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1742109340, now seen corresponding path program 1 times [2019-11-06 21:27:43,930 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:43,930 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696127955] [2019-11-06 21:27:43,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:44,126 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696127955] [2019-11-06 21:27:44,126 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:44,127 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:44,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661694912] [2019-11-06 21:27:44,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:44,128 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:44,128 INFO L87 Difference]: Start difference. First operand 343 states and 463 transitions. Second operand 8 states. [2019-11-06 21:27:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:45,212 INFO L93 Difference]: Finished difference Result 394 states and 520 transitions. [2019-11-06 21:27:45,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:27:45,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-06 21:27:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:45,221 INFO L225 Difference]: With dead ends: 394 [2019-11-06 21:27:45,221 INFO L226 Difference]: Without dead ends: 325 [2019-11-06 21:27:45,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:27:45,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-06 21:27:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 304. [2019-11-06 21:27:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-06 21:27:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 406 transitions. [2019-11-06 21:27:45,255 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 406 transitions. Word has length 46 [2019-11-06 21:27:45,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:45,257 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 406 transitions. [2019-11-06 21:27:45,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:45,257 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 406 transitions. [2019-11-06 21:27:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 21:27:45,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:45,260 INFO L410 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-11-06 21:27:45,260 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:45,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:45,260 INFO L82 PathProgramCache]: Analyzing trace with hash 750041855, now seen corresponding path program 1 times [2019-11-06 21:27:45,261 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:45,261 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482669839] [2019-11-06 21:27:45,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:45,449 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482669839] [2019-11-06 21:27:45,449 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:45,449 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:45,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889398138] [2019-11-06 21:27:45,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:45,450 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:45,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:45,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:45,451 INFO L87 Difference]: Start difference. First operand 304 states and 406 transitions. Second operand 8 states. [2019-11-06 21:27:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:45,978 INFO L93 Difference]: Finished difference Result 316 states and 421 transitions. [2019-11-06 21:27:45,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:27:45,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-06 21:27:45,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:45,981 INFO L225 Difference]: With dead ends: 316 [2019-11-06 21:27:45,981 INFO L226 Difference]: Without dead ends: 300 [2019-11-06 21:27:45,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:27:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-06 21:27:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 270. [2019-11-06 21:27:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-06 21:27:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2019-11-06 21:27:46,003 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 364 transitions. Word has length 45 [2019-11-06 21:27:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:46,003 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 364 transitions. [2019-11-06 21:27:46,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2019-11-06 21:27:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-06 21:27:46,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:46,005 INFO L410 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-11-06 21:27:46,005 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:46,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:46,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1784783245, now seen corresponding path program 1 times [2019-11-06 21:27:46,006 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:46,006 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087619072] [2019-11-06 21:27:46,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:46,204 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087619072] [2019-11-06 21:27:46,205 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:46,205 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:46,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960783221] [2019-11-06 21:27:46,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:46,206 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:46,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:46,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:46,206 INFO L87 Difference]: Start difference. First operand 270 states and 364 transitions. Second operand 8 states. [2019-11-06 21:27:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:47,118 INFO L93 Difference]: Finished difference Result 290 states and 385 transitions. [2019-11-06 21:27:47,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:27:47,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-06 21:27:47,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:47,122 INFO L225 Difference]: With dead ends: 290 [2019-11-06 21:27:47,122 INFO L226 Difference]: Without dead ends: 242 [2019-11-06 21:27:47,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:27:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-06 21:27:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-06 21:27:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-06 21:27:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2019-11-06 21:27:47,157 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 46 [2019-11-06 21:27:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:47,157 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2019-11-06 21:27:47,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2019-11-06 21:27:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-06 21:27:47,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:47,161 INFO L410 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-11-06 21:27:47,162 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:47,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1852297644, now seen corresponding path program 1 times [2019-11-06 21:27:47,162 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:47,165 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420057006] [2019-11-06 21:27:47,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:47,376 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420057006] [2019-11-06 21:27:47,376 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:47,377 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:47,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558195288] [2019-11-06 21:27:47,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:47,378 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:47,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:47,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:47,379 INFO L87 Difference]: Start difference. First operand 242 states and 321 transitions. Second operand 8 states. [2019-11-06 21:27:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:47,963 INFO L93 Difference]: Finished difference Result 270 states and 354 transitions. [2019-11-06 21:27:47,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:27:47,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-06 21:27:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:47,970 INFO L225 Difference]: With dead ends: 270 [2019-11-06 21:27:47,970 INFO L226 Difference]: Without dead ends: 240 [2019-11-06 21:27:47,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:27:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-06 21:27:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-11-06 21:27:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-06 21:27:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2019-11-06 21:27:47,988 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 53 [2019-11-06 21:27:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:47,989 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2019-11-06 21:27:47,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2019-11-06 21:27:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-06 21:27:47,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:47,990 INFO L410 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-11-06 21:27:47,991 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:47,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:47,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1745163498, now seen corresponding path program 1 times [2019-11-06 21:27:47,991 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:47,991 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108526194] [2019-11-06 21:27:47,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:48,217 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108526194] [2019-11-06 21:27:48,218 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:48,218 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 21:27:48,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855191755] [2019-11-06 21:27:48,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 21:27:48,220 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:48,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 21:27:48,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:27:48,221 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand 12 states. [2019-11-06 21:27:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:49,452 INFO L93 Difference]: Finished difference Result 252 states and 329 transitions. [2019-11-06 21:27:49,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:27:49,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-11-06 21:27:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:49,457 INFO L225 Difference]: With dead ends: 252 [2019-11-06 21:27:49,457 INFO L226 Difference]: Without dead ends: 211 [2019-11-06 21:27:49,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:27:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-06 21:27:49,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-11-06 21:27:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-06 21:27:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 277 transitions. [2019-11-06 21:27:49,473 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 277 transitions. Word has length 51 [2019-11-06 21:27:49,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:49,473 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 277 transitions. [2019-11-06 21:27:49,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 21:27:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 277 transitions. [2019-11-06 21:27:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-06 21:27:49,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:49,475 INFO L410 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-11-06 21:27:49,475 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash 143486070, now seen corresponding path program 1 times [2019-11-06 21:27:49,475 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:49,476 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856059736] [2019-11-06 21:27:49,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:49,725 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856059736] [2019-11-06 21:27:49,725 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:49,725 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-06 21:27:49,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420381276] [2019-11-06 21:27:49,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:27:49,726 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:49,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:27:49,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:27:49,727 INFO L87 Difference]: Start difference. First operand 211 states and 277 transitions. Second operand 14 states. [2019-11-06 21:27:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:50,792 INFO L93 Difference]: Finished difference Result 227 states and 293 transitions. [2019-11-06 21:27:50,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 21:27:50,793 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-11-06 21:27:50,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:50,794 INFO L225 Difference]: With dead ends: 227 [2019-11-06 21:27:50,794 INFO L226 Difference]: Without dead ends: 206 [2019-11-06 21:27:50,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:27:50,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-06 21:27:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-11-06 21:27:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-06 21:27:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 270 transitions. [2019-11-06 21:27:50,812 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 270 transitions. Word has length 52 [2019-11-06 21:27:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:50,812 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 270 transitions. [2019-11-06 21:27:50,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:27:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2019-11-06 21:27:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 21:27:50,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:50,814 INFO L410 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-11-06 21:27:50,814 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:50,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:50,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1278878233, now seen corresponding path program 1 times [2019-11-06 21:27:50,815 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:50,815 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28817701] [2019-11-06 21:27:50,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:50,987 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28817701] [2019-11-06 21:27:50,987 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:50,987 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:50,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993514886] [2019-11-06 21:27:50,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:50,988 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:50,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:50,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:50,989 INFO L87 Difference]: Start difference. First operand 206 states and 270 transitions. Second operand 8 states. [2019-11-06 21:27:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:51,577 INFO L93 Difference]: Finished difference Result 246 states and 315 transitions. [2019-11-06 21:27:51,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:51,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-06 21:27:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:51,580 INFO L225 Difference]: With dead ends: 246 [2019-11-06 21:27:51,580 INFO L226 Difference]: Without dead ends: 205 [2019-11-06 21:27:51,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:27:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-06 21:27:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-11-06 21:27:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-06 21:27:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 265 transitions. [2019-11-06 21:27:51,614 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 265 transitions. Word has length 58 [2019-11-06 21:27:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:51,614 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-11-06 21:27:51,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 265 transitions. [2019-11-06 21:27:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-06 21:27:51,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:51,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:51,616 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:51,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash 85703434, now seen corresponding path program 1 times [2019-11-06 21:27:51,616 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:51,616 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880589588] [2019-11-06 21:27:51,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:51,919 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880589588] [2019-11-06 21:27:51,919 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:51,919 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-06 21:27:51,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533803206] [2019-11-06 21:27:51,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:27:51,920 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:51,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:27:51,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:27:51,921 INFO L87 Difference]: Start difference. First operand 205 states and 265 transitions. Second operand 15 states. [2019-11-06 21:27:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:53,003 INFO L93 Difference]: Finished difference Result 217 states and 277 transitions. [2019-11-06 21:27:53,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:27:53,003 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-11-06 21:27:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:53,006 INFO L225 Difference]: With dead ends: 217 [2019-11-06 21:27:53,006 INFO L226 Difference]: Without dead ends: 179 [2019-11-06 21:27:53,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:27:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-06 21:27:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-11-06 21:27:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-06 21:27:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 227 transitions. [2019-11-06 21:27:53,020 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 227 transitions. Word has length 59 [2019-11-06 21:27:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:53,020 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 227 transitions. [2019-11-06 21:27:53,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:27:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 227 transitions. [2019-11-06 21:27:53,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-06 21:27:53,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:53,022 INFO L410 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-11-06 21:27:53,022 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:53,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:53,022 INFO L82 PathProgramCache]: Analyzing trace with hash -429340253, now seen corresponding path program 1 times [2019-11-06 21:27:53,022 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:53,023 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128852206] [2019-11-06 21:27:53,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:53,285 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128852206] [2019-11-06 21:27:53,285 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:53,285 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-06 21:27:53,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484247444] [2019-11-06 21:27:53,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:27:53,287 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:53,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:27:53,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:27:53,288 INFO L87 Difference]: Start difference. First operand 179 states and 227 transitions. Second operand 15 states. [2019-11-06 21:27:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:54,242 INFO L93 Difference]: Finished difference Result 191 states and 239 transitions. [2019-11-06 21:27:54,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:27:54,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-11-06 21:27:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:54,245 INFO L225 Difference]: With dead ends: 191 [2019-11-06 21:27:54,245 INFO L226 Difference]: Without dead ends: 177 [2019-11-06 21:27:54,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:27:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-06 21:27:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-11-06 21:27:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-06 21:27:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2019-11-06 21:27:54,259 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 55 [2019-11-06 21:27:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:54,259 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2019-11-06 21:27:54,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:27:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2019-11-06 21:27:54,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-06 21:27:54,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:54,260 INFO L410 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-11-06 21:27:54,260 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:54,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:54,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1933570889, now seen corresponding path program 1 times [2019-11-06 21:27:54,261 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:54,261 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361989183] [2019-11-06 21:27:54,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:54,531 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361989183] [2019-11-06 21:27:54,531 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:54,532 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-06 21:27:54,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054961280] [2019-11-06 21:27:54,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:27:54,532 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:54,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:27:54,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:27:54,533 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand 15 states. [2019-11-06 21:27:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:55,368 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2019-11-06 21:27:55,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:27:55,368 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-11-06 21:27:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:55,370 INFO L225 Difference]: With dead ends: 189 [2019-11-06 21:27:55,370 INFO L226 Difference]: Without dead ends: 158 [2019-11-06 21:27:55,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:27:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-06 21:27:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-06 21:27:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-06 21:27:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2019-11-06 21:27:55,382 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 54 [2019-11-06 21:27:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:55,383 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2019-11-06 21:27:55,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:27:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2019-11-06 21:27:55,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-06 21:27:55,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:55,384 INFO L410 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-11-06 21:27:55,384 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash -309007876, now seen corresponding path program 1 times [2019-11-06 21:27:55,385 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:55,385 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385554913] [2019-11-06 21:27:55,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:55,682 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385554913] [2019-11-06 21:27:55,682 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:55,682 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 21:27:55,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143343100] [2019-11-06 21:27:55,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 21:27:55,684 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:55,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 21:27:55,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:27:55,685 INFO L87 Difference]: Start difference. First operand 158 states and 199 transitions. Second operand 13 states. [2019-11-06 21:27:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:56,657 INFO L93 Difference]: Finished difference Result 284 states and 346 transitions. [2019-11-06 21:27:56,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:27:56,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-11-06 21:27:56,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:56,661 INFO L225 Difference]: With dead ends: 284 [2019-11-06 21:27:56,662 INFO L226 Difference]: Without dead ends: 223 [2019-11-06 21:27:56,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-11-06 21:27:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-06 21:27:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 168. [2019-11-06 21:27:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-06 21:27:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2019-11-06 21:27:56,677 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 53 [2019-11-06 21:27:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:56,677 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2019-11-06 21:27:56,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 21:27:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2019-11-06 21:27:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-06 21:27:56,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:56,679 INFO L410 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-11-06 21:27:56,679 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:56,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1433722057, now seen corresponding path program 1 times [2019-11-06 21:27:56,680 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:56,680 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856369488] [2019-11-06 21:27:56,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:56,929 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856369488] [2019-11-06 21:27:56,929 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:56,929 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-06 21:27:56,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950358589] [2019-11-06 21:27:56,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:27:56,930 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:56,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:27:56,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:27:56,931 INFO L87 Difference]: Start difference. First operand 168 states and 212 transitions. Second operand 14 states. [2019-11-06 21:27:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:58,040 INFO L93 Difference]: Finished difference Result 184 states and 228 transitions. [2019-11-06 21:27:58,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:27:58,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-11-06 21:27:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:58,042 INFO L225 Difference]: With dead ends: 184 [2019-11-06 21:27:58,042 INFO L226 Difference]: Without dead ends: 138 [2019-11-06 21:27:58,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:27:58,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-06 21:27:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-11-06 21:27:58,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-06 21:27:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2019-11-06 21:27:58,053 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 53 [2019-11-06 21:27:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:58,053 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2019-11-06 21:27:58,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:27:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2019-11-06 21:27:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-06 21:27:58,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:58,054 INFO L410 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-11-06 21:27:58,055 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1317699651, now seen corresponding path program 1 times [2019-11-06 21:27:58,055 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:58,055 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273208143] [2019-11-06 21:27:58,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:58,340 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273208143] [2019-11-06 21:27:58,340 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:58,340 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-06 21:27:58,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022778164] [2019-11-06 21:27:58,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:27:58,341 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:58,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:27:58,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:27:58,342 INFO L87 Difference]: Start difference. First operand 138 states and 159 transitions. Second operand 15 states. [2019-11-06 21:27:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:59,757 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2019-11-06 21:27:59,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 21:27:59,758 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-11-06 21:27:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:59,759 INFO L225 Difference]: With dead ends: 196 [2019-11-06 21:27:59,759 INFO L226 Difference]: Without dead ends: 190 [2019-11-06 21:27:59,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-11-06 21:27:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-06 21:27:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 151. [2019-11-06 21:27:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-06 21:27:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2019-11-06 21:27:59,791 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 54 [2019-11-06 21:27:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:59,792 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2019-11-06 21:27:59,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:27:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2019-11-06 21:27:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-06 21:27:59,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:59,793 INFO L410 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-11-06 21:27:59,793 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:59,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1204113239, now seen corresponding path program 1 times [2019-11-06 21:27:59,794 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:59,794 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122069431] [2019-11-06 21:27:59,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:59,999 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122069431] [2019-11-06 21:27:59,999 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:59,999 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 21:27:59,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727064545] [2019-11-06 21:28:00,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:28:00,000 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:28:00,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:28:00,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:28:00,001 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand 11 states. [2019-11-06 21:28:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:28:00,419 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2019-11-06 21:28:00,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:28:00,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-11-06 21:28:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:28:00,421 INFO L225 Difference]: With dead ends: 195 [2019-11-06 21:28:00,421 INFO L226 Difference]: Without dead ends: 159 [2019-11-06 21:28:00,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:28:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-06 21:28:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2019-11-06 21:28:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-06 21:28:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions. [2019-11-06 21:28:00,434 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 173 transitions. Word has length 57 [2019-11-06 21:28:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:28:00,434 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 173 transitions. [2019-11-06 21:28:00,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:28:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 173 transitions. [2019-11-06 21:28:00,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-06 21:28:00,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:28:00,435 INFO L410 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-11-06 21:28:00,436 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:28:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:28:00,436 INFO L82 PathProgramCache]: Analyzing trace with hash -527681510, now seen corresponding path program 1 times [2019-11-06 21:28:00,436 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:28:00,436 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416538188] [2019-11-06 21:28:00,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:28:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:28:00,647 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416538188] [2019-11-06 21:28:00,647 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:28:00,647 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 21:28:00,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505313497] [2019-11-06 21:28:00,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:28:00,649 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:28:00,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:28:00,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:28:00,649 INFO L87 Difference]: Start difference. First operand 153 states and 173 transitions. Second operand 11 states. [2019-11-06 21:28:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:28:01,268 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2019-11-06 21:28:01,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:28:01,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-11-06 21:28:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:28:01,269 INFO L225 Difference]: With dead ends: 164 [2019-11-06 21:28:01,269 INFO L226 Difference]: Without dead ends: 157 [2019-11-06 21:28:01,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:28:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-06 21:28:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2019-11-06 21:28:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-06 21:28:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2019-11-06 21:28:01,281 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 57 [2019-11-06 21:28:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:28:01,281 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2019-11-06 21:28:01,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:28:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2019-11-06 21:28:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-06 21:28:01,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:28:01,282 INFO L410 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-11-06 21:28:01,283 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:28:01,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:28:01,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1222442102, now seen corresponding path program 1 times [2019-11-06 21:28:01,283 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:28:01,283 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105737783] [2019-11-06 21:28:01,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:28:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:28:01,586 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105737783] [2019-11-06 21:28:01,586 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:28:01,586 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-06 21:28:01,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306642527] [2019-11-06 21:28:01,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:28:01,587 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:28:01,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:28:01,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:28:01,588 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand 14 states. [2019-11-06 21:28:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:28:02,788 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2019-11-06 21:28:02,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 21:28:02,789 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-11-06 21:28:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:28:02,790 INFO L225 Difference]: With dead ends: 186 [2019-11-06 21:28:02,791 INFO L226 Difference]: Without dead ends: 166 [2019-11-06 21:28:02,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2019-11-06 21:28:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-06 21:28:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 141. [2019-11-06 21:28:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-06 21:28:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2019-11-06 21:28:02,803 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 55 [2019-11-06 21:28:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:28:02,804 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2019-11-06 21:28:02,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:28:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2019-11-06 21:28:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 21:28:02,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:28:02,805 INFO L410 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-11-06 21:28:02,805 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:28:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:28:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash -639520605, now seen corresponding path program 1 times [2019-11-06 21:28:02,806 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:28:02,806 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724781847] [2019-11-06 21:28:02,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:28:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:02,952 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-06 21:28:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:28:03,139 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724781847] [2019-11-06 21:28:03,140 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:28:03,140 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 21:28:03,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237013194] [2019-11-06 21:28:03,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:28:03,145 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:28:03,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:28:03,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:28:03,145 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand 10 states. [2019-11-06 21:28:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:28:03,435 INFO L93 Difference]: Finished difference Result 177 states and 201 transitions. [2019-11-06 21:28:03,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:28:03,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-11-06 21:28:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:28:03,437 INFO L225 Difference]: With dead ends: 177 [2019-11-06 21:28:03,437 INFO L226 Difference]: Without dead ends: 135 [2019-11-06 21:28:03,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:28:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-06 21:28:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-06 21:28:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-06 21:28:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2019-11-06 21:28:03,452 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 58 [2019-11-06 21:28:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:28:03,452 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2019-11-06 21:28:03,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:28:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2019-11-06 21:28:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-06 21:28:03,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:28:03,454 INFO L410 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-11-06 21:28:03,454 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:28:03,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:28:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1656625880, now seen corresponding path program 1 times [2019-11-06 21:28:03,456 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:28:03,456 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615828394] [2019-11-06 21:28:03,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:28:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-06 21:28:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-06 21:28:03,584 INFO L172 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-06 21:28:03,585 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-06 21:28:03,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:28:03 BoogieIcfgContainer [2019-11-06 21:28:03,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:28:03,729 INFO L168 Benchmark]: Toolchain (without parser) took 27335.90 ms. Allocated memory was 144.7 MB in the beginning and 473.4 MB in the end (delta: 328.7 MB). Free memory was 101.9 MB in the beginning and 121.1 MB in the end (delta: -19.2 MB). Peak memory consumption was 309.5 MB. Max. memory is 7.1 GB. [2019-11-06 21:28:03,730 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-06 21:28:03,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.27 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 101.7 MB in the beginning and 176.1 MB in the end (delta: -74.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-11-06 21:28:03,731 INFO L168 Benchmark]: Boogie Preprocessor took 82.43 ms. Allocated memory is still 202.9 MB. Free memory was 176.1 MB in the beginning and 172.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-11-06 21:28:03,732 INFO L168 Benchmark]: RCFGBuilder took 1030.06 ms. Allocated memory is still 202.9 MB. Free memory was 172.3 MB in the beginning and 102.1 MB in the end (delta: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. [2019-11-06 21:28:03,737 INFO L168 Benchmark]: TraceAbstraction took 25617.51 ms. Allocated memory was 202.9 MB in the beginning and 473.4 MB in the end (delta: 270.5 MB). Free memory was 101.4 MB in the beginning and 121.1 MB in the end (delta: -19.7 MB). Peak memory consumption was 250.9 MB. Max. memory is 7.1 GB. [2019-11-06 21:28:03,742 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.38 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 601.27 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 101.7 MB in the beginning and 176.1 MB in the end (delta: -74.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.43 ms. Allocated memory is still 202.9 MB. Free memory was 176.1 MB in the beginning and 172.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1030.06 ms. Allocated memory is still 202.9 MB. Free memory was 172.3 MB in the beginning and 102.1 MB in the end (delta: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25617.51 ms. Allocated memory was 202.9 MB in the beginning and 473.4 MB in the end (delta: 270.5 MB). Free memory was 101.4 MB in the beginning and 121.1 MB in the end (delta: -19.7 MB). Peak memory consumption was 250.9 MB. 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. Result: UNSAFE, OverallTime: 25.5s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4242 SDtfs, 5244 SDslu, 7790 SDs, 0 SdLazy, 15074 SolverSat, 1163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 177 SyntacticMatches, 6 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 276 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1076 NumberOfCodeBlocks, 1076 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 999 ConstructedInterpolants, 0 QuantifiedInterpolants, 229147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...