/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:37:46,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:37:46,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:37:46,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:37:46,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:37:46,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:37:46,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:37:46,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:37:46,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:37:46,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:37:46,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:37:46,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:37:46,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:37:46,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:37:46,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:37:46,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:37:46,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:37:46,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:37:46,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:37:46,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:37:46,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:37:46,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:37:46,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:37:46,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:37:46,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:37:46,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:37:46,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:37:46,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:37:46,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:37:46,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:37:46,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:37:46,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:37:46,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:37:46,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:37:46,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:37:46,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:37:46,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:37:46,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:37:46,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:37:46,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:37:46,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:37:46,197 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-07 00:37:46,210 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:37:46,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:37:46,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:37:46,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:37:46,212 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:37:46,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:37:46,213 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:37:46,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:37:46,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:37:46,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:37:46,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:37:46,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:37:46,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:37:46,214 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:37:46,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:37:46,215 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:37:46,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:37:46,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:37:46,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:37:46,216 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:37:46,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:37:46,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:37:46,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:37:46,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:37:46,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:37:46,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:37:46,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:37:46,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:37:46,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:37:46,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:37:46,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:37:46,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:37:46,531 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:37:46,532 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:37:46,532 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-07 00:37:46,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecfba9ed/7f82a1e6d2b74c7eb3e950de778dd7c6/FLAG0c0267c5f [2019-11-07 00:37:47,112 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:37:47,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-07 00:37:47,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecfba9ed/7f82a1e6d2b74c7eb3e950de778dd7c6/FLAG0c0267c5f [2019-11-07 00:37:47,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecfba9ed/7f82a1e6d2b74c7eb3e950de778dd7c6 [2019-11-07 00:37:47,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:37:47,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:37:47,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:37:47,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:37:47,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:37:47,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:37:47" (1/1) ... [2019-11-07 00:37:47,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498fa5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:47, skipping insertion in model container [2019-11-07 00:37:47,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:37:47" (1/1) ... [2019-11-07 00:37:47,465 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:37:47,510 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:37:47,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:37:47,826 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:37:48,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:37:48,049 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:37:48,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:48 WrapperNode [2019-11-07 00:37:48,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:37:48,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:37:48,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:37:48,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:37:48,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:48" (1/1) ... [2019-11-07 00:37:48,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:48" (1/1) ... [2019-11-07 00:37:48,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:48" (1/1) ... [2019-11-07 00:37:48,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:48" (1/1) ... [2019-11-07 00:37:48,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:48" (1/1) ... [2019-11-07 00:37:48,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:48" (1/1) ... [2019-11-07 00:37:48,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:48" (1/1) ... [2019-11-07 00:37:48,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:37:48,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:37:48,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:37:48,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:37:48,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:48" (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-07 00:37:48,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:37:48,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:37:48,181 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-07 00:37:48,181 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-07 00:37:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-11-07 00:37:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:37:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-07 00:37:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-07 00:37:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-07 00:37:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-07 00:37:48,183 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-07 00:37:48,183 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-11-07 00:37:48,183 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-11-07 00:37:48,183 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-11-07 00:37:48,183 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-11-07 00:37:48,183 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-11-07 00:37:48,184 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-11-07 00:37:48,184 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-07 00:37:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:37:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 00:37:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:37:48,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 00:37:48,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 00:37:48,185 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-11-07 00:37:48,185 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-07 00:37:48,185 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-07 00:37:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-07 00:37:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-11-07 00:37:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-11-07 00:37:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-11-07 00:37:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-11-07 00:37:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-11-07 00:37:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-11-07 00:37:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-07 00:37:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-07 00:37:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-07 00:37:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-07 00:37:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:37:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-07 00:37:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:37:48,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:37:48,502 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:48,561 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-11-07 00:37:48,561 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-11-07 00:37:48,582 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:48,723 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-07 00:37:48,724 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-07 00:37:48,725 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:48,762 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-07 00:37:48,762 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-07 00:37:48,769 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:48,806 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-07 00:37:48,806 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-07 00:37:48,899 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:48,936 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-07 00:37:48,936 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-07 00:37:48,968 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 00:37:49,102 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-11-07 00:37:49,103 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-11-07 00:37:49,111 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:37:49,112 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 00:37:49,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:37:49 BoogieIcfgContainer [2019-11-07 00:37:49,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:37:49,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:37:49,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:37:49,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:37:49,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:37:47" (1/3) ... [2019-11-07 00:37:49,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a8604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:37:49, skipping insertion in model container [2019-11-07 00:37:49,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:37:48" (2/3) ... [2019-11-07 00:37:49,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a8604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:37:49, skipping insertion in model container [2019-11-07 00:37:49,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:37:49" (3/3) ... [2019-11-07 00:37:49,122 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2019-11-07 00:37:49,132 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:37:49,142 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:37:49,154 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:37:49,182 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:37:49,182 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:37:49,182 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:37:49,182 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:37:49,183 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:37:49,183 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:37:49,183 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:37:49,183 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:37:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states. [2019-11-07 00:37:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:37:49,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:49,219 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-07 00:37:49,221 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:49,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:49,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1129426977, now seen corresponding path program 1 times [2019-11-07 00:37:49,235 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:49,235 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976545410] [2019-11-07 00:37:49,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:49,532 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-07 00:37:49,535 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976545410] [2019-11-07 00:37:49,536 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:49,536 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:49,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320616580] [2019-11-07 00:37:49,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:49,544 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:49,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:49,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:49,563 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 3 states. [2019-11-07 00:37:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:49,703 INFO L93 Difference]: Finished difference Result 390 states and 586 transitions. [2019-11-07 00:37:49,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:49,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-07 00:37:49,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:49,720 INFO L225 Difference]: With dead ends: 390 [2019-11-07 00:37:49,720 INFO L226 Difference]: Without dead ends: 231 [2019-11-07 00:37:49,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-07 00:37:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-11-07 00:37:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-07 00:37:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2019-11-07 00:37:49,804 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 20 [2019-11-07 00:37:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:49,804 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2019-11-07 00:37:49,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2019-11-07 00:37:49,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:37:49,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:49,808 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-07 00:37:49,808 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:49,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:49,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1811427322, now seen corresponding path program 1 times [2019-11-07 00:37:49,809 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:49,809 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576914302] [2019-11-07 00:37:49,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:49,980 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-07 00:37:49,981 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576914302] [2019-11-07 00:37:49,981 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:49,981 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:49,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968861867] [2019-11-07 00:37:49,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:49,983 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:49,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:49,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:49,984 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 3 states. [2019-11-07 00:37:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:50,223 INFO L93 Difference]: Finished difference Result 375 states and 514 transitions. [2019-11-07 00:37:50,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:50,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 00:37:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:50,232 INFO L225 Difference]: With dead ends: 375 [2019-11-07 00:37:50,233 INFO L226 Difference]: Without dead ends: 314 [2019-11-07 00:37:50,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-07 00:37:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 298. [2019-11-07 00:37:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-07 00:37:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 408 transitions. [2019-11-07 00:37:50,298 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 408 transitions. Word has length 28 [2019-11-07 00:37:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:50,299 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 408 transitions. [2019-11-07 00:37:50,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 408 transitions. [2019-11-07 00:37:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:37:50,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:50,301 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-07 00:37:50,301 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash 439620198, now seen corresponding path program 1 times [2019-11-07 00:37:50,302 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:50,302 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533648998] [2019-11-07 00:37:50,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:50,391 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-07 00:37:50,392 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533648998] [2019-11-07 00:37:50,392 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:50,392 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:50,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762520938] [2019-11-07 00:37:50,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:50,393 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:50,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:50,395 INFO L87 Difference]: Start difference. First operand 298 states and 408 transitions. Second operand 3 states. [2019-11-07 00:37:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:50,441 INFO L93 Difference]: Finished difference Result 481 states and 640 transitions. [2019-11-07 00:37:50,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:50,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 00:37:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:50,448 INFO L225 Difference]: With dead ends: 481 [2019-11-07 00:37:50,448 INFO L226 Difference]: Without dead ends: 362 [2019-11-07 00:37:50,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:50,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-07 00:37:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 338. [2019-11-07 00:37:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-11-07 00:37:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 459 transitions. [2019-11-07 00:37:50,491 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 459 transitions. Word has length 28 [2019-11-07 00:37:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:50,492 INFO L462 AbstractCegarLoop]: Abstraction has 338 states and 459 transitions. [2019-11-07 00:37:50,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 459 transitions. [2019-11-07 00:37:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 00:37:50,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:50,495 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-07 00:37:50,496 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1607848921, now seen corresponding path program 1 times [2019-11-07 00:37:50,496 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:50,497 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854228754] [2019-11-07 00:37:50,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:50,567 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-07 00:37:50,567 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854228754] [2019-11-07 00:37:50,567 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:50,567 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:50,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398266714] [2019-11-07 00:37:50,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:50,569 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:50,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:50,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:50,570 INFO L87 Difference]: Start difference. First operand 338 states and 459 transitions. Second operand 3 states. [2019-11-07 00:37:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:50,665 INFO L93 Difference]: Finished difference Result 341 states and 461 transitions. [2019-11-07 00:37:50,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:50,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-07 00:37:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:50,669 INFO L225 Difference]: With dead ends: 341 [2019-11-07 00:37:50,669 INFO L226 Difference]: Without dead ends: 337 [2019-11-07 00:37:50,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-11-07 00:37:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2019-11-07 00:37:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-11-07 00:37:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 456 transitions. [2019-11-07 00:37:50,693 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 456 transitions. Word has length 38 [2019-11-07 00:37:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:50,694 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 456 transitions. [2019-11-07 00:37:50,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 456 transitions. [2019-11-07 00:37:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 00:37:50,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:50,698 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-07 00:37:50,698 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1742109340, now seen corresponding path program 1 times [2019-11-07 00:37:50,699 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:50,699 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967911115] [2019-11-07 00:37:50,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:50,791 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-07 00:37:50,792 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967911115] [2019-11-07 00:37:50,792 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:50,792 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:37:50,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369335593] [2019-11-07 00:37:50,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:37:50,794 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:37:50,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:37:50,796 INFO L87 Difference]: Start difference. First operand 337 states and 456 transitions. Second operand 4 states. [2019-11-07 00:37:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:50,954 INFO L93 Difference]: Finished difference Result 388 states and 513 transitions. [2019-11-07 00:37:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:37:50,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-07 00:37:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:50,957 INFO L225 Difference]: With dead ends: 388 [2019-11-07 00:37:50,957 INFO L226 Difference]: Without dead ends: 319 [2019-11-07 00:37:50,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:37:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-07 00:37:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 298. [2019-11-07 00:37:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-07 00:37:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 399 transitions. [2019-11-07 00:37:50,975 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 399 transitions. Word has length 46 [2019-11-07 00:37:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:50,976 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 399 transitions. [2019-11-07 00:37:50,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:37:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 399 transitions. [2019-11-07 00:37:50,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 00:37:50,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:50,978 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-07 00:37:50,979 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:50,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:50,979 INFO L82 PathProgramCache]: Analyzing trace with hash 750041855, now seen corresponding path program 1 times [2019-11-07 00:37:50,979 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:50,980 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217537044] [2019-11-07 00:37:50,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:51,030 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-07 00:37:51,030 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217537044] [2019-11-07 00:37:51,030 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:51,031 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:51,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626520246] [2019-11-07 00:37:51,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:51,032 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:51,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:51,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:51,032 INFO L87 Difference]: Start difference. First operand 298 states and 399 transitions. Second operand 3 states. [2019-11-07 00:37:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:51,060 INFO L93 Difference]: Finished difference Result 310 states and 414 transitions. [2019-11-07 00:37:51,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:51,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-07 00:37:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:51,063 INFO L225 Difference]: With dead ends: 310 [2019-11-07 00:37:51,063 INFO L226 Difference]: Without dead ends: 294 [2019-11-07 00:37:51,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-07 00:37:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 264. [2019-11-07 00:37:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-07 00:37:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 357 transitions. [2019-11-07 00:37:51,081 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 357 transitions. Word has length 45 [2019-11-07 00:37:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:51,081 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 357 transitions. [2019-11-07 00:37:51,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 357 transitions. [2019-11-07 00:37:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 00:37:51,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:51,083 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-07 00:37:51,084 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:51,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1784783245, now seen corresponding path program 1 times [2019-11-07 00:37:51,084 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:51,084 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484232158] [2019-11-07 00:37:51,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:51,135 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-07 00:37:51,136 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484232158] [2019-11-07 00:37:51,136 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:51,136 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:51,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632944613] [2019-11-07 00:37:51,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:51,137 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:51,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:51,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:51,138 INFO L87 Difference]: Start difference. First operand 264 states and 357 transitions. Second operand 3 states. [2019-11-07 00:37:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:51,218 INFO L93 Difference]: Finished difference Result 284 states and 378 transitions. [2019-11-07 00:37:51,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:51,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-07 00:37:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:51,225 INFO L225 Difference]: With dead ends: 284 [2019-11-07 00:37:51,226 INFO L226 Difference]: Without dead ends: 242 [2019-11-07 00:37:51,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-07 00:37:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-07 00:37:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-07 00:37:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2019-11-07 00:37:51,246 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 46 [2019-11-07 00:37:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:51,247 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2019-11-07 00:37:51,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2019-11-07 00:37:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 00:37:51,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:51,250 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-07 00:37:51,250 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:51,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1852297644, now seen corresponding path program 1 times [2019-11-07 00:37:51,251 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:51,251 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445835294] [2019-11-07 00:37:51,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:51,315 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-07 00:37:51,316 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445835294] [2019-11-07 00:37:51,316 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:51,316 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:51,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797569980] [2019-11-07 00:37:51,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:51,317 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:51,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:51,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:51,319 INFO L87 Difference]: Start difference. First operand 242 states and 321 transitions. Second operand 3 states. [2019-11-07 00:37:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:51,379 INFO L93 Difference]: Finished difference Result 270 states and 354 transitions. [2019-11-07 00:37:51,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:51,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-07 00:37:51,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:51,382 INFO L225 Difference]: With dead ends: 270 [2019-11-07 00:37:51,382 INFO L226 Difference]: Without dead ends: 240 [2019-11-07 00:37:51,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-07 00:37:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-11-07 00:37:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-07 00:37:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2019-11-07 00:37:51,396 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 53 [2019-11-07 00:37:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:51,397 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2019-11-07 00:37:51,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2019-11-07 00:37:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 00:37:51,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:51,399 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-07 00:37:51,399 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1745163498, now seen corresponding path program 1 times [2019-11-07 00:37:51,399 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:51,400 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237468414] [2019-11-07 00:37:51,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:51,473 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-07 00:37:51,474 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237468414] [2019-11-07 00:37:51,474 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:51,474 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 00:37:51,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570117634] [2019-11-07 00:37:51,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:37:51,475 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:51,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:37:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:51,476 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand 8 states. [2019-11-07 00:37:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:51,652 INFO L93 Difference]: Finished difference Result 252 states and 329 transitions. [2019-11-07 00:37:51,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:37:51,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-07 00:37:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:51,654 INFO L225 Difference]: With dead ends: 252 [2019-11-07 00:37:51,654 INFO L226 Difference]: Without dead ends: 211 [2019-11-07 00:37:51,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:37:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-07 00:37:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-11-07 00:37:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-07 00:37:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 277 transitions. [2019-11-07 00:37:51,671 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 277 transitions. Word has length 51 [2019-11-07 00:37:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:51,671 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 277 transitions. [2019-11-07 00:37:51,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:37:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 277 transitions. [2019-11-07 00:37:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 00:37:51,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:51,673 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-07 00:37:51,674 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:51,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:51,674 INFO L82 PathProgramCache]: Analyzing trace with hash 143486070, now seen corresponding path program 1 times [2019-11-07 00:37:51,674 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:51,675 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726825638] [2019-11-07 00:37:51,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:51,793 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-07 00:37:51,793 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726825638] [2019-11-07 00:37:51,794 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:51,794 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:37:51,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706128448] [2019-11-07 00:37:51,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:37:51,795 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:51,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:37:51,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:37:51,796 INFO L87 Difference]: Start difference. First operand 211 states and 277 transitions. Second operand 9 states. [2019-11-07 00:37:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:51,978 INFO L93 Difference]: Finished difference Result 227 states and 293 transitions. [2019-11-07 00:37:51,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:37:51,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-11-07 00:37:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:51,980 INFO L225 Difference]: With dead ends: 227 [2019-11-07 00:37:51,980 INFO L226 Difference]: Without dead ends: 206 [2019-11-07 00:37:51,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-07 00:37:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-11-07 00:37:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-07 00:37:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 270 transitions. [2019-11-07 00:37:52,000 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 270 transitions. Word has length 52 [2019-11-07 00:37:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:52,000 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 270 transitions. [2019-11-07 00:37:52,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:37:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2019-11-07 00:37:52,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 00:37:52,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:52,004 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-07 00:37:52,004 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:52,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1278878233, now seen corresponding path program 1 times [2019-11-07 00:37:52,005 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:52,005 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897460681] [2019-11-07 00:37:52,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:52,067 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-07 00:37:52,067 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897460681] [2019-11-07 00:37:52,067 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:52,067 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:37:52,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379216632] [2019-11-07 00:37:52,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:37:52,068 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:52,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:37:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:52,070 INFO L87 Difference]: Start difference. First operand 206 states and 270 transitions. Second operand 3 states. [2019-11-07 00:37:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:52,092 INFO L93 Difference]: Finished difference Result 246 states and 315 transitions. [2019-11-07 00:37:52,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:37:52,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 00:37:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:52,096 INFO L225 Difference]: With dead ends: 246 [2019-11-07 00:37:52,096 INFO L226 Difference]: Without dead ends: 205 [2019-11-07 00:37:52,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:37:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-07 00:37:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-11-07 00:37:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-07 00:37:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 265 transitions. [2019-11-07 00:37:52,110 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 265 transitions. Word has length 58 [2019-11-07 00:37:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:52,110 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-11-07 00:37:52,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:37:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 265 transitions. [2019-11-07 00:37:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 00:37:52,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:52,112 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-07 00:37:52,112 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:52,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:52,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1933570889, now seen corresponding path program 1 times [2019-11-07 00:37:52,112 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:52,113 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919270491] [2019-11-07 00:37:52,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:52,202 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-07 00:37:52,202 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919270491] [2019-11-07 00:37:52,203 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:52,203 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:37:52,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124641868] [2019-11-07 00:37:52,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:37:52,204 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:52,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:37:52,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:37:52,204 INFO L87 Difference]: Start difference. First operand 205 states and 265 transitions. Second operand 10 states. [2019-11-07 00:37:52,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:52,395 INFO L93 Difference]: Finished difference Result 217 states and 277 transitions. [2019-11-07 00:37:52,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:37:52,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-07 00:37:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:52,397 INFO L225 Difference]: With dead ends: 217 [2019-11-07 00:37:52,397 INFO L226 Difference]: Without dead ends: 203 [2019-11-07 00:37:52,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:52,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-07 00:37:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-11-07 00:37:52,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-07 00:37:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 261 transitions. [2019-11-07 00:37:52,412 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 261 transitions. Word has length 54 [2019-11-07 00:37:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:52,412 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 261 transitions. [2019-11-07 00:37:52,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:37:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 261 transitions. [2019-11-07 00:37:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 00:37:52,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:52,415 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-07 00:37:52,415 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:52,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:52,416 INFO L82 PathProgramCache]: Analyzing trace with hash -309007876, now seen corresponding path program 1 times [2019-11-07 00:37:52,416 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:52,416 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686761661] [2019-11-07 00:37:52,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:52,481 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-07 00:37:52,481 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686761661] [2019-11-07 00:37:52,481 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:52,482 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 00:37:52,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621609700] [2019-11-07 00:37:52,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:37:52,483 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:52,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:37:52,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:52,483 INFO L87 Difference]: Start difference. First operand 203 states and 261 transitions. Second operand 8 states. [2019-11-07 00:37:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:52,794 INFO L93 Difference]: Finished difference Result 351 states and 434 transitions. [2019-11-07 00:37:52,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:37:52,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-07 00:37:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:52,797 INFO L225 Difference]: With dead ends: 351 [2019-11-07 00:37:52,797 INFO L226 Difference]: Without dead ends: 279 [2019-11-07 00:37:52,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:37:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-07 00:37:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 213. [2019-11-07 00:37:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-07 00:37:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 275 transitions. [2019-11-07 00:37:52,813 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 275 transitions. Word has length 53 [2019-11-07 00:37:52,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:52,815 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 275 transitions. [2019-11-07 00:37:52,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:37:52,815 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 275 transitions. [2019-11-07 00:37:52,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 00:37:52,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:52,816 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-07 00:37:52,816 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:52,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:52,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1433722057, now seen corresponding path program 1 times [2019-11-07 00:37:52,817 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:52,817 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879213364] [2019-11-07 00:37:52,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:52,904 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-07 00:37:52,904 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879213364] [2019-11-07 00:37:52,904 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:52,904 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:37:52,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387370098] [2019-11-07 00:37:52,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:37:52,905 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:52,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:37:52,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:37:52,906 INFO L87 Difference]: Start difference. First operand 213 states and 275 transitions. Second operand 9 states. [2019-11-07 00:37:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:53,067 INFO L93 Difference]: Finished difference Result 229 states and 291 transitions. [2019-11-07 00:37:53,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:37:53,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-11-07 00:37:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:53,069 INFO L225 Difference]: With dead ends: 229 [2019-11-07 00:37:53,069 INFO L226 Difference]: Without dead ends: 191 [2019-11-07 00:37:53,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-07 00:37:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-07 00:37:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-11-07 00:37:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-07 00:37:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2019-11-07 00:37:53,081 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 53 [2019-11-07 00:37:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:53,081 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2019-11-07 00:37:53,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:37:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2019-11-07 00:37:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 00:37:53,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:53,086 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-07 00:37:53,086 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:53,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:53,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1317699651, now seen corresponding path program 1 times [2019-11-07 00:37:53,087 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:53,087 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837763777] [2019-11-07 00:37:53,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:53,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-07 00:37:53,218 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837763777] [2019-11-07 00:37:53,218 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:53,218 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:37:53,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74812687] [2019-11-07 00:37:53,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:37:53,219 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:53,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:37:53,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:37:53,220 INFO L87 Difference]: Start difference. First operand 191 states and 232 transitions. Second operand 10 states. [2019-11-07 00:37:53,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:53,964 INFO L93 Difference]: Finished difference Result 277 states and 325 transitions. [2019-11-07 00:37:53,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 00:37:53,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-07 00:37:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:53,966 INFO L225 Difference]: With dead ends: 277 [2019-11-07 00:37:53,966 INFO L226 Difference]: Without dead ends: 271 [2019-11-07 00:37:53,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:37:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-07 00:37:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 218. [2019-11-07 00:37:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-07 00:37:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 261 transitions. [2019-11-07 00:37:53,983 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 261 transitions. Word has length 54 [2019-11-07 00:37:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:53,983 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 261 transitions. [2019-11-07 00:37:53,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:37:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 261 transitions. [2019-11-07 00:37:53,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 00:37:53,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:53,985 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-07 00:37:53,985 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:53,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1204113239, now seen corresponding path program 1 times [2019-11-07 00:37:53,986 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:53,986 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204978266] [2019-11-07 00:37:53,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:54,039 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-07 00:37:54,040 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204978266] [2019-11-07 00:37:54,040 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:54,040 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:54,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827860414] [2019-11-07 00:37:54,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:54,041 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:54,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:54,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:54,042 INFO L87 Difference]: Start difference. First operand 218 states and 261 transitions. Second operand 6 states. [2019-11-07 00:37:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:54,097 INFO L93 Difference]: Finished difference Result 262 states and 313 transitions. [2019-11-07 00:37:54,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:54,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-07 00:37:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:54,099 INFO L225 Difference]: With dead ends: 262 [2019-11-07 00:37:54,099 INFO L226 Difference]: Without dead ends: 226 [2019-11-07 00:37:54,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:37:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-07 00:37:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2019-11-07 00:37:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-07 00:37:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2019-11-07 00:37:54,114 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 57 [2019-11-07 00:37:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:54,115 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2019-11-07 00:37:54,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2019-11-07 00:37:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 00:37:54,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:54,117 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-07 00:37:54,117 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:54,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:54,117 INFO L82 PathProgramCache]: Analyzing trace with hash -527681510, now seen corresponding path program 1 times [2019-11-07 00:37:54,117 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:54,118 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128690516] [2019-11-07 00:37:54,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:54,178 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-07 00:37:54,178 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128690516] [2019-11-07 00:37:54,179 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:54,179 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:37:54,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645479971] [2019-11-07 00:37:54,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:37:54,180 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:54,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:37:54,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:37:54,180 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand 6 states. [2019-11-07 00:37:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:54,242 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2019-11-07 00:37:54,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:37:54,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-07 00:37:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:54,244 INFO L225 Difference]: With dead ends: 231 [2019-11-07 00:37:54,244 INFO L226 Difference]: Without dead ends: 224 [2019-11-07 00:37:54,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:37:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-07 00:37:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-11-07 00:37:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-07 00:37:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 263 transitions. [2019-11-07 00:37:54,258 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 263 transitions. Word has length 57 [2019-11-07 00:37:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:54,259 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 263 transitions. [2019-11-07 00:37:54,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:37:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 263 transitions. [2019-11-07 00:37:54,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 00:37:54,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37: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, 1] [2019-11-07 00:37:54,260 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:54,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:54,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1222442102, now seen corresponding path program 1 times [2019-11-07 00:37:54,261 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:54,261 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011035885] [2019-11-07 00:37:54,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:54,363 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-07 00:37:54,364 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011035885] [2019-11-07 00:37:54,364 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:54,364 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:37:54,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718333332] [2019-11-07 00:37:54,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:37:54,365 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:54,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:37:54,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:37:54,366 INFO L87 Difference]: Start difference. First operand 221 states and 263 transitions. Second operand 9 states. [2019-11-07 00:37:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:54,859 INFO L93 Difference]: Finished difference Result 267 states and 309 transitions. [2019-11-07 00:37:54,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-07 00:37:54,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-07 00:37:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:54,861 INFO L225 Difference]: With dead ends: 267 [2019-11-07 00:37:54,862 INFO L226 Difference]: Without dead ends: 233 [2019-11-07 00:37:54,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-11-07 00:37:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-07 00:37:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 194. [2019-11-07 00:37:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-07 00:37:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 232 transitions. [2019-11-07 00:37:54,877 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 232 transitions. Word has length 55 [2019-11-07 00:37:54,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:54,878 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 232 transitions. [2019-11-07 00:37:54,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:37:54,878 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 232 transitions. [2019-11-07 00:37:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 00:37:54,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:54,879 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-07 00:37:54,879 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:54,880 INFO L82 PathProgramCache]: Analyzing trace with hash -639520605, now seen corresponding path program 1 times [2019-11-07 00:37:54,880 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:54,880 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686780455] [2019-11-07 00:37:54,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:37:54,954 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-07 00:37:54,955 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686780455] [2019-11-07 00:37:54,955 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:37:54,955 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:37:54,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017476787] [2019-11-07 00:37:54,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:37:54,956 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:54,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:37:54,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:54,956 INFO L87 Difference]: Start difference. First operand 194 states and 232 transitions. Second operand 5 states. [2019-11-07 00:37:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:54,983 INFO L93 Difference]: Finished difference Result 230 states and 273 transitions. [2019-11-07 00:37:54,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:37:54,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-07 00:37:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:54,986 INFO L225 Difference]: With dead ends: 230 [2019-11-07 00:37:54,986 INFO L226 Difference]: Without dead ends: 188 [2019-11-07 00:37:54,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:37:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-07 00:37:54,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-11-07 00:37:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-07 00:37:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 223 transitions. [2019-11-07 00:37:55,001 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 223 transitions. Word has length 58 [2019-11-07 00:37:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:55,001 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 223 transitions. [2019-11-07 00:37:55,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:37:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 223 transitions. [2019-11-07 00:37:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 00:37:55,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:55,003 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-07 00:37:55,003 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:55,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:55,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1656625880, now seen corresponding path program 1 times [2019-11-07 00:37:55,004 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:55,004 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984490826] [2019-11-07 00:37:55,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-07 00:37:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-07 00:37:55,147 INFO L172 FreeRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-11-07 00:37:55,147 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-07 00:37:55,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:37:55 BoogieIcfgContainer [2019-11-07 00:37:55,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:37:55,296 INFO L168 Benchmark]: Toolchain (without parser) took 7847.73 ms. Allocated memory was 138.9 MB in the beginning and 316.1 MB in the end (delta: 177.2 MB). Free memory was 103.5 MB in the beginning and 137.8 MB in the end (delta: -34.3 MB). Peak memory consumption was 142.9 MB. Max. memory is 7.1 GB. [2019-11-07 00:37:55,297 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-07 00:37:55,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.27 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 103.3 MB in the beginning and 177.4 MB in the end (delta: -74.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:37:55,298 INFO L168 Benchmark]: Boogie Preprocessor took 68.28 ms. Allocated memory is still 204.5 MB. Free memory was 177.4 MB in the beginning and 173.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:37:55,299 INFO L168 Benchmark]: RCFGBuilder took 995.15 ms. Allocated memory is still 204.5 MB. Free memory was 173.9 MB in the beginning and 103.9 MB in the end (delta: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:37:55,303 INFO L168 Benchmark]: TraceAbstraction took 6177.55 ms. Allocated memory was 204.5 MB in the beginning and 316.1 MB in the end (delta: 111.7 MB). Free memory was 103.2 MB in the beginning and 137.8 MB in the end (delta: -34.6 MB). Peak memory consumption was 77.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:37:55,307 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.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 601.27 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 103.3 MB in the beginning and 177.4 MB in the end (delta: -74.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.28 ms. Allocated memory is still 204.5 MB. Free memory was 177.4 MB in the beginning and 173.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 995.15 ms. Allocated memory is still 204.5 MB. Free memory was 173.9 MB in the beginning and 103.9 MB in the end (delta: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6177.55 ms. Allocated memory was 204.5 MB in the beginning and 316.1 MB in the end (delta: 111.7 MB). Free memory was 103.2 MB in the beginning and 137.8 MB in the end (delta: -34.6 MB). Peak memory consumption was 77.1 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: 6.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4860 SDtfs, 2609 SDslu, 12029 SDs, 0 SdLazy, 2193 SolverSat, 388 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 258 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 962 NumberOfCodeBlocks, 962 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 887 ConstructedInterpolants, 0 QuantifiedInterpolants, 75649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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...