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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:50:08,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:50:08,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:50:08,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:50:08,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:50:08,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:50:08,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:50:08,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:50:08,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:50:08,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:50:08,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:50:08,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:50:08,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:50:08,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:50:08,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:50:08,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:50:08,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:50:08,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:50:08,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:50:08,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:50:08,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:50:08,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:50:08,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:50:08,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:50:08,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:50:08,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:50:08,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:50:08,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:50:08,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:50:08,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:50:08,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:50:08,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:50:08,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:50:08,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:50:08,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:50:08,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:50:08,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:50:08,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:50:08,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:50:08,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:50:08,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:50:08,772 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-07 13:50:08,786 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:50:08,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:50:08,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:50:08,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:50:08,788 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:50:08,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:50:08,788 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:50:08,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:50:08,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:50:08,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:50:08,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:50:08,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:50:08,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:50:08,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:50:08,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:50:08,790 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:50:08,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:50:08,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:50:08,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:50:08,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:50:08,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:50:08,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:50:08,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:50:08,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:50:08,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:50:08,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:50:08,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:50:08,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:50:08,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:50:09,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:50:09,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:50:09,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:50:09,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:50:09,102 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:50:09,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-10-07 13:50:09,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/234e34c52/d0c9795d74164b77b41f3799982cc25c/FLAG67bf66101 [2019-10-07 13:50:09,703 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:50:09,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-10-07 13:50:09,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/234e34c52/d0c9795d74164b77b41f3799982cc25c/FLAG67bf66101 [2019-10-07 13:50:10,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/234e34c52/d0c9795d74164b77b41f3799982cc25c [2019-10-07 13:50:10,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:50:10,019 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:50:10,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:50:10,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:50:10,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:50:10,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:50:10" (1/1) ... [2019-10-07 13:50:10,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:10, skipping insertion in model container [2019-10-07 13:50:10,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:50:10" (1/1) ... [2019-10-07 13:50:10,037 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:50:10,094 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:50:10,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:50:10,538 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:50:10,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:50:10,649 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:50:10,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:10 WrapperNode [2019-10-07 13:50:10,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:50:10,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:50:10,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:50:10,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:50:10,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:10" (1/1) ... [2019-10-07 13:50:10,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:10" (1/1) ... [2019-10-07 13:50:10,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:10" (1/1) ... [2019-10-07 13:50:10,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:10" (1/1) ... [2019-10-07 13:50:10,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:10" (1/1) ... [2019-10-07 13:50:10,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:10" (1/1) ... [2019-10-07 13:50:10,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:10" (1/1) ... [2019-10-07 13:50:10,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:50:10,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:50:10,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:50:10,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:50:10,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:10" (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-07 13:50:10,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:50:10,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:50:10,785 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-07 13:50:10,785 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-07 13:50:10,785 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-10-07 13:50:10,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:50:10,786 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-07 13:50:10,786 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-07 13:50:10,786 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-07 13:50:10,786 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-07 13:50:10,786 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-07 13:50:10,787 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-10-07 13:50:10,787 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-10-07 13:50:10,787 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-10-07 13:50:10,787 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-10-07 13:50:10,787 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-07 13:50:10,787 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-10-07 13:50:10,787 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-07 13:50:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:50:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 13:50:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:50:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-07 13:50:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 13:50:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-07 13:50:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-10-07 13:50:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-07 13:50:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-07 13:50:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-07 13:50:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-10-07 13:50:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-10-07 13:50:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-10-07 13:50:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-10-07 13:50:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-10-07 13:50:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-07 13:50:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-07 13:50:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-07 13:50:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-07 13:50:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:50:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-07 13:50:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:50:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:50:11,095 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:11,198 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-07 13:50:11,199 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-07 13:50:11,226 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:11,355 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-07 13:50:11,356 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-07 13:50:11,357 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:11,415 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-07 13:50:11,415 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-07 13:50:11,429 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:11,471 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-07 13:50:11,471 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-07 13:50:11,558 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:11,600 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-07 13:50:11,600 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-07 13:50:11,628 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:11,743 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-10-07 13:50:11,744 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-10-07 13:50:12,204 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:50:12,204 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-07 13:50:12,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:50:12 BoogieIcfgContainer [2019-10-07 13:50:12,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:50:12,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:50:12,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:50:12,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:50:12,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:50:10" (1/3) ... [2019-10-07 13:50:12,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422789db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:50:12, skipping insertion in model container [2019-10-07 13:50:12,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:10" (2/3) ... [2019-10-07 13:50:12,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@422789db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:50:12, skipping insertion in model container [2019-10-07 13:50:12,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:50:12" (3/3) ... [2019-10-07 13:50:12,218 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-10-07 13:50:12,228 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:50:12,250 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:50:12,261 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:50:12,287 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:50:12,287 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:50:12,287 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:50:12,287 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:50:12,287 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:50:12,288 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:50:12,288 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:50:12,288 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:50:12,309 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states. [2019-10-07 13:50:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:50:12,315 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:12,316 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:50:12,317 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:12,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1263961662, now seen corresponding path program 1 times [2019-10-07 13:50:12,328 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:12,328 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:12,329 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:12,329 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:12,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:12,606 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-07 13:50:12,607 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:12,608 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:12,608 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:50:12,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:50:12,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:50:12,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:12,631 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 3 states. [2019-10-07 13:50:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:12,745 INFO L93 Difference]: Finished difference Result 291 states and 428 transitions. [2019-10-07 13:50:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:50:12,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-07 13:50:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:12,761 INFO L225 Difference]: With dead ends: 291 [2019-10-07 13:50:12,761 INFO L226 Difference]: Without dead ends: 166 [2019-10-07 13:50:12,766 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:12,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-07 13:50:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-10-07 13:50:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-07 13:50:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 221 transitions. [2019-10-07 13:50:12,837 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 221 transitions. Word has length 18 [2019-10-07 13:50:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:12,838 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 221 transitions. [2019-10-07 13:50:12,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:50:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 221 transitions. [2019-10-07 13:50:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 13:50:12,843 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:12,843 INFO L385 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] [2019-10-07 13:50:12,844 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1970687131, now seen corresponding path program 1 times [2019-10-07 13:50:12,845 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:12,845 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:12,845 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:12,845 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:12,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:13,033 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-07 13:50:13,033 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:13,033 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:13,034 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:50:13,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:50:13,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:50:13,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:13,036 INFO L87 Difference]: Start difference. First operand 166 states and 221 transitions. Second operand 3 states. [2019-10-07 13:50:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:13,192 INFO L93 Difference]: Finished difference Result 232 states and 304 transitions. [2019-10-07 13:50:13,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:50:13,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-07 13:50:13,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:13,196 INFO L225 Difference]: With dead ends: 232 [2019-10-07 13:50:13,196 INFO L226 Difference]: Without dead ends: 184 [2019-10-07 13:50:13,198 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-07 13:50:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-10-07 13:50:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-07 13:50:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 235 transitions. [2019-10-07 13:50:13,226 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 235 transitions. Word has length 22 [2019-10-07 13:50:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:13,228 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 235 transitions. [2019-10-07 13:50:13,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:50:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2019-10-07 13:50:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 13:50:13,230 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:13,230 INFO L385 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] [2019-10-07 13:50:13,231 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:13,233 INFO L82 PathProgramCache]: Analyzing trace with hash 961751251, now seen corresponding path program 1 times [2019-10-07 13:50:13,233 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:13,233 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:13,233 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:13,234 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:13,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:13,340 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-07 13:50:13,340 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:13,341 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:13,341 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:50:13,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:50:13,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:50:13,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:13,343 INFO L87 Difference]: Start difference. First operand 182 states and 235 transitions. Second operand 3 states. [2019-10-07 13:50:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:13,388 INFO L93 Difference]: Finished difference Result 283 states and 362 transitions. [2019-10-07 13:50:13,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:50:13,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-07 13:50:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:13,392 INFO L225 Difference]: With dead ends: 283 [2019-10-07 13:50:13,392 INFO L226 Difference]: Without dead ends: 217 [2019-10-07 13:50:13,395 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-07 13:50:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2019-10-07 13:50:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-07 13:50:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 251 transitions. [2019-10-07 13:50:13,433 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 251 transitions. Word has length 23 [2019-10-07 13:50:13,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:13,434 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 251 transitions. [2019-10-07 13:50:13,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:50:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 251 transitions. [2019-10-07 13:50:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 13:50:13,436 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:13,437 INFO L385 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] [2019-10-07 13:50:13,437 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:13,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:13,474 INFO L82 PathProgramCache]: Analyzing trace with hash 231119792, now seen corresponding path program 1 times [2019-10-07 13:50:13,474 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:13,474 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:13,474 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:13,475 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:13,557 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:13,557 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:13,558 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:50:13,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:50:13,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:50:13,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:13,559 INFO L87 Difference]: Start difference. First operand 197 states and 251 transitions. Second operand 3 states. [2019-10-07 13:50:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:13,636 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2019-10-07 13:50:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:50:13,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-07 13:50:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:13,640 INFO L225 Difference]: With dead ends: 200 [2019-10-07 13:50:13,641 INFO L226 Difference]: Without dead ends: 196 [2019-10-07 13:50:13,644 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:13,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-07 13:50:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-10-07 13:50:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-07 13:50:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2019-10-07 13:50:13,667 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 30 [2019-10-07 13:50:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:13,668 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2019-10-07 13:50:13,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:50:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2019-10-07 13:50:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 13:50:13,674 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:13,674 INFO L385 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] [2019-10-07 13:50:13,674 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:13,675 INFO L82 PathProgramCache]: Analyzing trace with hash 866474743, now seen corresponding path program 1 times [2019-10-07 13:50:13,675 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:13,675 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:13,678 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:13,678 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:13,729 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-07 13:50:13,729 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:13,730 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:13,730 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:50:13,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:50:13,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:50:13,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:50:13,731 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand 4 states. [2019-10-07 13:50:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:13,851 INFO L93 Difference]: Finished difference Result 238 states and 294 transitions. [2019-10-07 13:50:13,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:50:13,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-07 13:50:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:13,854 INFO L225 Difference]: With dead ends: 238 [2019-10-07 13:50:13,854 INFO L226 Difference]: Without dead ends: 191 [2019-10-07 13:50:13,855 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:50:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-07 13:50:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-10-07 13:50:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-10-07 13:50:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2019-10-07 13:50:13,866 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 37 [2019-10-07 13:50:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:13,867 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2019-10-07 13:50:13,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:50:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2019-10-07 13:50:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-07 13:50:13,869 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:13,869 INFO L385 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] [2019-10-07 13:50:13,869 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:13,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:13,870 INFO L82 PathProgramCache]: Analyzing trace with hash 495734487, now seen corresponding path program 1 times [2019-10-07 13:50:13,870 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:13,870 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:13,870 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:13,871 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:13,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:13,909 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-07 13:50:13,909 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:13,910 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:13,910 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:50:13,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:50:13,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:50:13,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:13,911 INFO L87 Difference]: Start difference. First operand 174 states and 216 transitions. Second operand 3 states. [2019-10-07 13:50:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:13,933 INFO L93 Difference]: Finished difference Result 183 states and 227 transitions. [2019-10-07 13:50:13,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:50:13,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-07 13:50:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:13,934 INFO L225 Difference]: With dead ends: 183 [2019-10-07 13:50:13,935 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 13:50:13,935 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 13:50:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-07 13:50:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-07 13:50:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-10-07 13:50:13,940 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 40 [2019-10-07 13:50:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:13,941 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-10-07 13:50:13,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:50:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-10-07 13:50:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 13:50:13,942 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:13,942 INFO L385 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] [2019-10-07 13:50:13,942 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:13,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash -148659379, now seen corresponding path program 1 times [2019-10-07 13:50:13,943 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:13,943 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:13,943 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:13,943 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:13,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:14,001 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-07 13:50:14,001 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:14,001 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:14,002 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:50:14,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:50:14,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:50:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:14,003 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 3 states. [2019-10-07 13:50:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:14,043 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-10-07 13:50:14,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:50:14,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-07 13:50:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:14,046 INFO L225 Difference]: With dead ends: 87 [2019-10-07 13:50:14,046 INFO L226 Difference]: Without dead ends: 64 [2019-10-07 13:50:14,046 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-07 13:50:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-07 13:50:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-07 13:50:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-07 13:50:14,052 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 44 [2019-10-07 13:50:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:14,052 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-07 13:50:14,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:50:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-07 13:50:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-07 13:50:14,054 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:14,054 INFO L385 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-07 13:50:14,054 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:14,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1042710899, now seen corresponding path program 1 times [2019-10-07 13:50:14,055 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:14,055 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:14,055 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:14,055 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:14,169 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-07 13:50:14,169 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:14,170 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:14,170 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:50:14,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:50:14,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:50:14,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:50:14,172 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-10-07 13:50:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:14,190 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2019-10-07 13:50:14,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:50:14,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-07 13:50:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:14,192 INFO L225 Difference]: With dead ends: 85 [2019-10-07 13:50:14,192 INFO L226 Difference]: Without dead ends: 62 [2019-10-07 13:50:14,193 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:50:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-07 13:50:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-07 13:50:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-07 13:50:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-10-07 13:50:14,198 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 46 [2019-10-07 13:50:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:14,198 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-10-07 13:50:14,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:50:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-10-07 13:50:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:50:14,199 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:14,200 INFO L385 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] [2019-10-07 13:50:14,200 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1337489926, now seen corresponding path program 1 times [2019-10-07 13:50:14,201 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:14,201 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:14,201 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:14,201 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:14,285 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:14,285 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:14,285 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:50:14,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:50:14,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:50:14,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:50:14,287 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 5 states. [2019-10-07 13:50:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:14,408 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2019-10-07 13:50:14,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:50:14,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-07 13:50:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:14,409 INFO L225 Difference]: With dead ends: 83 [2019-10-07 13:50:14,409 INFO L226 Difference]: Without dead ends: 62 [2019-10-07 13:50:14,410 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:50:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-07 13:50:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-07 13:50:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-07 13:50:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-07 13:50:14,418 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 50 [2019-10-07 13:50:14,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:14,418 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-07 13:50:14,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:50:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-07 13:50:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 13:50:14,419 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:14,419 INFO L385 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-07 13:50:14,420 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:14,420 INFO L82 PathProgramCache]: Analyzing trace with hash 634691168, now seen corresponding path program 1 times [2019-10-07 13:50:14,420 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:14,420 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:14,421 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:14,421 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:14,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:14,541 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-07 13:50:14,541 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:14,542 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:14,542 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:50:14,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:50:14,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:50:14,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:50:14,543 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 7 states. [2019-10-07 13:50:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:14,685 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-10-07 13:50:14,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:50:14,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-07 13:50:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:14,687 INFO L225 Difference]: With dead ends: 69 [2019-10-07 13:50:14,687 INFO L226 Difference]: Without dead ends: 62 [2019-10-07 13:50:14,688 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:50:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-07 13:50:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-10-07 13:50:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-07 13:50:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-10-07 13:50:14,693 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 51 [2019-10-07 13:50:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:14,693 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-10-07 13:50:14,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:50:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-10-07 13:50:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-07 13:50:14,694 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:14,694 INFO L385 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-07 13:50:14,694 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:14,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash 461082475, now seen corresponding path program 1 times [2019-10-07 13:50:14,695 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:14,695 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:14,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:14,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:14,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:14,731 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-07 13:50:14,731 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:14,732 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:14,732 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:50:14,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:50:14,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:50:14,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:14,733 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 3 states. [2019-10-07 13:50:14,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:14,777 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-10-07 13:50:14,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:50:14,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-07 13:50:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:14,779 INFO L225 Difference]: With dead ends: 69 [2019-10-07 13:50:14,779 INFO L226 Difference]: Without dead ends: 66 [2019-10-07 13:50:14,779 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:50:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-07 13:50:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-07 13:50:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-07 13:50:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-10-07 13:50:14,786 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 52 [2019-10-07 13:50:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:14,787 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-10-07 13:50:14,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:50:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-10-07 13:50:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 13:50:14,787 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:14,788 INFO L385 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-07 13:50:14,788 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:14,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1170982788, now seen corresponding path program 1 times [2019-10-07 13:50:14,788 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:14,789 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:14,789 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:14,789 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:14,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:14,902 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-07 13:50:14,902 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:14,903 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:14,903 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:50:14,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:50:14,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:50:14,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:50:14,904 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 5 states. [2019-10-07 13:50:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:14,989 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-10-07 13:50:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:50:14,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-07 13:50:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:14,991 INFO L225 Difference]: With dead ends: 74 [2019-10-07 13:50:14,991 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 13:50:14,992 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:50:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 13:50:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-07 13:50:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-07 13:50:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 59 transitions. [2019-10-07 13:50:14,997 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 59 transitions. Word has length 53 [2019-10-07 13:50:14,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:14,997 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 59 transitions. [2019-10-07 13:50:14,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:50:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 59 transitions. [2019-10-07 13:50:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 13:50:14,998 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:14,998 INFO L385 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-07 13:50:14,999 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:14,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:14,999 INFO L82 PathProgramCache]: Analyzing trace with hash 174282180, now seen corresponding path program 1 times [2019-10-07 13:50:14,999 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:14,999 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:15,000 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:15,000 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:15,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:15,092 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-07 13:50:15,093 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:15,093 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:15,093 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:50:15,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:50:15,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:50:15,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:50:15,094 INFO L87 Difference]: Start difference. First operand 60 states and 59 transitions. Second operand 6 states. [2019-10-07 13:50:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:15,202 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2019-10-07 13:50:15,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:50:15,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-07 13:50:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:15,203 INFO L225 Difference]: With dead ends: 60 [2019-10-07 13:50:15,204 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:50:15,204 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:50:15,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:50:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:50:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:50:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:50:15,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2019-10-07 13:50:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:15,205 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:50:15,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:50:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:50:15,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:50:15,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:50:17,886 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 567 574) the Hoare annotation is: true [2019-10-07 13:50:17,887 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 567 574) no Hoare annotation was computed. [2019-10-07 13:50:17,887 INFO L446 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 617 627) the Hoare annotation is: true [2019-10-07 13:50:17,887 INFO L446 ceAbstractionStarter]: At program point L623(line 623) the Hoare annotation is: true [2019-10-07 13:50:17,887 INFO L443 ceAbstractionStarter]: For program point L623-1(line 623) no Hoare annotation was computed. [2019-10-07 13:50:17,887 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 617 627) no Hoare annotation was computed. [2019-10-07 13:50:17,887 INFO L439 ceAbstractionStarter]: At program point L733(line 733) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2019-10-07 13:50:17,887 INFO L443 ceAbstractionStarter]: For program point L733-1(lines 729 735) no Hoare annotation was computed. [2019-10-07 13:50:17,887 INFO L439 ceAbstractionStarter]: At program point L723(lines 698 742) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,887 INFO L443 ceAbstractionStarter]: For program point KbFilter_PowerEXIT(lines 688 743) no Hoare annotation was computed. [2019-10-07 13:50:17,887 INFO L439 ceAbstractionStarter]: At program point KbFilter_PowerENTRY(lines 688 743) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,888 INFO L439 ceAbstractionStarter]: At program point L739(line 739) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~s~0)) [2019-10-07 13:50:17,888 INFO L443 ceAbstractionStarter]: For program point L739-1(line 739) no Hoare annotation was computed. [2019-10-07 13:50:17,888 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 42 55) no Hoare annotation was computed. [2019-10-07 13:50:17,888 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 42 55) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,888 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 56 77) the Hoare annotation is: (or (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,889 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 56 77) no Hoare annotation was computed. [2019-10-07 13:50:17,889 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 1008 1015) the Hoare annotation is: true [2019-10-07 13:50:17,889 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-07 13:50:17,889 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 1008 1015) no Hoare annotation was computed. [2019-10-07 13:50:17,889 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 294 465) no Hoare annotation was computed. [2019-10-07 13:50:17,889 INFO L439 ceAbstractionStarter]: At program point L440(lines 431 458) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,889 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 438) no Hoare annotation was computed. [2019-10-07 13:50:17,890 INFO L443 ceAbstractionStarter]: For program point L399(line 399) no Hoare annotation was computed. [2019-10-07 13:50:17,890 INFO L439 ceAbstractionStarter]: At program point L358(lines 357 410) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,890 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 435) no Hoare annotation was computed. [2019-10-07 13:50:17,890 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 408) no Hoare annotation was computed. [2019-10-07 13:50:17,890 INFO L443 ceAbstractionStarter]: For program point L384(line 384) no Hoare annotation was computed. [2019-10-07 13:50:17,890 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 446) no Hoare annotation was computed. [2019-10-07 13:50:17,890 INFO L443 ceAbstractionStarter]: For program point L343(lines 329 412) no Hoare annotation was computed. [2019-10-07 13:50:17,890 INFO L439 ceAbstractionStarter]: At program point L368(lines 367 408) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,890 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 294 465) no Hoare annotation was computed. [2019-10-07 13:50:17,890 INFO L439 ceAbstractionStarter]: At program point L327(line 327) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (= ~SKIP1~0 ~s~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,890 INFO L443 ceAbstractionStarter]: For program point L327-1(lines 323 464) no Hoare annotation was computed. [2019-10-07 13:50:17,891 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 411) no Hoare annotation was computed. [2019-10-07 13:50:17,891 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 294 465) the Hoare annotation is: (or (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,891 INFO L443 ceAbstractionStarter]: For program point L394(line 394) no Hoare annotation was computed. [2019-10-07 13:50:17,891 INFO L439 ceAbstractionStarter]: At program point L353(lines 352 411) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,891 INFO L439 ceAbstractionStarter]: At program point L444(line 444) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,891 INFO L439 ceAbstractionStarter]: At program point L428(lines 421 461) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,891 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 409) no Hoare annotation was computed. [2019-10-07 13:50:17,891 INFO L439 ceAbstractionStarter]: At program point L329(lines 323 464) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,891 INFO L439 ceAbstractionStarter]: At program point L420(lines 413 462) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 1 ~pended~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,891 INFO L443 ceAbstractionStarter]: For program point L379(line 379) no Hoare annotation was computed. [2019-10-07 13:50:17,892 INFO L439 ceAbstractionStarter]: At program point L338-2(lines 338 341) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,892 INFO L443 ceAbstractionStarter]: For program point L429(lines 413 462) no Hoare annotation was computed. [2019-10-07 13:50:17,892 INFO L439 ceAbstractionStarter]: At program point L363(lines 362 409) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,892 INFO L439 ceAbstractionStarter]: At program point L372(lines 372 407) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,892 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 459) no Hoare annotation was computed. [2019-10-07 13:50:17,892 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 426) no Hoare annotation was computed. [2019-10-07 13:50:17,892 INFO L443 ceAbstractionStarter]: For program point L389(line 389) no Hoare annotation was computed. [2019-10-07 13:50:17,892 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 418) no Hoare annotation was computed. [2019-10-07 13:50:17,892 INFO L439 ceAbstractionStarter]: At program point L373(lines 372 407) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|))) [2019-10-07 13:50:17,892 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 458) no Hoare annotation was computed. [2019-10-07 13:50:17,892 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 410) no Hoare annotation was computed. [2019-10-07 13:50:17,892 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 548) no Hoare annotation was computed. [2019-10-07 13:50:17,893 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 498) no Hoare annotation was computed. [2019-10-07 13:50:17,893 INFO L439 ceAbstractionStarter]: At program point L523(lines 487 551) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) (or (not (<= 1 ~NP~0)) (and (= ~s~0 ~MPR1~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))))) [2019-10-07 13:50:17,893 INFO L439 ceAbstractionStarter]: At program point L490(line 490) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (= ~s~0 |old(~s~0)|)) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-10-07 13:50:17,893 INFO L443 ceAbstractionStarter]: For program point L490-1(line 490) no Hoare annotation was computed. [2019-10-07 13:50:17,893 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 547) no Hoare annotation was computed. [2019-10-07 13:50:17,893 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 480 552) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) (or (not (<= 1 ~NP~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (= ~s~0 |old(~s~0)|)))) [2019-10-07 13:50:17,893 INFO L439 ceAbstractionStarter]: At program point L545(line 545) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-10-07 13:50:17,893 INFO L443 ceAbstractionStarter]: For program point L545-1(lines 527 549) no Hoare annotation was computed. [2019-10-07 13:50:17,893 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 480 552) no Hoare annotation was computed. [2019-10-07 13:50:17,894 INFO L439 ceAbstractionStarter]: At program point L496(line 496) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= 1 ~NP~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~s~0 |old(~s~0)|) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-10-07 13:50:17,894 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 500) no Hoare annotation was computed. [2019-10-07 13:50:17,894 INFO L439 ceAbstractionStarter]: At program point L488-1(lines 488 500) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) (or (not (<= 1 ~NP~0)) (and (= ~s~0 ~MPR1~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))))) [2019-10-07 13:50:17,894 INFO L439 ceAbstractionStarter]: At program point L474(line 474) the Hoare annotation is: (or (not (<= 1 ~setEventCalled~0)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-10-07 13:50:17,894 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 466 479) no Hoare annotation was computed. [2019-10-07 13:50:17,894 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 466 479) the Hoare annotation is: (or (not (<= 1 ~setEventCalled~0)) (not (<= 1 ~NP~0)) (= ~s~0 |old(~s~0)|) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-10-07 13:50:17,894 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 466 479) no Hoare annotation was computed. [2019-10-07 13:50:17,894 INFO L443 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 744 820) no Hoare annotation was computed. [2019-10-07 13:50:17,895 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 815) no Hoare annotation was computed. [2019-10-07 13:50:17,895 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 816) no Hoare annotation was computed. [2019-10-07 13:50:17,895 INFO L443 ceAbstractionStarter]: For program point L759(lines 759 763) no Hoare annotation was computed. [2019-10-07 13:50:17,895 INFO L439 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 744 820) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-10-07 13:50:17,895 INFO L439 ceAbstractionStarter]: At program point L788(lines 752 819) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-10-07 13:50:17,895 INFO L439 ceAbstractionStarter]: At program point L755(line 755) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-10-07 13:50:17,895 INFO L443 ceAbstractionStarter]: For program point L755-1(line 755) no Hoare annotation was computed. [2019-10-07 13:50:17,896 INFO L439 ceAbstractionStarter]: At program point L813(line 813) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-10-07 13:50:17,896 INFO L443 ceAbstractionStarter]: For program point L813-1(lines 792 817) no Hoare annotation was computed. [2019-10-07 13:50:17,896 INFO L439 ceAbstractionStarter]: At program point L761(line 761) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-10-07 13:50:17,896 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 765) no Hoare annotation was computed. [2019-10-07 13:50:17,896 INFO L439 ceAbstractionStarter]: At program point L753-1(lines 753 765) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-10-07 13:50:17,896 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 654) no Hoare annotation was computed. [2019-10-07 13:50:17,896 INFO L439 ceAbstractionStarter]: At program point L659(line 659) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,896 INFO L443 ceAbstractionStarter]: For program point KbFilter_CreateCloseEXIT(lines 628 663) no Hoare annotation was computed. [2019-10-07 13:50:17,897 INFO L443 ceAbstractionStarter]: For program point L659-1(line 659) no Hoare annotation was computed. [2019-10-07 13:50:17,897 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 653) no Hoare annotation was computed. [2019-10-07 13:50:17,897 INFO L443 ceAbstractionStarter]: For program point L637(lines 637 655) no Hoare annotation was computed. [2019-10-07 13:50:17,897 INFO L439 ceAbstractionStarter]: At program point KbFilter_CreateCloseENTRY(lines 628 663) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,897 INFO L439 ceAbstractionStarter]: At program point L652(lines 640 654) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,897 INFO L439 ceAbstractionStarter]: At program point L644(lines 637 655) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,897 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~s~0 |old(~s~0)|) [2019-10-07 13:50:17,898 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:50:17,898 INFO L443 ceAbstractionStarter]: For program point L923(lines 923 975) no Hoare annotation was computed. [2019-10-07 13:50:17,898 INFO L439 ceAbstractionStarter]: At program point L890(lines 890 985) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,898 INFO L439 ceAbstractionStarter]: At program point L882(lines 882 987) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,898 INFO L443 ceAbstractionStarter]: For program point KbFilter_InternIoCtlEXIT(lines 821 1006) no Hoare annotation was computed. [2019-10-07 13:50:17,898 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 989) no Hoare annotation was computed. [2019-10-07 13:50:17,898 INFO L439 ceAbstractionStarter]: At program point L1002(line 1002) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,898 INFO L443 ceAbstractionStarter]: For program point L1002-1(line 1002) no Hoare annotation was computed. [2019-10-07 13:50:17,899 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 983) no Hoare annotation was computed. [2019-10-07 13:50:17,899 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 977) no Hoare annotation was computed. [2019-10-07 13:50:17,899 INFO L443 ceAbstractionStarter]: For program point L933(lines 933 972) no Hoare annotation was computed. [2019-10-07 13:50:17,899 INFO L443 ceAbstractionStarter]: For program point L909(lines 909 979) no Hoare annotation was computed. [2019-10-07 13:50:17,899 INFO L439 ceAbstractionStarter]: At program point L971(lines 866 1005) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,899 INFO L439 ceAbstractionStarter]: At program point L934(lines 874 989) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,899 INFO L439 ceAbstractionStarter]: At program point L996(line 996) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,900 INFO L443 ceAbstractionStarter]: For program point L996-1(line 996) no Hoare annotation was computed. [2019-10-07 13:50:17,900 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 973) no Hoare annotation was computed. [2019-10-07 13:50:17,900 INFO L439 ceAbstractionStarter]: At program point KbFilter_InternIoCtlENTRY(lines 821 1006) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,900 INFO L443 ceAbstractionStarter]: For program point L902(lines 902 981) no Hoare annotation was computed. [2019-10-07 13:50:17,900 INFO L443 ceAbstractionStarter]: For program point KbFilter_InternIoCtlFINAL(lines 821 1006) no Hoare annotation was computed. [2019-10-07 13:50:17,900 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 575 616) no Hoare annotation was computed. [2019-10-07 13:50:17,900 INFO L439 ceAbstractionStarter]: At program point L595(line 595) the Hoare annotation is: (or (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (and (not (= |old(~s~0)| ~NP~0)) (not (= |old(~s~0)| ~MPR3~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))) [2019-10-07 13:50:17,900 INFO L443 ceAbstractionStarter]: For program point L593(lines 593 597) no Hoare annotation was computed. [2019-10-07 13:50:17,901 INFO L439 ceAbstractionStarter]: At program point L593-1(lines 580 599) the Hoare annotation is: (or (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (= ~s~0 ~NP~0) (and (not (= |old(~s~0)| ~NP~0)) (not (= |old(~s~0)| ~MPR3~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))) [2019-10-07 13:50:17,901 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-10-07 13:50:17,901 INFO L439 ceAbstractionStarter]: At program point L588(lines 580 599) the Hoare annotation is: (or (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (and (not (= |old(~s~0)| ~NP~0)) (not (= |old(~s~0)| ~MPR3~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= ~s~0 |old(~s~0)|) (not (= ~MPR3~0 ~s~0)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))) [2019-10-07 13:50:17,901 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 575 616) the Hoare annotation is: (or (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (and (= ~s~0 |old(~s~0)|) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (and (not (= |old(~s~0)| ~NP~0)) (not (= |old(~s~0)| ~MPR3~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))) [2019-10-07 13:50:17,901 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 599) no Hoare annotation was computed. [2019-10-07 13:50:17,901 INFO L439 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 .cse1 (not (<= 1 ~compRegistered~0))) (or .cse0 .cse1 (not (= ~compRegistered~0 0))))) [2019-10-07 13:50:17,902 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 553 566) no Hoare annotation was computed. [2019-10-07 13:50:17,902 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 563) no Hoare annotation was computed. [2019-10-07 13:50:17,902 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 553 566) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (= ~s~0 ~NP~0))) (and (or .cse0 .cse1 .cse2 (not (<= 1 ~compRegistered~0))) (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2))) [2019-10-07 13:50:17,902 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 553 566) no Hoare annotation was computed. [2019-10-07 13:50:17,902 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:50:17,902 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) [2019-10-07 13:50:17,902 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:50:17,902 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:50:17,903 INFO L439 ceAbstractionStarter]: At program point KbFilter_DispatchPassThroughENTRY(lines 664 687) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-07 13:50:17,903 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 679) no Hoare annotation was computed. [2019-10-07 13:50:17,903 INFO L439 ceAbstractionStarter]: At program point L683(line 683) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~s~0)) [2019-10-07 13:50:17,903 INFO L443 ceAbstractionStarter]: For program point L683-1(line 683) no Hoare annotation was computed. [2019-10-07 13:50:17,903 INFO L439 ceAbstractionStarter]: At program point L677(line 677) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2019-10-07 13:50:17,903 INFO L443 ceAbstractionStarter]: For program point L677-1(lines 673 679) no Hoare annotation was computed. [2019-10-07 13:50:17,903 INFO L443 ceAbstractionStarter]: For program point KbFilter_DispatchPassThroughEXIT(lines 664 687) no Hoare annotation was computed. [2019-10-07 13:50:17,903 INFO L439 ceAbstractionStarter]: At program point L217(line 217) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,904 INFO L439 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,904 INFO L443 ceAbstractionStarter]: For program point L242-1(lines 238 244) no Hoare annotation was computed. [2019-10-07 13:50:17,904 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 188) no Hoare annotation was computed. [2019-10-07 13:50:17,904 INFO L439 ceAbstractionStarter]: At program point L110(lines 110 289) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-10-07 13:50:17,904 INFO L439 ceAbstractionStarter]: At program point L226(line 226) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,904 INFO L439 ceAbstractionStarter]: At program point L193(lines 193 194) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (and (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0))) [2019-10-07 13:50:17,905 INFO L443 ceAbstractionStarter]: For program point L226-1(lines 222 228) no Hoare annotation was computed. [2019-10-07 13:50:17,905 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 193 194) no Hoare annotation was computed. [2019-10-07 13:50:17,905 INFO L446 ceAbstractionStarter]: At program point L268(lines 171 269) the Hoare annotation is: true [2019-10-07 13:50:17,905 INFO L439 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,905 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 80 293) no Hoare annotation was computed. [2019-10-07 13:50:17,905 INFO L439 ceAbstractionStarter]: At program point L170(lines 116 287) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-10-07 13:50:17,905 INFO L439 ceAbstractionStarter]: At program point L113(lines 113 288) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-10-07 13:50:17,906 INFO L439 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 80 293) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,906 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-10-07 13:50:17,906 INFO L439 ceAbstractionStarter]: At program point L263(lines 263 264) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,906 INFO L443 ceAbstractionStarter]: For program point L263-1(lines 263 264) no Hoare annotation was computed. [2019-10-07 13:50:17,906 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 228) no Hoare annotation was computed. [2019-10-07 13:50:17,906 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2019-10-07 13:50:17,906 INFO L443 ceAbstractionStarter]: For program point L181-1(lines 176 188) no Hoare annotation was computed. [2019-10-07 13:50:17,906 INFO L439 ceAbstractionStarter]: At program point L107(lines 107 290) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,907 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 204) no Hoare annotation was computed. [2019-10-07 13:50:17,907 INFO L443 ceAbstractionStarter]: For program point L198-2(lines 171 267) no Hoare annotation was computed. [2019-10-07 13:50:17,907 INFO L439 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,907 INFO L443 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2019-10-07 13:50:17,907 INFO L439 ceAbstractionStarter]: At program point L232(lines 232 233) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,907 INFO L443 ceAbstractionStarter]: For program point L232-1(lines 232 233) no Hoare annotation was computed. [2019-10-07 13:50:17,907 INFO L439 ceAbstractionStarter]: At program point L257(line 257) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,908 INFO L443 ceAbstractionStarter]: For program point L257-1(lines 253 259) no Hoare annotation was computed. [2019-10-07 13:50:17,908 INFO L439 ceAbstractionStarter]: At program point L183(line 183) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,908 INFO L439 ceAbstractionStarter]: At program point L200(lines 200 202) the Hoare annotation is: (or (not (<= 1 ~NP~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (let ((.cse0 (= ~s~0 ~NP~0))) (and (or .cse0 (= KbFilter_PnP_~__cil_tmp23~0 259)) (or .cse0 (= ~MPR3~0 ~s~0)) (<= 1 ~compRegistered~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (not (= 1 |old(~s~0)|))) [2019-10-07 13:50:17,908 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 200 202) no Hoare annotation was computed. [2019-10-07 13:50:17,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:50:17 BoogieIcfgContainer [2019-10-07 13:50:17,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:50:17,941 INFO L168 Benchmark]: Toolchain (without parser) took 7921.13 ms. Allocated memory was 137.4 MB in the beginning and 335.0 MB in the end (delta: 197.7 MB). Free memory was 101.3 MB in the beginning and 191.7 MB in the end (delta: -90.5 MB). Peak memory consumption was 176.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:17,942 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-07 13:50:17,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.17 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 101.1 MB in the beginning and 170.2 MB in the end (delta: -69.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:17,944 INFO L168 Benchmark]: Boogie Preprocessor took 74.20 ms. Allocated memory is still 200.3 MB. Free memory was 170.2 MB in the beginning and 166.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:17,945 INFO L168 Benchmark]: RCFGBuilder took 1479.54 ms. Allocated memory was 200.3 MB in the beginning and 231.7 MB in the end (delta: 31.5 MB). Free memory was 166.8 MB in the beginning and 155.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:17,946 INFO L168 Benchmark]: TraceAbstraction took 5730.21 ms. Allocated memory was 231.7 MB in the beginning and 335.0 MB in the end (delta: 103.3 MB). Free memory was 155.2 MB in the beginning and 191.7 MB in the end (delta: -36.5 MB). Peak memory consumption was 136.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:17,952 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 630.17 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 101.1 MB in the beginning and 170.2 MB in the end (delta: -69.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.20 ms. Allocated memory is still 200.3 MB. Free memory was 170.2 MB in the beginning and 166.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1479.54 ms. Allocated memory was 200.3 MB in the beginning and 231.7 MB in the end (delta: 31.5 MB). Free memory was 166.8 MB in the beginning and 155.2 MB in the end (delta: 11.6 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5730.21 ms. Allocated memory was 231.7 MB in the beginning and 335.0 MB in the end (delta: 103.3 MB). Free memory was 155.2 MB in the beginning and 191.7 MB in the end (delta: -36.5 MB). Peak memory consumption was 136.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ((((!(\old(s) == \old(NP)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || (((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) && 1 == s) && NP + 4 <= MPR1)) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((!(1 <= NP) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(1 == \old(s))) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: ((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((!(1 <= \old(setEventCalled)) || !(1 <= NP)) || 1 == pended) || (!(\old(s) == NP) && !(\old(s) == MPR3))) || !(NP + 4 <= MPR1)) || (((s == \old(s) && !(MPR3 == s)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1) - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((!(1 <= NP) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(1 == \old(s))) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((!(1 <= NP) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(1 == \old(s))) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((!(1 <= \old(setEventCalled)) || !(1 <= NP)) || 1 == pended) || s == NP) || (!(\old(s) == NP) && !(\old(s) == MPR3))) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((0 == compRegistered && s == \old(s)) || !(1 <= NP)) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(1 == \old(s)) - InvariantResult [Line: 421]: Loop Invariant Derived loop invariant: ((((!(\old(s) == \old(NP)) || !(1 == pended)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 866]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) && ((((((!(1 <= NP) || (((s == MPR1 && __cil_tmp7 + 1073741802 == 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(1 == \old(s))) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: (((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1)) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) && ((((((!(1 <= NP) || (((s == MPR1 && __cil_tmp7 + 1073741802 == 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(1 == \old(s))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 172 locations, 1 error locations. Result: SAFE, OverallTime: 5.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, HoareTripleCheckerStatistics: 1640 SDtfs, 960 SDslu, 1137 SDs, 0 SdLazy, 424 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 257 PreInvPairs, 301 NumberOfFragments, 2012 HoareAnnotationTreeSize, 257 FomulaSimplifications, 89 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 78 FomulaSimplificationsInter, 1570 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 41811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 correct! Received shutdown request...