java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:18:19,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:18:19,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:18:19,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:18:19,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:18:19,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:18:19,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:18:19,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:18:19,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:18:19,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:18:19,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:18:19,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:18:19,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:18:19,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:18:19,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:18:19,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:18:19,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:18:19,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:18:19,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:18:19,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:18:19,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:18:19,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:18:19,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:18:19,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:18:19,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:18:19,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:18:19,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:18:19,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:18:19,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:18:19,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:18:19,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:18:19,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:18:19,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:18:19,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:18:19,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:18:19,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:18:19,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:18:19,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:18:19,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:18:19,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:18:19,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:18:19,837 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:18:19,850 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:18:19,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:18:19,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:18:19,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:18:19,852 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:18:19,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:18:19,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:18:19,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:18:19,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:18:19,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:18:19,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:18:19,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:18:19,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:18:19,854 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:18:19,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:18:19,854 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:18:19,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:18:19,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:18:19,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:18:19,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:18:19,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:18:19,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:18:19,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:18:19,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:18:19,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:18:19,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:18:19,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:18:19,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:18:19,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:18:20,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:18:20,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:18:20,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:18:20,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:18:20,187 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:18:20,188 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-10-14 23:18:20,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041e01236/4e45807ead164c04a8eefb6c2a31e83d/FLAG71723d1a6 [2019-10-14 23:18:20,729 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:18:20,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-10-14 23:18:20,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041e01236/4e45807ead164c04a8eefb6c2a31e83d/FLAG71723d1a6 [2019-10-14 23:18:21,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041e01236/4e45807ead164c04a8eefb6c2a31e83d [2019-10-14 23:18:21,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:18:21,071 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:18:21,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:18:21,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:18:21,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:18:21,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:18:21" (1/1) ... [2019-10-14 23:18:21,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6b071a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:21, skipping insertion in model container [2019-10-14 23:18:21,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:18:21" (1/1) ... [2019-10-14 23:18:21,093 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:18:21,138 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:18:21,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:18:21,539 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:18:21,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:18:21,628 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:18:21,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:21 WrapperNode [2019-10-14 23:18:21,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:18:21,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:18:21,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:18:21,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:18:21,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:21" (1/1) ... [2019-10-14 23:18:21,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:21" (1/1) ... [2019-10-14 23:18:21,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:21" (1/1) ... [2019-10-14 23:18:21,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:21" (1/1) ... [2019-10-14 23:18:21,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:21" (1/1) ... [2019-10-14 23:18:21,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:21" (1/1) ... [2019-10-14 23:18:21,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:21" (1/1) ... [2019-10-14 23:18:21,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:18:21,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:18:21,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:18:21,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:18:21,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:18:21,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:18:21,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:18:21,756 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-14 23:18:21,757 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-14 23:18:21,757 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-10-14 23:18:21,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:18:21,758 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-14 23:18:21,758 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-14 23:18:21,758 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-14 23:18:21,758 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-14 23:18:21,758 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-14 23:18:21,759 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-10-14 23:18:21,759 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-10-14 23:18:21,759 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-10-14 23:18:21,760 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-10-14 23:18:21,761 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-14 23:18:21,763 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-10-14 23:18:21,763 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-14 23:18:21,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:18:21,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:18:21,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:18:21,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:18:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:18:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-10-14 23:18:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-14 23:18:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-14 23:18:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-14 23:18:21,765 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-10-14 23:18:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-10-14 23:18:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-10-14 23:18:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-10-14 23:18:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-14 23:18:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-10-14 23:18:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-14 23:18:21,767 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-14 23:18:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-14 23:18:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-14 23:18:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:18:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-14 23:18:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:18:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:18:22,056 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:18:22,121 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-14 23:18:22,121 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-14 23:18:22,151 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:18:22,285 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-14 23:18:22,286 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-14 23:18:22,287 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:18:22,337 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-14 23:18:22,338 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-14 23:18:22,343 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:18:22,394 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-14 23:18:22,394 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-14 23:18:22,485 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:18:22,513 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-14 23:18:22,513 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-14 23:18:22,539 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:18:22,642 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-10-14 23:18:22,642 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-10-14 23:18:22,655 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:18:22,656 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:18:22,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:18:22 BoogieIcfgContainer [2019-10-14 23:18:22,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:18:22,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:18:22,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:18:22,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:18:22,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:18:21" (1/3) ... [2019-10-14 23:18:22,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18852dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:18:22, skipping insertion in model container [2019-10-14 23:18:22,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:18:21" (2/3) ... [2019-10-14 23:18:22,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18852dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:18:22, skipping insertion in model container [2019-10-14 23:18:22,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:18:22" (3/3) ... [2019-10-14 23:18:22,670 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2019-10-14 23:18:22,680 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:18:22,703 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:18:22,715 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:18:22,750 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:18:22,751 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:18:22,751 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:18:22,751 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:18:22,751 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:18:22,751 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:18:22,752 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:18:22,752 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:18:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states. [2019-10-14 23:18:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:18:22,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:22,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:22,788 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:22,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1129426977, now seen corresponding path program 1 times [2019-10-14 23:18:22,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:22,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196731870] [2019-10-14 23:18:22,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:22,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:22,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:23,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196731870] [2019-10-14 23:18:23,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:23,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:18:23,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996557103] [2019-10-14 23:18:23,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:18:23,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:23,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:18:23,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:18:23,272 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 5 states. [2019-10-14 23:18:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:24,293 INFO L93 Difference]: Finished difference Result 418 states and 629 transitions. [2019-10-14 23:18:24,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:18:24,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-14 23:18:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:24,313 INFO L225 Difference]: With dead ends: 418 [2019-10-14 23:18:24,313 INFO L226 Difference]: Without dead ends: 259 [2019-10-14 23:18:24,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:18:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-14 23:18:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 231. [2019-10-14 23:18:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-14 23:18:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2019-10-14 23:18:24,404 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 20 [2019-10-14 23:18:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:24,405 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2019-10-14 23:18:24,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:18:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2019-10-14 23:18:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:18:24,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:24,407 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:24,407 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:24,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:24,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1811427322, now seen corresponding path program 1 times [2019-10-14 23:18:24,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:24,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542749170] [2019-10-14 23:18:24,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:24,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:24,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:24,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542749170] [2019-10-14 23:18:24,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:24,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:18:24,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613406786] [2019-10-14 23:18:24,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:18:24,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:24,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:18:24,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:18:24,760 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 6 states. [2019-10-14 23:18:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:25,942 INFO L93 Difference]: Finished difference Result 410 states and 565 transitions. [2019-10-14 23:18:25,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:18:25,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-14 23:18:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:25,947 INFO L225 Difference]: With dead ends: 410 [2019-10-14 23:18:25,947 INFO L226 Difference]: Without dead ends: 349 [2019-10-14 23:18:25,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:18:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-14 23:18:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 304. [2019-10-14 23:18:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-14 23:18:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 415 transitions. [2019-10-14 23:18:25,989 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 415 transitions. Word has length 28 [2019-10-14 23:18:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:25,990 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 415 transitions. [2019-10-14 23:18:25,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:18:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 415 transitions. [2019-10-14 23:18:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:18:25,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:25,992 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:25,992 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash 439620198, now seen corresponding path program 1 times [2019-10-14 23:18:25,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:25,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005676770] [2019-10-14 23:18:25,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:25,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:25,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:26,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005676770] [2019-10-14 23:18:26,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:26,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:18:26,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373936477] [2019-10-14 23:18:26,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:18:26,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:26,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:18:26,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:18:26,207 INFO L87 Difference]: Start difference. First operand 304 states and 415 transitions. Second operand 6 states. [2019-10-14 23:18:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:26,965 INFO L93 Difference]: Finished difference Result 487 states and 647 transitions. [2019-10-14 23:18:26,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:18:26,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-14 23:18:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:26,972 INFO L225 Difference]: With dead ends: 487 [2019-10-14 23:18:26,972 INFO L226 Difference]: Without dead ends: 368 [2019-10-14 23:18:26,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:18:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-10-14 23:18:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 344. [2019-10-14 23:18:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-10-14 23:18:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 466 transitions. [2019-10-14 23:18:27,032 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 466 transitions. Word has length 28 [2019-10-14 23:18:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:27,033 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 466 transitions. [2019-10-14 23:18:27,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:18:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 466 transitions. [2019-10-14 23:18:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:18:27,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:27,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:27,036 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:27,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1607848921, now seen corresponding path program 1 times [2019-10-14 23:18:27,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:27,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19613810] [2019-10-14 23:18:27,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:27,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:27,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:27,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19613810] [2019-10-14 23:18:27,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:27,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:18:27,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018750259] [2019-10-14 23:18:27,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:18:27,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:27,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:18:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:18:27,193 INFO L87 Difference]: Start difference. First operand 344 states and 466 transitions. Second operand 6 states. [2019-10-14 23:18:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:27,998 INFO L93 Difference]: Finished difference Result 347 states and 468 transitions. [2019-10-14 23:18:27,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:18:27,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-10-14 23:18:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:28,001 INFO L225 Difference]: With dead ends: 347 [2019-10-14 23:18:28,001 INFO L226 Difference]: Without dead ends: 343 [2019-10-14 23:18:28,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:18:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-14 23:18:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-10-14 23:18:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-14 23:18:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2019-10-14 23:18:28,027 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 38 [2019-10-14 23:18:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:28,028 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2019-10-14 23:18:28,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:18:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2019-10-14 23:18:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:18:28,031 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:28,031 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:28,032 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1742109340, now seen corresponding path program 1 times [2019-10-14 23:18:28,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:28,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052297066] [2019-10-14 23:18:28,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:28,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:28,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:28,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052297066] [2019-10-14 23:18:28,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:28,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:18:28,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754103193] [2019-10-14 23:18:28,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:18:28,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:28,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:18:28,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:18:28,214 INFO L87 Difference]: Start difference. First operand 343 states and 463 transitions. Second operand 8 states. [2019-10-14 23:18:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:29,354 INFO L93 Difference]: Finished difference Result 394 states and 520 transitions. [2019-10-14 23:18:29,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:18:29,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-14 23:18:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:29,359 INFO L225 Difference]: With dead ends: 394 [2019-10-14 23:18:29,359 INFO L226 Difference]: Without dead ends: 325 [2019-10-14 23:18:29,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:18:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-14 23:18:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 304. [2019-10-14 23:18:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-14 23:18:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 406 transitions. [2019-10-14 23:18:29,382 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 406 transitions. Word has length 46 [2019-10-14 23:18:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:29,382 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 406 transitions. [2019-10-14 23:18:29,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:18:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 406 transitions. [2019-10-14 23:18:29,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-14 23:18:29,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:29,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:29,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:29,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:29,385 INFO L82 PathProgramCache]: Analyzing trace with hash 750041855, now seen corresponding path program 1 times [2019-10-14 23:18:29,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:29,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532331172] [2019-10-14 23:18:29,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:29,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:29,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:29,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532331172] [2019-10-14 23:18:29,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:29,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:18:29,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737347220] [2019-10-14 23:18:29,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:18:29,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:29,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:18:29,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:18:29,588 INFO L87 Difference]: Start difference. First operand 304 states and 406 transitions. Second operand 8 states. [2019-10-14 23:18:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:30,049 INFO L93 Difference]: Finished difference Result 316 states and 421 transitions. [2019-10-14 23:18:30,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:18:30,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-10-14 23:18:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:30,053 INFO L225 Difference]: With dead ends: 316 [2019-10-14 23:18:30,053 INFO L226 Difference]: Without dead ends: 300 [2019-10-14 23:18:30,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:18:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-14 23:18:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 270. [2019-10-14 23:18:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-10-14 23:18:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 364 transitions. [2019-10-14 23:18:30,075 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 364 transitions. Word has length 45 [2019-10-14 23:18:30,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:30,075 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 364 transitions. [2019-10-14 23:18:30,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:18:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2019-10-14 23:18:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:18:30,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:30,077 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:30,077 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:30,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:30,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1784783245, now seen corresponding path program 1 times [2019-10-14 23:18:30,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:30,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602788675] [2019-10-14 23:18:30,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:30,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:30,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:30,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602788675] [2019-10-14 23:18:30,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:30,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:18:30,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710708986] [2019-10-14 23:18:30,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:18:30,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:30,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:18:30,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:18:30,277 INFO L87 Difference]: Start difference. First operand 270 states and 364 transitions. Second operand 8 states. [2019-10-14 23:18:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:31,150 INFO L93 Difference]: Finished difference Result 290 states and 385 transitions. [2019-10-14 23:18:31,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:18:31,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-14 23:18:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:31,153 INFO L225 Difference]: With dead ends: 290 [2019-10-14 23:18:31,153 INFO L226 Difference]: Without dead ends: 242 [2019-10-14 23:18:31,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:18:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-14 23:18:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-10-14 23:18:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-14 23:18:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2019-10-14 23:18:31,173 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 46 [2019-10-14 23:18:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:31,173 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2019-10-14 23:18:31,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:18:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2019-10-14 23:18:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-14 23:18:31,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:31,175 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:31,175 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:31,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:31,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1852297644, now seen corresponding path program 1 times [2019-10-14 23:18:31,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:31,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564562039] [2019-10-14 23:18:31,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:31,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:31,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:31,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564562039] [2019-10-14 23:18:31,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:31,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:18:31,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137852466] [2019-10-14 23:18:31,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:18:31,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:18:31,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:18:31,389 INFO L87 Difference]: Start difference. First operand 242 states and 321 transitions. Second operand 8 states. [2019-10-14 23:18:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:32,074 INFO L93 Difference]: Finished difference Result 270 states and 354 transitions. [2019-10-14 23:18:32,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:18:32,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-14 23:18:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:32,076 INFO L225 Difference]: With dead ends: 270 [2019-10-14 23:18:32,077 INFO L226 Difference]: Without dead ends: 240 [2019-10-14 23:18:32,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:18:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-14 23:18:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-10-14 23:18:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-14 23:18:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2019-10-14 23:18:32,094 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 53 [2019-10-14 23:18:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:32,094 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2019-10-14 23:18:32,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:18:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2019-10-14 23:18:32,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 23:18:32,095 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:32,096 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:32,096 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:32,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:32,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1745163498, now seen corresponding path program 1 times [2019-10-14 23:18:32,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:32,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730810276] [2019-10-14 23:18:32,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:32,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:32,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:32,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730810276] [2019-10-14 23:18:32,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:32,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-14 23:18:32,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472464294] [2019-10-14 23:18:32,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:18:32,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:32,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:18:32,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:18:32,311 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand 12 states. [2019-10-14 23:18:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:33,624 INFO L93 Difference]: Finished difference Result 252 states and 329 transitions. [2019-10-14 23:18:33,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:18:33,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-10-14 23:18:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:33,627 INFO L225 Difference]: With dead ends: 252 [2019-10-14 23:18:33,627 INFO L226 Difference]: Without dead ends: 211 [2019-10-14 23:18:33,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:18:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-14 23:18:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-10-14 23:18:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-14 23:18:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 277 transitions. [2019-10-14 23:18:33,642 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 277 transitions. Word has length 51 [2019-10-14 23:18:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:33,642 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 277 transitions. [2019-10-14 23:18:33,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:18:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 277 transitions. [2019-10-14 23:18:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-14 23:18:33,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:33,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:33,644 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:33,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:33,645 INFO L82 PathProgramCache]: Analyzing trace with hash 143486070, now seen corresponding path program 1 times [2019-10-14 23:18:33,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:33,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685151996] [2019-10-14 23:18:33,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:33,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:33,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:33,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685151996] [2019-10-14 23:18:33,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:33,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-14 23:18:33,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576819618] [2019-10-14 23:18:33,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:18:33,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:33,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:18:33,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:18:33,876 INFO L87 Difference]: Start difference. First operand 211 states and 277 transitions. Second operand 14 states. [2019-10-14 23:18:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:35,074 INFO L93 Difference]: Finished difference Result 227 states and 293 transitions. [2019-10-14 23:18:35,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:18:35,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-10-14 23:18:35,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:35,076 INFO L225 Difference]: With dead ends: 227 [2019-10-14 23:18:35,077 INFO L226 Difference]: Without dead ends: 206 [2019-10-14 23:18:35,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:18:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-14 23:18:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-10-14 23:18:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-14 23:18:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 270 transitions. [2019-10-14 23:18:35,117 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 270 transitions. Word has length 52 [2019-10-14 23:18:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:35,118 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 270 transitions. [2019-10-14 23:18:35,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:18:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2019-10-14 23:18:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-14 23:18:35,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:35,122 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:35,122 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1278878233, now seen corresponding path program 1 times [2019-10-14 23:18:35,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:35,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187777973] [2019-10-14 23:18:35,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:35,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:35,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:35,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187777973] [2019-10-14 23:18:35,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:35,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:18:35,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409625042] [2019-10-14 23:18:35,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:18:35,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:35,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:18:35,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:18:35,326 INFO L87 Difference]: Start difference. First operand 206 states and 270 transitions. Second operand 8 states. [2019-10-14 23:18:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:36,010 INFO L93 Difference]: Finished difference Result 246 states and 315 transitions. [2019-10-14 23:18:36,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:18:36,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-10-14 23:18:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:36,013 INFO L225 Difference]: With dead ends: 246 [2019-10-14 23:18:36,014 INFO L226 Difference]: Without dead ends: 205 [2019-10-14 23:18:36,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:18:36,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-14 23:18:36,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-10-14 23:18:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-14 23:18:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 265 transitions. [2019-10-14 23:18:36,029 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 265 transitions. Word has length 58 [2019-10-14 23:18:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:36,029 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-10-14 23:18:36,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:18:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 265 transitions. [2019-10-14 23:18:36,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-14 23:18:36,031 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:36,031 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:36,031 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:36,032 INFO L82 PathProgramCache]: Analyzing trace with hash 85703434, now seen corresponding path program 1 times [2019-10-14 23:18:36,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:36,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107999987] [2019-10-14 23:18:36,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:36,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:36,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:36,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107999987] [2019-10-14 23:18:36,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:36,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-14 23:18:36,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269589916] [2019-10-14 23:18:36,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 23:18:36,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 23:18:36,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:18:36,324 INFO L87 Difference]: Start difference. First operand 205 states and 265 transitions. Second operand 15 states. [2019-10-14 23:18:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:37,376 INFO L93 Difference]: Finished difference Result 217 states and 277 transitions. [2019-10-14 23:18:37,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:18:37,376 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-10-14 23:18:37,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:37,378 INFO L225 Difference]: With dead ends: 217 [2019-10-14 23:18:37,379 INFO L226 Difference]: Without dead ends: 179 [2019-10-14 23:18:37,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:18:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-14 23:18:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-10-14 23:18:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-14 23:18:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 227 transitions. [2019-10-14 23:18:37,392 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 227 transitions. Word has length 59 [2019-10-14 23:18:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:37,392 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 227 transitions. [2019-10-14 23:18:37,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 23:18:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 227 transitions. [2019-10-14 23:18:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-14 23:18:37,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:37,394 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:37,394 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:37,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:37,394 INFO L82 PathProgramCache]: Analyzing trace with hash -429340253, now seen corresponding path program 1 times [2019-10-14 23:18:37,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:37,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259187665] [2019-10-14 23:18:37,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:37,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:37,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:37,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259187665] [2019-10-14 23:18:37,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:37,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-14 23:18:37,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591030831] [2019-10-14 23:18:37,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 23:18:37,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:37,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 23:18:37,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:18:37,670 INFO L87 Difference]: Start difference. First operand 179 states and 227 transitions. Second operand 15 states. [2019-10-14 23:18:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:38,596 INFO L93 Difference]: Finished difference Result 191 states and 239 transitions. [2019-10-14 23:18:38,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:18:38,597 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-10-14 23:18:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:38,598 INFO L225 Difference]: With dead ends: 191 [2019-10-14 23:18:38,598 INFO L226 Difference]: Without dead ends: 177 [2019-10-14 23:18:38,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:18:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-14 23:18:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-10-14 23:18:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-14 23:18:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2019-10-14 23:18:38,611 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 55 [2019-10-14 23:18:38,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:38,612 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2019-10-14 23:18:38,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 23:18:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2019-10-14 23:18:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-14 23:18:38,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:38,613 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:38,614 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1933570889, now seen corresponding path program 1 times [2019-10-14 23:18:38,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:38,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163787491] [2019-10-14 23:18:38,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:38,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:38,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:39,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163787491] [2019-10-14 23:18:39,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:39,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-14 23:18:39,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051240335] [2019-10-14 23:18:39,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 23:18:39,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:39,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 23:18:39,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:18:39,039 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand 15 states. [2019-10-14 23:18:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:39,890 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2019-10-14 23:18:39,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:18:39,890 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-10-14 23:18:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:39,892 INFO L225 Difference]: With dead ends: 189 [2019-10-14 23:18:39,892 INFO L226 Difference]: Without dead ends: 158 [2019-10-14 23:18:39,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:18:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-14 23:18:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-10-14 23:18:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-14 23:18:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2019-10-14 23:18:39,904 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 54 [2019-10-14 23:18:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:39,905 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2019-10-14 23:18:39,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 23:18:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2019-10-14 23:18:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-14 23:18:39,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:39,906 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:39,906 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:39,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:39,907 INFO L82 PathProgramCache]: Analyzing trace with hash -309007876, now seen corresponding path program 1 times [2019-10-14 23:18:39,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:39,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73149078] [2019-10-14 23:18:39,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:39,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:39,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:40,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73149078] [2019-10-14 23:18:40,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:40,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-14 23:18:40,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024645323] [2019-10-14 23:18:40,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 23:18:40,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:40,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 23:18:40,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:18:40,201 INFO L87 Difference]: Start difference. First operand 158 states and 199 transitions. Second operand 13 states. [2019-10-14 23:18:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:41,235 INFO L93 Difference]: Finished difference Result 284 states and 346 transitions. [2019-10-14 23:18:41,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:18:41,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-10-14 23:18:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:41,238 INFO L225 Difference]: With dead ends: 284 [2019-10-14 23:18:41,238 INFO L226 Difference]: Without dead ends: 223 [2019-10-14 23:18:41,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:18:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-10-14 23:18:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 168. [2019-10-14 23:18:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-14 23:18:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2019-10-14 23:18:41,251 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 53 [2019-10-14 23:18:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:41,251 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2019-10-14 23:18:41,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 23:18:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2019-10-14 23:18:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-14 23:18:41,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:41,252 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:41,253 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:41,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:41,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1433722057, now seen corresponding path program 1 times [2019-10-14 23:18:41,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:41,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407672304] [2019-10-14 23:18:41,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:41,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:41,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:41,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407672304] [2019-10-14 23:18:41,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:41,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-14 23:18:41,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334793136] [2019-10-14 23:18:41,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:18:41,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:41,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:18:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:18:41,515 INFO L87 Difference]: Start difference. First operand 168 states and 212 transitions. Second operand 14 states. [2019-10-14 23:18:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:42,166 INFO L93 Difference]: Finished difference Result 184 states and 228 transitions. [2019-10-14 23:18:42,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:18:42,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-10-14 23:18:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:42,168 INFO L225 Difference]: With dead ends: 184 [2019-10-14 23:18:42,168 INFO L226 Difference]: Without dead ends: 138 [2019-10-14 23:18:42,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:18:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-14 23:18:42,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-10-14 23:18:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-14 23:18:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2019-10-14 23:18:42,178 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 53 [2019-10-14 23:18:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:42,178 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2019-10-14 23:18:42,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:18:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2019-10-14 23:18:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-14 23:18:42,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:42,179 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:42,180 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1317699651, now seen corresponding path program 1 times [2019-10-14 23:18:42,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:42,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188799424] [2019-10-14 23:18:42,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:42,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:42,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:42,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188799424] [2019-10-14 23:18:42,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:42,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-14 23:18:42,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312430254] [2019-10-14 23:18:42,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 23:18:42,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:42,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 23:18:42,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:18:42,520 INFO L87 Difference]: Start difference. First operand 138 states and 159 transitions. Second operand 15 states. [2019-10-14 23:18:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:43,923 INFO L93 Difference]: Finished difference Result 196 states and 220 transitions. [2019-10-14 23:18:43,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:18:43,924 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-10-14 23:18:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:43,925 INFO L225 Difference]: With dead ends: 196 [2019-10-14 23:18:43,926 INFO L226 Difference]: Without dead ends: 190 [2019-10-14 23:18:43,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-10-14 23:18:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-14 23:18:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 151. [2019-10-14 23:18:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-14 23:18:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2019-10-14 23:18:43,940 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 54 [2019-10-14 23:18:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:43,940 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2019-10-14 23:18:43,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 23:18:43,940 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2019-10-14 23:18:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-14 23:18:43,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:43,941 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:43,941 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1204113239, now seen corresponding path program 1 times [2019-10-14 23:18:43,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:43,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223526653] [2019-10-14 23:18:43,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:43,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:43,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:44,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223526653] [2019-10-14 23:18:44,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:44,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 23:18:44,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484995178] [2019-10-14 23:18:44,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:18:44,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:44,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:18:44,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:18:44,158 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand 11 states. [2019-10-14 23:18:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:44,584 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2019-10-14 23:18:44,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:18:44,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-10-14 23:18:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:44,586 INFO L225 Difference]: With dead ends: 195 [2019-10-14 23:18:44,586 INFO L226 Difference]: Without dead ends: 159 [2019-10-14 23:18:44,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:18:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-14 23:18:44,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2019-10-14 23:18:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-14 23:18:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions. [2019-10-14 23:18:44,600 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 173 transitions. Word has length 57 [2019-10-14 23:18:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:44,601 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 173 transitions. [2019-10-14 23:18:44,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:18:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 173 transitions. [2019-10-14 23:18:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-14 23:18:44,602 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:44,602 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:44,602 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:44,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:44,602 INFO L82 PathProgramCache]: Analyzing trace with hash -527681510, now seen corresponding path program 1 times [2019-10-14 23:18:44,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:44,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182675781] [2019-10-14 23:18:44,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:44,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:44,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:44,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182675781] [2019-10-14 23:18:44,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:44,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-14 23:18:44,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453862724] [2019-10-14 23:18:44,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:18:44,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:44,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:18:44,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:18:44,804 INFO L87 Difference]: Start difference. First operand 153 states and 173 transitions. Second operand 11 states. [2019-10-14 23:18:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:45,419 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2019-10-14 23:18:45,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:18:45,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-10-14 23:18:45,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:45,421 INFO L225 Difference]: With dead ends: 164 [2019-10-14 23:18:45,421 INFO L226 Difference]: Without dead ends: 157 [2019-10-14 23:18:45,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:18:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-14 23:18:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2019-10-14 23:18:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-14 23:18:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2019-10-14 23:18:45,435 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 57 [2019-10-14 23:18:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:45,435 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2019-10-14 23:18:45,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:18:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2019-10-14 23:18:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-14 23:18:45,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:45,436 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:45,437 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:45,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:45,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1222442102, now seen corresponding path program 1 times [2019-10-14 23:18:45,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:45,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577808721] [2019-10-14 23:18:45,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:45,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:45,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:45,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577808721] [2019-10-14 23:18:45,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:45,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-14 23:18:45,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335901709] [2019-10-14 23:18:45,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:18:45,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:45,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:18:45,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:18:45,702 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand 14 states. [2019-10-14 23:18:46,003 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-10-14 23:18:46,177 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-14 23:18:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:46,965 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2019-10-14 23:18:46,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:18:46,966 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-10-14 23:18:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:46,967 INFO L225 Difference]: With dead ends: 186 [2019-10-14 23:18:46,968 INFO L226 Difference]: Without dead ends: 166 [2019-10-14 23:18:46,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2019-10-14 23:18:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-14 23:18:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 141. [2019-10-14 23:18:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-14 23:18:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2019-10-14 23:18:46,979 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 55 [2019-10-14 23:18:46,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:46,979 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2019-10-14 23:18:46,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:18:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2019-10-14 23:18:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-14 23:18:46,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:46,980 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:46,980 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:46,981 INFO L82 PathProgramCache]: Analyzing trace with hash -639520605, now seen corresponding path program 1 times [2019-10-14 23:18:46,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:46,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358662905] [2019-10-14 23:18:46,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:46,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:46,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:18:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:18:47,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358662905] [2019-10-14 23:18:47,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:18:47,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:18:47,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769421706] [2019-10-14 23:18:47,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:18:47,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:18:47,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:18:47,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:18:47,197 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand 10 states. [2019-10-14 23:18:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:18:47,478 INFO L93 Difference]: Finished difference Result 177 states and 201 transitions. [2019-10-14 23:18:47,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:18:47,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-10-14 23:18:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:18:47,479 INFO L225 Difference]: With dead ends: 177 [2019-10-14 23:18:47,479 INFO L226 Difference]: Without dead ends: 135 [2019-10-14 23:18:47,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:18:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-14 23:18:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-10-14 23:18:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-14 23:18:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2019-10-14 23:18:47,496 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 58 [2019-10-14 23:18:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:18:47,496 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2019-10-14 23:18:47,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:18:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2019-10-14 23:18:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-14 23:18:47,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:18:47,497 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:18:47,497 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:18:47,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:18:47,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1656625880, now seen corresponding path program 1 times [2019-10-14 23:18:47,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:18:47,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651151050] [2019-10-14 23:18:47,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:47,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:18:47,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:18:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-14 23:18:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-14 23:18:47,604 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-14 23:18:47,604 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-14 23:18:47,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:18:47 BoogieIcfgContainer [2019-10-14 23:18:47,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:18:47,743 INFO L168 Benchmark]: Toolchain (without parser) took 26671.93 ms. Allocated memory was 137.9 MB in the beginning and 501.2 MB in the end (delta: 363.3 MB). Free memory was 101.9 MB in the beginning and 424.2 MB in the end (delta: -322.3 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:18:47,744 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 137.9 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-14 23:18:47,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 557.17 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 101.5 MB in the beginning and 173.4 MB in the end (delta: -72.0 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:18:47,745 INFO L168 Benchmark]: Boogie Preprocessor took 71.68 ms. Allocated memory is still 200.8 MB. Free memory was 173.4 MB in the beginning and 169.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:18:47,746 INFO L168 Benchmark]: RCFGBuilder took 956.04 ms. Allocated memory is still 200.8 MB. Free memory was 169.4 MB in the beginning and 99.5 MB in the end (delta: 69.9 MB). Peak memory consumption was 69.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:18:47,746 INFO L168 Benchmark]: TraceAbstraction took 25081.01 ms. Allocated memory was 200.8 MB in the beginning and 501.2 MB in the end (delta: 300.4 MB). Free memory was 99.5 MB in the beginning and 424.2 MB in the end (delta: -324.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-14 23:18:47,749 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.37 ms. Allocated memory is still 137.9 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 557.17 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 101.5 MB in the beginning and 173.4 MB in the end (delta: -72.0 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.68 ms. Allocated memory is still 200.8 MB. Free memory was 173.4 MB in the beginning and 169.4 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 956.04 ms. Allocated memory is still 200.8 MB. Free memory was 169.4 MB in the beginning and 99.5 MB in the end (delta: 69.9 MB). Peak memory consumption was 69.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25081.01 ms. Allocated memory was 200.8 MB in the beginning and 501.2 MB in the end (delta: 300.4 MB). Free memory was 99.5 MB in the beginning and 424.2 MB in the end (delta: -324.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1012]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] int KernelMode ; [L23] int Executive ; [L24] int DevicePowerState ; [L25] int s ; [L26] int UNLOADED ; [L27] int NP ; [L28] int DC ; [L29] int SKIP1 ; [L30] int SKIP2 ; [L31] int MPR1 ; [L32] int MPR3 ; [L33] int IPC ; [L34] int pended ; [L35] int compFptr ; [L36] int compRegistered ; [L37] int lowerDriverReturn ; [L38] int setEventCalled ; [L39] int customIrp ; [L40] int myStatus ; VAL [\old(compFptr)=19, \old(compRegistered)=11, \old(customIrp)=14, \old(DC)=7, \old(DevicePowerState)=20, \old(Executive)=12, \old(IPC)=8, \old(KernelMode)=24, \old(lowerDriverReturn)=22, \old(MPR1)=18, \old(MPR3)=16, \old(myStatus)=21, \old(NP)=13, \old(pended)=23, \old(s)=9, \old(setEventCalled)=17, \old(SKIP1)=15, \old(SKIP2)=10, \old(UNLOADED)=6, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L293] int status ; [L294] int irp = __VERIFIER_nondet_int() ; [L295] int pirp ; [L296] int pirp__IoStatus__Status ; [L297] int irp_choice = __VERIFIER_nondet_int() ; [L298] int devobj = __VERIFIER_nondet_int() ; [L299] int __cil_tmp8 ; [L301] KernelMode = 0 [L302] Executive = 0 [L303] DevicePowerState = 1 [L304] s = 0 [L305] UNLOADED = 0 [L306] NP = 0 [L307] DC = 0 [L308] SKIP1 = 0 [L309] SKIP2 = 0 [L310] MPR1 = 0 [L311] MPR3 = 0 [L312] IPC = 0 [L313] pended = 0 [L314] compFptr = 0 [L315] compRegistered = 0 [L316] lowerDriverReturn = 0 [L317] setEventCalled = 0 [L318] customIrp = 0 [L319] myStatus = 0 [L323] status = 0 [L324] pirp = irp VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=1, devobj=0, Executive=0, IPC=0, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, status=0, UNLOADED=0] [L325] CALL _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=1, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L60] UNLOADED = 0 [L61] NP = 1 [L62] DC = 2 [L63] SKIP1 = 3 [L64] SKIP2 = 4 [L65] MPR1 = 5 [L66] MPR3 = 6 [L67] IPC = 7 [L68] s = UNLOADED [L69] pended = 0 [L70] compFptr = 0 [L71] compRegistered = 0 [L72] lowerDriverReturn = 0 [L73] setEventCalled = 0 [L74] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L325] RET _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L327] COND TRUE status >= 0 [L328] s = NP [L329] customIrp = 0 [L330] setEventCalled = customIrp [L331] lowerDriverReturn = setEventCalled [L332] compRegistered = lowerDriverReturn [L333] pended = compRegistered [L334] pirp__IoStatus__Status = 0 [L335] myStatus = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L336] COND FALSE !(irp_choice == 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L341] CALL stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L46] s = NP [L47] pended = 0 [L48] compFptr = 0 [L49] compRegistered = 0 [L50] lowerDriverReturn = 0 [L51] setEventCalled = 0 [L52] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L341] RET stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L344] COND FALSE !(status < 0) [L348] int tmp_ndt_1; [L349] tmp_ndt_1 = __VERIFIER_nondet_int() [L350] COND FALSE !(tmp_ndt_1 == 0) [L353] int tmp_ndt_2; [L354] tmp_ndt_2 = __VERIFIER_nondet_int() [L355] COND FALSE !(tmp_ndt_2 == 1) [L358] int tmp_ndt_3; [L359] tmp_ndt_3 = __VERIFIER_nondet_int() [L360] COND TRUE tmp_ndt_3 == 3 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L387] CALL, EXPR KbFilter_PnP(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L79] int devExt ; [L80] int irpStack ; [L81] int status ; [L82] int event = __VERIFIER_nondet_int() ; [L83] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L84] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L85] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L86] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L87] int devExt__Started ; [L88] int devExt__Removed ; [L89] int devExt__SurpriseRemoved ; [L90] int Irp__IoStatus__Status ; [L91] int Irp__IoStatus__Information ; [L92] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L93] int irpSp ; [L94] int nextIrpSp ; [L95] int nextIrpSp__Control ; [L96] int irpSp___0 ; [L97] int irpSp__Context ; [L98] int irpSp__Control ; [L99] long __cil_tmp23 ; [L102] status = 0 [L103] devExt = DeviceObject__DeviceExtension [L104] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L105] COND FALSE !(irpStack__MinorFunction == 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L108] COND FALSE !(irpStack__MinorFunction == 23) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L111] COND TRUE irpStack__MinorFunction == 2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L235] devExt__Removed = 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L236] COND TRUE s == NP [L237] s = SKIP1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L244] Irp__CurrentLocation ++ [L245] Irp__Tail__Overlay__CurrentStackLocation ++ VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L246] CALL IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L482] int returnVal2 ; [L483] int compRetStatus ; [L484] int lcontext = __VERIFIER_nondet_int() ; [L485] long long __cil_tmp7 ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L488] COND FALSE !(\read(compRegistered)) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L501] int tmp_ndt_6; [L502] tmp_ndt_6 = __VERIFIER_nondet_int() [L503] COND FALSE !(tmp_ndt_6 == 0) [L506] int tmp_ndt_7; [L507] tmp_ndt_7 = __VERIFIER_nondet_int() [L508] COND TRUE tmp_ndt_7 == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L517] returnVal2 = -1073741823 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L527] COND FALSE !(s == NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L531] COND FALSE !(s == MPR1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L540] COND TRUE s == SKIP1 [L541] s = SKIP2 [L542] lowerDriverReturn = returnVal2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L550] return (returnVal2); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, \result=-1073741823, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L246] RET IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IofCallDriver(devExt__TopOfStack, Irp)=-1073741823, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L247] status = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L289] return (status); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, \result=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L387] RET, EXPR KbFilter_PnP(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KbFilter_PnP(devobj, pirp)=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L387] status = KbFilter_PnP(devobj, pirp) [L411] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L419] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L427] COND TRUE s != UNLOADED VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L428] COND TRUE status != -1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L429] COND FALSE !(s != SKIP2) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L439] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L446] COND FALSE !(s == DC) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L451] COND TRUE status != lowerDriverReturn VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L452] CALL errorFn() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1012] __VERIFIER_error() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 240 locations, 1 error locations. Result: UNSAFE, OverallTime: 24.9s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4244 SDtfs, 5244 SDslu, 7794 SDs, 0 SdLazy, 15076 SolverSat, 1163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 177 SyntacticMatches, 6 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 276 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1076 NumberOfCodeBlocks, 1076 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 999 ConstructedInterpolants, 0 QuantifiedInterpolants, 229147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...