java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:42:21,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:42:21,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:42:21,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:42:21,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:42:21,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:42:21,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:42:21,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:42:21,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:42:21,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:42:21,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:42:21,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:42:21,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:42:21,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:42:21,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:42:21,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:42:21,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:42:21,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:42:21,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:42:21,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:42:21,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:42:21,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:42:21,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:42:21,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:42:21,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:42:21,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:42:21,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:42:21,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:42:21,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:42:21,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:42:21,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:42:21,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:42:21,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:42:21,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:42:21,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:42:21,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:42:21,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:42:21,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:42:21,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:42:21,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:42:21,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:42:21,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:42:21,272 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:42:21,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:42:21,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:42:21,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:42:21,275 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:42:21,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:42:21,275 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:42:21,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:42:21,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:42:21,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:42:21,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:42:21,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:42:21,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:42:21,278 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:42:21,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:42:21,279 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:42:21,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:42:21,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:42:21,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:42:21,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:42:21,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:42:21,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:42:21,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:42:21,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:42:21,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:42:21,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:42:21,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:42:21,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:42:21,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:42:21,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:42:21,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:42:21,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:42:21,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:42:21,367 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:42:21,368 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-02 11:42:21,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9249807ec/a538a746ea61401895a7c370f70e6c17/FLAG764617878 [2019-10-02 11:42:21,903 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:42:21,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-10-02 11:42:21,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9249807ec/a538a746ea61401895a7c370f70e6c17/FLAG764617878 [2019-10-02 11:42:22,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9249807ec/a538a746ea61401895a7c370f70e6c17 [2019-10-02 11:42:22,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:42:22,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:42:22,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:42:22,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:42:22,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:42:22,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:42:22" (1/1) ... [2019-10-02 11:42:22,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174e5ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:22, skipping insertion in model container [2019-10-02 11:42:22,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:42:22" (1/1) ... [2019-10-02 11:42:22,325 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:42:22,378 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:42:22,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:42:22,772 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:42:22,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:42:22,878 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:42:22,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:22 WrapperNode [2019-10-02 11:42:22,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:42:22,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:42:22,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:42:22,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:42:22,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:22" (1/1) ... [2019-10-02 11:42:22,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:22" (1/1) ... [2019-10-02 11:42:22,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:22" (1/1) ... [2019-10-02 11:42:22,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:22" (1/1) ... [2019-10-02 11:42:22,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:22" (1/1) ... [2019-10-02 11:42:22,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:22" (1/1) ... [2019-10-02 11:42:22,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:22" (1/1) ... [2019-10-02 11:42:22,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:42:22,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:42:22,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:42:22,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:42:22,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:42:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:42:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:42:23,031 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-02 11:42:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-02 11:42:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-10-02 11:42:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:42:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-02 11:42:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-02 11:42:23,032 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-02 11:42:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-02 11:42:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-02 11:42:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-10-02 11:42:23,033 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-10-02 11:42:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-10-02 11:42:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-10-02 11:42:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-02 11:42:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-10-02 11:42:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-02 11:42:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:42:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 11:42:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:42:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 11:42:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 11:42:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-02 11:42:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-10-02 11:42:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-02 11:42:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-02 11:42:23,036 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-02 11:42:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-10-02 11:42:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-10-02 11:42:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-10-02 11:42:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-10-02 11:42:23,037 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-10-02 11:42:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-02 11:42:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-02 11:42:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-02 11:42:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-02 11:42:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:42:23,038 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-02 11:42:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:42:23,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:42:23,436 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:23,551 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-02 11:42:23,552 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-02 11:42:23,581 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:23,698 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-02 11:42:23,698 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-02 11:42:23,699 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:23,755 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-02 11:42:23,755 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-02 11:42:23,774 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:23,821 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-02 11:42:23,821 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-02 11:42:23,909 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:23,940 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-02 11:42:23,941 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-02 11:42:23,965 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:24,082 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-10-02 11:42:24,082 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-10-02 11:42:24,091 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:42:24,091 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 11:42:24,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:42:24 BoogieIcfgContainer [2019-10-02 11:42:24,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:42:24,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:42:24,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:42:24,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:42:24,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:42:22" (1/3) ... [2019-10-02 11:42:24,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1249586d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:42:24, skipping insertion in model container [2019-10-02 11:42:24,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:22" (2/3) ... [2019-10-02 11:42:24,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1249586d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:42:24, skipping insertion in model container [2019-10-02 11:42:24,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:42:24" (3/3) ... [2019-10-02 11:42:24,103 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-10-02 11:42:24,114 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:42:24,124 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:42:24,143 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:42:24,177 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:42:24,177 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:42:24,178 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:42:24,178 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:42:24,178 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:42:24,178 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:42:24,179 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:42:24,179 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:42:24,179 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:42:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2019-10-02 11:42:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:42:24,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:24,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:24,219 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:24,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1712773315, now seen corresponding path program 1 times [2019-10-02 11:42:24,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:24,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:24,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:24,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:24,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:24,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:24,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:24,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:24,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:24,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:24,513 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 3 states. [2019-10-02 11:42:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:24,653 INFO L93 Difference]: Finished difference Result 388 states and 582 transitions. [2019-10-02 11:42:24,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:24,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:42:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:24,670 INFO L225 Difference]: With dead ends: 388 [2019-10-02 11:42:24,670 INFO L226 Difference]: Without dead ends: 228 [2019-10-02 11:42:24,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-02 11:42:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-10-02 11:42:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-02 11:42:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2019-10-02 11:42:24,745 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2019-10-02 11:42:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:24,745 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2019-10-02 11:42:24,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2019-10-02 11:42:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:42:24,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:24,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:24,748 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:24,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1840561730, now seen corresponding path program 1 times [2019-10-02 11:42:24,749 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:24,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:24,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:24,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:24,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:24,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:24,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:24,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:24,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:24,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:24,955 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand 3 states. [2019-10-02 11:42:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:25,294 INFO L93 Difference]: Finished difference Result 366 states and 502 transitions. [2019-10-02 11:42:25,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:25,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-02 11:42:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:25,300 INFO L225 Difference]: With dead ends: 366 [2019-10-02 11:42:25,300 INFO L226 Difference]: Without dead ends: 308 [2019-10-02 11:42:25,302 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-02 11:42:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 295. [2019-10-02 11:42:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-02 11:42:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 404 transitions. [2019-10-02 11:42:25,353 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 404 transitions. Word has length 28 [2019-10-02 11:42:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:25,354 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 404 transitions. [2019-10-02 11:42:25,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 404 transitions. [2019-10-02 11:42:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:42:25,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:25,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:25,356 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:25,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash -919522484, now seen corresponding path program 1 times [2019-10-02 11:42:25,356 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:25,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:25,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:25,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:25,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:25,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:25,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:25,456 INFO L87 Difference]: Start difference. First operand 295 states and 404 transitions. Second operand 3 states. [2019-10-02 11:42:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:25,498 INFO L93 Difference]: Finished difference Result 472 states and 628 transitions. [2019-10-02 11:42:25,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:25,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-02 11:42:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:25,502 INFO L225 Difference]: With dead ends: 472 [2019-10-02 11:42:25,502 INFO L226 Difference]: Without dead ends: 356 [2019-10-02 11:42:25,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:25,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-10-02 11:42:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 335. [2019-10-02 11:42:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-10-02 11:42:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2019-10-02 11:42:25,533 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 28 [2019-10-02 11:42:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:25,534 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2019-10-02 11:42:25,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2019-10-02 11:42:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:42:25,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:25,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:25,537 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1823384951, now seen corresponding path program 1 times [2019-10-02 11:42:25,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:25,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:25,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:25,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:25,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:25,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:25,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:25,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:25,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:25,627 INFO L87 Difference]: Start difference. First operand 335 states and 455 transitions. Second operand 3 states. [2019-10-02 11:42:25,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:25,726 INFO L93 Difference]: Finished difference Result 338 states and 457 transitions. [2019-10-02 11:42:25,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:25,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-02 11:42:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:25,730 INFO L225 Difference]: With dead ends: 338 [2019-10-02 11:42:25,730 INFO L226 Difference]: Without dead ends: 334 [2019-10-02 11:42:25,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-02 11:42:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2019-10-02 11:42:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-02 11:42:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 452 transitions. [2019-10-02 11:42:25,765 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 452 transitions. Word has length 38 [2019-10-02 11:42:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:25,766 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 452 transitions. [2019-10-02 11:42:25,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 452 transitions. [2019-10-02 11:42:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:42:25,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:25,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:25,776 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:25,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1946925920, now seen corresponding path program 1 times [2019-10-02 11:42:25,777 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:25,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:25,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:25,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:25,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:25,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:42:25,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:42:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:42:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:42:25,885 INFO L87 Difference]: Start difference. First operand 334 states and 452 transitions. Second operand 4 states. [2019-10-02 11:42:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:26,074 INFO L93 Difference]: Finished difference Result 379 states and 501 transitions. [2019-10-02 11:42:26,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:42:26,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-02 11:42:26,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:26,077 INFO L225 Difference]: With dead ends: 379 [2019-10-02 11:42:26,078 INFO L226 Difference]: Without dead ends: 313 [2019-10-02 11:42:26,078 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:42:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-10-02 11:42:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 295. [2019-10-02 11:42:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-02 11:42:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 395 transitions. [2019-10-02 11:42:26,097 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 395 transitions. Word has length 46 [2019-10-02 11:42:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:26,097 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 395 transitions. [2019-10-02 11:42:26,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:42:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 395 transitions. [2019-10-02 11:42:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 11:42:26,100 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:26,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:26,100 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:26,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:26,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1615603168, now seen corresponding path program 1 times [2019-10-02 11:42:26,101 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:26,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:26,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:26,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:26,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:26,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:26,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:26,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:26,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:26,163 INFO L87 Difference]: Start difference. First operand 295 states and 395 transitions. Second operand 3 states. [2019-10-02 11:42:26,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:26,191 INFO L93 Difference]: Finished difference Result 304 states and 406 transitions. [2019-10-02 11:42:26,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:26,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-02 11:42:26,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:26,193 INFO L225 Difference]: With dead ends: 304 [2019-10-02 11:42:26,193 INFO L226 Difference]: Without dead ends: 102 [2019-10-02 11:42:26,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-02 11:42:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-10-02 11:42:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-02 11:42:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2019-10-02 11:42:26,201 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2019-10-02 11:42:26,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:26,201 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2019-10-02 11:42:26,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2019-10-02 11:42:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 11:42:26,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:26,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:26,203 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:26,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash -582629432, now seen corresponding path program 1 times [2019-10-02 11:42:26,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:26,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:26,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:26,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:26,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:26,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:26,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:26,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:26,264 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 3 states. [2019-10-02 11:42:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:26,301 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2019-10-02 11:42:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:26,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-02 11:42:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:26,303 INFO L225 Difference]: With dead ends: 130 [2019-10-02 11:42:26,303 INFO L226 Difference]: Without dead ends: 100 [2019-10-02 11:42:26,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-02 11:42:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-10-02 11:42:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-02 11:42:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2019-10-02 11:42:26,310 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2019-10-02 11:42:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:26,311 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2019-10-02 11:42:26,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2019-10-02 11:42:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 11:42:26,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:26,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:26,312 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1306380805, now seen corresponding path program 1 times [2019-10-02 11:42:26,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:26,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:26,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:26,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:26,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:26,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:26,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:26,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:26,384 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 6 states. [2019-10-02 11:42:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:26,427 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2019-10-02 11:42:26,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:26,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-02 11:42:26,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:26,429 INFO L225 Difference]: With dead ends: 152 [2019-10-02 11:42:26,429 INFO L226 Difference]: Without dead ends: 111 [2019-10-02 11:42:26,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-02 11:42:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2019-10-02 11:42:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-02 11:42:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2019-10-02 11:42:26,437 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2019-10-02 11:42:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:26,438 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2019-10-02 11:42:26,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2019-10-02 11:42:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 11:42:26,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:26,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:26,439 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:26,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash -538994442, now seen corresponding path program 1 times [2019-10-02 11:42:26,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:26,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:26,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:26,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:26,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:26,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:26,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:26,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:26,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:26,511 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 6 states. [2019-10-02 11:42:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:26,561 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2019-10-02 11:42:26,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:26,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-02 11:42:26,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:26,563 INFO L225 Difference]: With dead ends: 116 [2019-10-02 11:42:26,563 INFO L226 Difference]: Without dead ends: 109 [2019-10-02 11:42:26,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-02 11:42:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-10-02 11:42:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-02 11:42:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-10-02 11:42:26,571 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2019-10-02 11:42:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:26,571 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-10-02 11:42:26,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-10-02 11:42:26,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 11:42:26,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:26,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:26,573 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash -914264427, now seen corresponding path program 1 times [2019-10-02 11:42:26,573 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:26,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:26,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:26,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:26,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:26,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:26,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:26,616 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 3 states. [2019-10-02 11:42:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:26,652 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2019-10-02 11:42:26,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:26,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 11:42:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:26,655 INFO L225 Difference]: With dead ends: 122 [2019-10-02 11:42:26,655 INFO L226 Difference]: Without dead ends: 117 [2019-10-02 11:42:26,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-02 11:42:26,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-10-02 11:42:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-02 11:42:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-10-02 11:42:26,664 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 58 [2019-10-02 11:42:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:26,665 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-10-02 11:42:26,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-10-02 11:42:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 11:42:26,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:26,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:26,666 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:26,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:26,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1535327622, now seen corresponding path program 1 times [2019-10-02 11:42:26,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:26,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:26,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:26,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:26,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:26,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:26,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:26,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:26,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:26,772 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 5 states. [2019-10-02 11:42:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:26,793 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2019-10-02 11:42:26,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:26,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-02 11:42:26,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:26,795 INFO L225 Difference]: With dead ends: 146 [2019-10-02 11:42:26,795 INFO L226 Difference]: Without dead ends: 102 [2019-10-02 11:42:26,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-02 11:42:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-10-02 11:42:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-02 11:42:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-10-02 11:42:26,823 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 58 [2019-10-02 11:42:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:26,825 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-10-02 11:42:26,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-10-02 11:42:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 11:42:26,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:26,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:26,827 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:26,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:26,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1832020397, now seen corresponding path program 1 times [2019-10-02 11:42:26,828 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:26,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:26,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:26,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:26,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:26,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:26,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:26,920 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 5 states. [2019-10-02 11:42:27,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:27,026 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2019-10-02 11:42:27,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:27,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-02 11:42:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:27,028 INFO L225 Difference]: With dead ends: 132 [2019-10-02 11:42:27,028 INFO L226 Difference]: Without dead ends: 94 [2019-10-02 11:42:27,029 INFO L640 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-02 11:42:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-02 11:42:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-10-02 11:42:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-02 11:42:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-10-02 11:42:27,036 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 62 [2019-10-02 11:42:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:27,036 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-10-02 11:42:27,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-10-02 11:42:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 11:42:27,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:27,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:27,037 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:27,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:27,038 INFO L82 PathProgramCache]: Analyzing trace with hash 198062706, now seen corresponding path program 1 times [2019-10-02 11:42:27,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:27,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:27,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:27,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:27,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:27,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:27,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:27,078 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 3 states. [2019-10-02 11:42:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:27,097 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2019-10-02 11:42:27,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:27,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-02 11:42:27,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:27,098 INFO L225 Difference]: With dead ends: 130 [2019-10-02 11:42:27,099 INFO L226 Difference]: Without dead ends: 100 [2019-10-02 11:42:27,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-02 11:42:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-10-02 11:42:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-02 11:42:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-10-02 11:42:27,106 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2019-10-02 11:42:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:27,107 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-10-02 11:42:27,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-10-02 11:42:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 11:42:27,109 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:27,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:27,109 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:27,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:27,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1883613746, now seen corresponding path program 1 times [2019-10-02 11:42:27,110 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:27,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:27,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:27,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:42:27,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:42:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:42:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:27,192 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 7 states. [2019-10-02 11:42:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:27,244 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-10-02 11:42:27,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:27,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-10-02 11:42:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:27,246 INFO L225 Difference]: With dead ends: 116 [2019-10-02 11:42:27,246 INFO L226 Difference]: Without dead ends: 97 [2019-10-02 11:42:27,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:27,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-02 11:42:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-10-02 11:42:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-02 11:42:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-10-02 11:42:27,255 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 64 [2019-10-02 11:42:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:27,255 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-10-02 11:42:27,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:42:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-10-02 11:42:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 11:42:27,256 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:27,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:27,257 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:27,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1968245100, now seen corresponding path program 1 times [2019-10-02 11:42:27,257 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:27,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:27,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:27,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:27,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:27,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:42:27,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:42:27,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:42:27,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:27,451 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 11 states. [2019-10-02 11:42:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:27,822 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-10-02 11:42:27,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:42:27,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-10-02 11:42:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:27,824 INFO L225 Difference]: With dead ends: 109 [2019-10-02 11:42:27,824 INFO L226 Difference]: Without dead ends: 91 [2019-10-02 11:42:27,825 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:42:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-02 11:42:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2019-10-02 11:42:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-02 11:42:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2019-10-02 11:42:27,834 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2019-10-02 11:42:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:27,835 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2019-10-02 11:42:27,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:42:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2019-10-02 11:42:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 11:42:27,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:27,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:27,836 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:27,837 INFO L82 PathProgramCache]: Analyzing trace with hash -603130258, now seen corresponding path program 1 times [2019-10-02 11:42:27,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:27,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:27,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:27,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:27,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:27,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:27,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:27,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:27,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:27,974 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 5 states. [2019-10-02 11:42:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:28,084 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-10-02 11:42:28,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:28,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-02 11:42:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:28,086 INFO L225 Difference]: With dead ends: 98 [2019-10-02 11:42:28,086 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 11:42:28,087 INFO L640 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-02 11:42:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 11:42:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-02 11:42:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-02 11:42:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-10-02 11:42:28,096 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2019-10-02 11:42:28,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:28,096 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-10-02 11:42:28,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-10-02 11:42:28,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 11:42:28,097 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:28,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:28,098 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:28,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:28,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1151601388, now seen corresponding path program 1 times [2019-10-02 11:42:28,098 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:28,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:28,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:28,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:28,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:28,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:28,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:28,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:28,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:28,193 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2019-10-02 11:42:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:28,232 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2019-10-02 11:42:28,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:28,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-02 11:42:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:28,233 INFO L225 Difference]: With dead ends: 87 [2019-10-02 11:42:28,233 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 11:42:28,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 11:42:28,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-02 11:42:28,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-02 11:42:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-10-02 11:42:28,241 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2019-10-02 11:42:28,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:28,242 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-10-02 11:42:28,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-10-02 11:42:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 11:42:28,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:28,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:28,244 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:28,244 INFO L82 PathProgramCache]: Analyzing trace with hash -42695807, now seen corresponding path program 1 times [2019-10-02 11:42:28,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:28,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:28,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:28,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:28,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:28,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:28,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:28,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:28,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:28,308 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 5 states. [2019-10-02 11:42:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:28,403 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-10-02 11:42:28,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:28,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-02 11:42:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:28,404 INFO L225 Difference]: With dead ends: 78 [2019-10-02 11:42:28,405 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:42:28,405 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:42:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:42:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:42:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:42:28,407 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2019-10-02 11:42:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:28,407 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:42:28,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:42:28,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:42:28,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:42:29,295 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-10-02 11:42:30,164 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-10-02 11:42:31,862 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-10-02 11:42:32,132 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 567 574) the Hoare annotation is: true [2019-10-02 11:42:32,132 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 567 574) no Hoare annotation was computed. [2019-10-02 11:42:32,132 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 567 574) no Hoare annotation was computed. [2019-10-02 11:42:32,132 INFO L446 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 617 627) the Hoare annotation is: true [2019-10-02 11:42:32,133 INFO L446 ceAbstractionStarter]: At program point L623(line 623) the Hoare annotation is: true [2019-10-02 11:42:32,133 INFO L443 ceAbstractionStarter]: For program point L623-1(line 623) no Hoare annotation was computed. [2019-10-02 11:42:32,133 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteFINAL(lines 617 627) no Hoare annotation was computed. [2019-10-02 11:42:32,133 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 617 627) no Hoare annotation was computed. [2019-10-02 11:42:32,133 INFO L443 ceAbstractionStarter]: For program point L702(lines 702 727) no Hoare annotation was computed. [2019-10-02 11:42:32,134 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-02 11:42:32,134 INFO L439 ceAbstractionStarter]: At program point L700(lines 699 728) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0)) [2019-10-02 11:42:32,134 INFO L443 ceAbstractionStarter]: For program point L733-1(lines 729 735) no Hoare annotation was computed. [2019-10-02 11:42:32,134 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-02 11:42:32,134 INFO L443 ceAbstractionStarter]: For program point KbFilter_PowerEXIT(lines 688 743) no Hoare annotation was computed. [2019-10-02 11:42:32,134 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-02 11:42:32,135 INFO L443 ceAbstractionStarter]: For program point L705(lines 705 726) no Hoare annotation was computed. [2019-10-02 11:42:32,135 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 728) no Hoare annotation was computed. [2019-10-02 11:42:32,135 INFO L443 ceAbstractionStarter]: For program point KbFilter_PowerFINAL(lines 688 743) no Hoare annotation was computed. [2019-10-02 11:42:32,135 INFO L443 ceAbstractionStarter]: For program point L708(lines 708 725) no Hoare annotation was computed. [2019-10-02 11:42:32,135 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-02 11:42:32,135 INFO L443 ceAbstractionStarter]: For program point L739-1(line 739) no Hoare annotation was computed. [2019-10-02 11:42:32,135 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 42 55) no Hoare annotation was computed. [2019-10-02 11:42:32,136 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 42 55) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (<= ~s~0 1) (<= 1 ~s~0))) [2019-10-02 11:42:32,136 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 42 55) no Hoare annotation was computed. [2019-10-02 11:42:32,136 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 56 77) no Hoare annotation was computed. [2019-10-02 11:42:32,136 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 56 77) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,136 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 56 77) no Hoare annotation was computed. [2019-10-02 11:42:32,136 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 1008 1015) the Hoare annotation is: true [2019-10-02 11:42:32,136 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 1008 1015) no Hoare annotation was computed. [2019-10-02 11:42:32,136 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 1008 1015) no Hoare annotation was computed. [2019-10-02 11:42:32,137 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-02 11:42:32,137 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 456) no Hoare annotation was computed. [2019-10-02 11:42:32,137 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 294 465) no Hoare annotation was computed. [2019-10-02 11:42:32,137 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)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,137 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 438) no Hoare annotation was computed. [2019-10-02 11:42:32,137 INFO L443 ceAbstractionStarter]: For program point L399(line 399) no Hoare annotation was computed. [2019-10-02 11:42:32,137 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)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,137 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2019-10-02 11:42:32,138 INFO L439 ceAbstractionStarter]: At program point L375(lines 374 407) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,138 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 435) no Hoare annotation was computed. [2019-10-02 11:42:32,138 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 408) no Hoare annotation was computed. [2019-10-02 11:42:32,138 INFO L443 ceAbstractionStarter]: For program point L384(line 384) no Hoare annotation was computed. [2019-10-02 11:42:32,138 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 446) no Hoare annotation was computed. [2019-10-02 11:42:32,138 INFO L443 ceAbstractionStarter]: For program point L343(lines 329 412) no Hoare annotation was computed. [2019-10-02 11:42:32,138 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)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,138 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 294 465) no Hoare annotation was computed. [2019-10-02 11:42:32,139 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) (= ~MPR3~0 ~s~0) (= ~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)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,139 INFO L443 ceAbstractionStarter]: For program point L327-1(lines 323 464) no Hoare annotation was computed. [2019-10-02 11:42:32,139 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 411) no Hoare annotation was computed. [2019-10-02 11:42:32,139 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 294 465) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,139 INFO L443 ceAbstractionStarter]: For program point L394(line 394) no Hoare annotation was computed. [2019-10-02 11:42:32,139 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)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,140 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)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,140 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)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,140 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 409) no Hoare annotation was computed. [2019-10-02 11:42:32,140 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)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,140 INFO L443 ceAbstractionStarter]: For program point L453(lines 453 455) no Hoare annotation was computed. [2019-10-02 11:42:32,140 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)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,140 INFO L443 ceAbstractionStarter]: For program point L379(line 379) no Hoare annotation was computed. [2019-10-02 11:42:32,140 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 341) no Hoare annotation was computed. [2019-10-02 11:42:32,141 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)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (<= ~s~0 1) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2019-10-02 11:42:32,141 INFO L443 ceAbstractionStarter]: For program point L429(lines 413 462) no Hoare annotation was computed. [2019-10-02 11:42:32,141 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)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (<= ~s~0 1) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2019-10-02 11:42:32,141 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 407) no Hoare annotation was computed. [2019-10-02 11:42:32,141 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 459) no Hoare annotation was computed. [2019-10-02 11:42:32,141 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 426) no Hoare annotation was computed. [2019-10-02 11:42:32,141 INFO L443 ceAbstractionStarter]: For program point L389(line 389) no Hoare annotation was computed. [2019-10-02 11:42:32,142 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 418) no Hoare annotation was computed. [2019-10-02 11:42:32,142 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)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-02 11:42:32,142 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 458) no Hoare annotation was computed. [2019-10-02 11:42:32,142 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 410) no Hoare annotation was computed. [2019-10-02 11:42:32,142 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 548) no Hoare annotation was computed. [2019-10-02 11:42:32,142 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 498) no Hoare annotation was computed. [2019-10-02 11:42:32,143 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)) (let ((.cse1 (= ~s~0 ~MPR1~0)) (.cse2 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (and .cse1 .cse2 (= 259 IofCallDriver_~returnVal2~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and .cse2 (= 0 IofCallDriver_~returnVal2~0) .cse1) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and .cse1 .cse2 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)))))) [2019-10-02 11:42:32,143 INFO L439 ceAbstractionStarter]: At program point L490(line 490) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (<= ~s~0 1) (<= 1 ~s~0)) (not (<= 1 |old(~s~0)|))))) [2019-10-02 11:42:32,143 INFO L443 ceAbstractionStarter]: For program point L490-1(line 490) no Hoare annotation was computed. [2019-10-02 11:42:32,143 INFO L439 ceAbstractionStarter]: At program point L511(lines 510 525) 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 (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= ~s~0 ~MPR1~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))))) [2019-10-02 11:42:32,143 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 547) no Hoare annotation was computed. [2019-10-02 11:42:32,144 INFO L443 ceAbstractionStarter]: For program point L503(lines 503 526) no Hoare annotation was computed. [2019-10-02 11:42:32,144 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 538) no Hoare annotation was computed. [2019-10-02 11:42:32,144 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 (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (<= ~s~0 1) (<= 1 ~s~0)) (not (<= 1 |old(~s~0)|))))) [2019-10-02 11:42:32,144 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 480 552) no Hoare annotation was computed. [2019-10-02 11:42:32,144 INFO L439 ceAbstractionStarter]: At program point L545(line 545) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-10-02 11:42:32,144 INFO L443 ceAbstractionStarter]: For program point L545-1(lines 527 549) no Hoare annotation was computed. [2019-10-02 11:42:32,144 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 525) no Hoare annotation was computed. [2019-10-02 11:42:32,145 INFO L439 ceAbstractionStarter]: At program point L504(lines 503 526) 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 (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~s~0 ~MPR1~0)) (not (<= 1 |old(~s~0)|))))) [2019-10-02 11:42:32,145 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 480 552) no Hoare annotation was computed. [2019-10-02 11:42:32,145 INFO L439 ceAbstractionStarter]: At program point L496(line 496) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (<= 1 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (<= ~s~0 1) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-10-02 11:42:32,145 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 500) no Hoare annotation was computed. [2019-10-02 11:42:32,145 INFO L443 ceAbstractionStarter]: For program point L488-1(lines 488 500) no Hoare annotation was computed. [2019-10-02 11:42:32,145 INFO L439 ceAbstractionStarter]: At program point L509(lines 508 525) 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 (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 ~MPR1~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))))) [2019-10-02 11:42:32,146 INFO L439 ceAbstractionStarter]: At program point L474(line 474) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~setEventCalled~0)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-10-02 11:42:32,146 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 466 479) no Hoare annotation was computed. [2019-10-02 11:42:32,146 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 466 479) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 ~setEventCalled~0)) (and (<= 1 ~s~0) (<= ~s~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-10-02 11:42:32,146 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 466 479) no Hoare annotation was computed. [2019-10-02 11:42:32,146 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2019-10-02 11:42:32,146 INFO L443 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 744 820) no Hoare annotation was computed. [2019-10-02 11:42:32,146 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 815) no Hoare annotation was computed. [2019-10-02 11:42:32,147 INFO L443 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 744 820) no Hoare annotation was computed. [2019-10-02 11:42:32,147 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 816) no Hoare annotation was computed. [2019-10-02 11:42:32,147 INFO L443 ceAbstractionStarter]: For program point L759(lines 759 763) no Hoare annotation was computed. [2019-10-02 11:42:32,147 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-02 11:42:32,147 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-02 11:42:32,147 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-02 11:42:32,147 INFO L443 ceAbstractionStarter]: For program point L755-1(line 755) no Hoare annotation was computed. [2019-10-02 11:42:32,147 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-02 11:42:32,148 INFO L443 ceAbstractionStarter]: For program point L813-1(lines 792 817) no Hoare annotation was computed. [2019-10-02 11:42:32,148 INFO L439 ceAbstractionStarter]: At program point L776(lines 775 790) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-10-02 11:42:32,148 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 791) no Hoare annotation was computed. [2019-10-02 11:42:32,148 INFO L443 ceAbstractionStarter]: For program point L773(lines 773 790) no Hoare annotation was computed. [2019-10-02 11:42:32,148 INFO L439 ceAbstractionStarter]: At program point L769(lines 768 791) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-10-02 11:42:32,148 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-02 11:42:32,148 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 765) no Hoare annotation was computed. [2019-10-02 11:42:32,148 INFO L443 ceAbstractionStarter]: For program point L753-1(lines 753 765) no Hoare annotation was computed. [2019-10-02 11:42:32,149 INFO L439 ceAbstractionStarter]: At program point L774(lines 773 790) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0)) [2019-10-02 11:42:32,149 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 654) no Hoare annotation was computed. [2019-10-02 11:42:32,149 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-02 11:42:32,149 INFO L443 ceAbstractionStarter]: For program point KbFilter_CreateCloseEXIT(lines 628 663) no Hoare annotation was computed. [2019-10-02 11:42:32,149 INFO L443 ceAbstractionStarter]: For program point L659-1(line 659) no Hoare annotation was computed. [2019-10-02 11:42:32,149 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 653) no Hoare annotation was computed. [2019-10-02 11:42:32,149 INFO L443 ceAbstractionStarter]: For program point L637(lines 637 655) no Hoare annotation was computed. [2019-10-02 11:42:32,149 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-02 11:42:32,150 INFO L443 ceAbstractionStarter]: For program point KbFilter_CreateCloseFINAL(lines 628 663) no Hoare annotation was computed. [2019-10-02 11:42:32,150 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-02 11:42:32,150 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-02 11:42:32,150 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:42:32,150 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~s~0 |old(~s~0)|) [2019-10-02 11:42:32,150 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:42:32,150 INFO L443 ceAbstractionStarter]: For program point L923(lines 923 975) no Hoare annotation was computed. [2019-10-02 11:42:32,150 INFO L443 ceAbstractionStarter]: For program point L890(lines 890 985) no Hoare annotation was computed. [2019-10-02 11:42:32,151 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 987) no Hoare annotation was computed. [2019-10-02 11:42:32,151 INFO L443 ceAbstractionStarter]: For program point KbFilter_InternIoCtlEXIT(lines 821 1006) no Hoare annotation was computed. [2019-10-02 11:42:32,151 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 989) no Hoare annotation was computed. [2019-10-02 11:42:32,151 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-02 11:42:32,151 INFO L443 ceAbstractionStarter]: For program point L1002-1(line 1002) no Hoare annotation was computed. [2019-10-02 11:42:32,151 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 983) no Hoare annotation was computed. [2019-10-02 11:42:32,151 INFO L439 ceAbstractionStarter]: At program point L891(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-02 11:42:32,151 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 977) no Hoare annotation was computed. [2019-10-02 11:42:32,152 INFO L439 ceAbstractionStarter]: At program point L883(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-02 11:42:32,152 INFO L443 ceAbstractionStarter]: For program point L933(lines 933 972) no Hoare annotation was computed. [2019-10-02 11:42:32,152 INFO L443 ceAbstractionStarter]: For program point L958-1(lines 958 960) no Hoare annotation was computed. [2019-10-02 11:42:32,152 INFO L443 ceAbstractionStarter]: For program point L909(lines 909 979) no Hoare annotation was computed. [2019-10-02 11:42:32,152 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-02 11:42:32,152 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-02 11:42:32,152 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-02 11:42:32,152 INFO L443 ceAbstractionStarter]: For program point L996-1(line 996) no Hoare annotation was computed. [2019-10-02 11:42:32,153 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 973) no Hoare annotation was computed. [2019-10-02 11:42:32,153 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 957) no Hoare annotation was computed. [2019-10-02 11:42:32,153 INFO L443 ceAbstractionStarter]: For program point L955-2(lines 933 970) no Hoare annotation was computed. [2019-10-02 11:42:32,153 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-02 11:42:32,153 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 942) no Hoare annotation was computed. [2019-10-02 11:42:32,153 INFO L443 ceAbstractionStarter]: For program point L902(lines 902 981) no Hoare annotation was computed. [2019-10-02 11:42:32,153 INFO L443 ceAbstractionStarter]: For program point KbFilter_InternIoCtlFINAL(lines 821 1006) no Hoare annotation was computed. [2019-10-02 11:42:32,153 INFO L439 ceAbstractionStarter]: At program point L605(lines 604 614) the Hoare annotation is: (let ((.cse1 (= 1 ~pended~0))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (and (not .cse1) (= ~s~0 ~NP~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1)))))) [2019-10-02 11:42:32,154 INFO L439 ceAbstractionStarter]: At program point L603(lines 602 614) the Hoare annotation is: (let ((.cse1 (= 1 ~pended~0))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (and (not .cse1) (= ~s~0 ~NP~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1)))))) [2019-10-02 11:42:32,154 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 575 616) no Hoare annotation was computed. [2019-10-02 11:42:32,154 INFO L439 ceAbstractionStarter]: At program point L595(line 595) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))))) [2019-10-02 11:42:32,154 INFO L443 ceAbstractionStarter]: For program point L593(lines 593 597) no Hoare annotation was computed. [2019-10-02 11:42:32,154 INFO L443 ceAbstractionStarter]: For program point L593-1(lines 580 599) no Hoare annotation was computed. [2019-10-02 11:42:32,154 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-10-02 11:42:32,154 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 575 616) no Hoare annotation was computed. [2019-10-02 11:42:32,154 INFO L443 ceAbstractionStarter]: For program point L602(lines 602 614) no Hoare annotation was computed. [2019-10-02 11:42:32,155 INFO L439 ceAbstractionStarter]: At program point L588(lines 580 599) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 (= ~s~0 ~NP~0)) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) (not (<= |old(~setEventCalled~0)| 1))))) [2019-10-02 11:42:32,155 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 575 616) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0)))) (and (or (= ~s~0 ~NP~0) .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) (and (= ~MPR3~0 ~s~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= |old(~setEventCalled~0)| 1))))) [2019-10-02 11:42:32,155 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 599) no Hoare annotation was computed. [2019-10-02 11:42:32,155 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-02 11:42:32,155 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 553 566) no Hoare annotation was computed. [2019-10-02 11:42:32,155 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 563) no Hoare annotation was computed. [2019-10-02 11:42:32,156 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-02 11:42:32,156 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 553 566) no Hoare annotation was computed. [2019-10-02 11:42:32,156 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:42:32,156 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) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) [2019-10-02 11:42:32,156 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:42:32,156 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:42:32,156 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-02 11:42:32,156 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 679) no Hoare annotation was computed. [2019-10-02 11:42:32,157 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-02 11:42:32,157 INFO L443 ceAbstractionStarter]: For program point L683-1(line 683) no Hoare annotation was computed. [2019-10-02 11:42:32,157 INFO L443 ceAbstractionStarter]: For program point KbFilter_DispatchPassThroughFINAL(lines 664 687) no Hoare annotation was computed. [2019-10-02 11:42:32,157 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-02 11:42:32,157 INFO L443 ceAbstractionStarter]: For program point L677-1(lines 673 679) no Hoare annotation was computed. [2019-10-02 11:42:32,157 INFO L443 ceAbstractionStarter]: For program point KbFilter_DispatchPassThroughEXIT(lines 664 687) no Hoare annotation was computed. [2019-10-02 11:42:32,157 INFO L439 ceAbstractionStarter]: At program point L217(line 217) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-10-02 11:42:32,157 INFO L439 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-10-02 11:42:32,158 INFO L443 ceAbstractionStarter]: For program point L242-1(lines 238 244) no Hoare annotation was computed. [2019-10-02 11:42:32,158 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 188) no Hoare annotation was computed. [2019-10-02 11:42:32,158 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 278) no Hoare annotation was computed. [2019-10-02 11:42:32,158 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 289) no Hoare annotation was computed. [2019-10-02 11:42:32,158 INFO L439 ceAbstractionStarter]: At program point L226(line 226) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-10-02 11:42:32,158 INFO L439 ceAbstractionStarter]: At program point L193(lines 193 194) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (<= 1 ~compRegistered~0) (= KbFilter_PnP_~status~0 0) (<= ~s~0 1) (<= 1 ~s~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-10-02 11:42:32,158 INFO L443 ceAbstractionStarter]: For program point L226-1(lines 222 228) no Hoare annotation was computed. [2019-10-02 11:42:32,158 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 193 194) no Hoare annotation was computed. [2019-10-02 11:42:32,159 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 275) no Hoare annotation was computed. [2019-10-02 11:42:32,159 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 286) no Hoare annotation was computed. [2019-10-02 11:42:32,159 INFO L439 ceAbstractionStarter]: At program point L111(lines 110 289) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-10-02 11:42:32,159 INFO L446 ceAbstractionStarter]: At program point L268(lines 171 269) the Hoare annotation is: true [2019-10-02 11:42:32,159 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 272) no Hoare annotation was computed. [2019-10-02 11:42:32,159 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 283) no Hoare annotation was computed. [2019-10-02 11:42:32,159 INFO L439 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-10-02 11:42:32,159 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 80 293) no Hoare annotation was computed. [2019-10-02 11:42:32,160 INFO L439 ceAbstractionStarter]: At program point L170(lines 116 287) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-10-02 11:42:32,160 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 280) no Hoare annotation was computed. [2019-10-02 11:42:32,160 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 277) no Hoare annotation was computed. [2019-10-02 11:42:32,160 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 288) no Hoare annotation was computed. [2019-10-02 11:42:32,160 INFO L439 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 80 293) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= 0 ~compRegistered~0) (<= ~s~0 1) (<= 1 ~s~0))) [2019-10-02 11:42:32,160 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPFINAL(lines 80 293) no Hoare annotation was computed. [2019-10-02 11:42:32,160 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 274) no Hoare annotation was computed. [2019-10-02 11:42:32,160 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 285) no Hoare annotation was computed. [2019-10-02 11:42:32,161 INFO L439 ceAbstractionStarter]: At program point L114(lines 113 288) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) [2019-10-02 11:42:32,161 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-10-02 11:42:32,161 INFO L439 ceAbstractionStarter]: At program point L263(lines 263 264) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 1 |old(~s~0)|))) [2019-10-02 11:42:32,161 INFO L443 ceAbstractionStarter]: For program point L263-1(lines 263 264) no Hoare annotation was computed. [2019-10-02 11:42:32,161 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 271) no Hoare annotation was computed. [2019-10-02 11:42:32,161 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 282) no Hoare annotation was computed. [2019-10-02 11:42:32,161 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 228) no Hoare annotation was computed. [2019-10-02 11:42:32,161 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2019-10-02 11:42:32,161 INFO L443 ceAbstractionStarter]: For program point L181-1(lines 176 188) no Hoare annotation was computed. [2019-10-02 11:42:32,162 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 212) no Hoare annotation was computed. [2019-10-02 11:42:32,162 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 279) no Hoare annotation was computed. [2019-10-02 11:42:32,162 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 290) no Hoare annotation was computed. [2019-10-02 11:42:32,162 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 204) no Hoare annotation was computed. [2019-10-02 11:42:32,162 INFO L443 ceAbstractionStarter]: For program point L198-2(lines 171 267) no Hoare annotation was computed. [2019-10-02 11:42:32,162 INFO L439 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 1 |old(~s~0)|))) [2019-10-02 11:42:32,162 INFO L443 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2019-10-02 11:42:32,162 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 276) no Hoare annotation was computed. [2019-10-02 11:42:32,162 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 287) no Hoare annotation was computed. [2019-10-02 11:42:32,162 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 211) no Hoare annotation was computed. [2019-10-02 11:42:32,163 INFO L439 ceAbstractionStarter]: At program point L108(lines 107 290) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= 0 ~compRegistered~0) (= KbFilter_PnP_~status~0 0) (<= 1 ~s~0) (<= ~s~0 1))) [2019-10-02 11:42:32,163 INFO L439 ceAbstractionStarter]: At program point L232(lines 232 233) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 1 |old(~s~0)|))) [2019-10-02 11:42:32,163 INFO L443 ceAbstractionStarter]: For program point L232-1(lines 232 233) no Hoare annotation was computed. [2019-10-02 11:42:32,163 INFO L439 ceAbstractionStarter]: At program point L257(line 257) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-10-02 11:42:32,163 INFO L443 ceAbstractionStarter]: For program point L257-1(lines 253 259) no Hoare annotation was computed. [2019-10-02 11:42:32,163 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 273) no Hoare annotation was computed. [2019-10-02 11:42:32,163 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 284) no Hoare annotation was computed. [2019-10-02 11:42:32,164 INFO L439 ceAbstractionStarter]: At program point L183(line 183) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-10-02 11:42:32,164 INFO L439 ceAbstractionStarter]: At program point L200(lines 200 202) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= ~s~0 ~NP~0) .cse0) (not (= |old(~compRegistered~0)| 0)) (and (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)))) [2019-10-02 11:42:32,164 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 270) no Hoare annotation was computed. [2019-10-02 11:42:32,164 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 200 202) no Hoare annotation was computed. [2019-10-02 11:42:32,164 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 281) no Hoare annotation was computed. [2019-10-02 11:42:32,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:42:32 BoogieIcfgContainer [2019-10-02 11:42:32,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:42:32,213 INFO L168 Benchmark]: Toolchain (without parser) took 9902.84 ms. Allocated memory was 134.7 MB in the beginning and 353.4 MB in the end (delta: 218.6 MB). Free memory was 89.4 MB in the beginning and 195.9 MB in the end (delta: -106.4 MB). Peak memory consumption was 227.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:32,213 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 134.7 MB. Free memory is still 108.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 11:42:32,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.21 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 89.4 MB in the beginning and 171.6 MB in the end (delta: -82.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:32,218 INFO L168 Benchmark]: Boogie Preprocessor took 86.45 ms. Allocated memory is still 201.3 MB. Free memory was 171.6 MB in the beginning and 168.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:32,219 INFO L168 Benchmark]: RCFGBuilder took 1125.77 ms. Allocated memory is still 201.3 MB. Free memory was 168.8 MB in the beginning and 97.9 MB in the end (delta: 71.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:32,221 INFO L168 Benchmark]: TraceAbstraction took 8115.74 ms. Allocated memory was 201.3 MB in the beginning and 353.4 MB in the end (delta: 152.0 MB). Free memory was 97.9 MB in the beginning and 195.9 MB in the end (delta: -98.0 MB). Peak memory consumption was 168.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:42:32,226 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.51 ms. Allocated memory is still 134.7 MB. Free memory is still 108.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 570.21 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 89.4 MB in the beginning and 171.6 MB in the end (delta: -82.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.45 ms. Allocated memory is still 201.3 MB. Free memory was 171.6 MB in the beginning and 168.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1125.77 ms. Allocated memory is still 201.3 MB. Free memory was 168.8 MB in the beginning and 97.9 MB in the end (delta: 71.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8115.74 ms. Allocated memory was 201.3 MB in the beginning and 353.4 MB in the end (delta: 152.0 MB). Free memory was 97.9 MB in the beginning and 195.9 MB in the end (delta: -98.0 MB). Peak memory consumption was 168.9 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))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || (((((((!(1 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && 0 <= status) && s <= 1) && 1 <= s) && NP + 4 <= 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: ((((((!(NP + 5 <= MPR3) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(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))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((!(NP + 5 <= MPR3) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 <= \old(s))) || (((0 == compRegistered && status == 0) && 1 <= s) && s <= 1) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || s == NP) && ((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1)) - 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))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - 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))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) && (((((((!(NP + 5 <= MPR3) || 1 == pended) || !(NP + 4 <= MPR1)) || (((s == MPR1 && __cil_tmp7 + 1073741802 == 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 <= \old(s))) - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - 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))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) && (((((((!(NP + 5 <= MPR3) || (s == MPR1 && __cil_tmp7 + 1073741802 == 0)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(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))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - 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))) || !(\old(s) == \old(MPR3)) - 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))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || 0 <= status) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - 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: 882]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((!(NP + 5 <= MPR3) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 <= \old(s))) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) && (((((((!(NP + 5 <= MPR3) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(NP <= 1)) || (__cil_tmp7 + 1073741802 == 0 && s == MPR1)) || !(1 <= \old(s))) - 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))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 775]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || s == NP - InvariantResult [Line: 699]: 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) && (((((((((((((s == MPR1 && __cil_tmp7 + 1073741802 == 0) && 259 == returnVal2) && 1 <= setEventCalled) && setEventCalled <= 1) || !(NP + 5 <= MPR3)) || ((__cil_tmp7 + 1073741802 == 0 && 0 == returnVal2) && s == MPR1)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || ((s == MPR1 && __cil_tmp7 + 1073741802 == 0) && returnVal2 + 1073741823 <= 0)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(1 <= \old(s))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((!(NP + 5 <= MPR3) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(\old(s) <= NP)) || !(NP <= 1)) || !(1 <= \old(s))) || (s == NP && 0 == compRegistered) - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: (((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) && (((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1)) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: (((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) && (((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(\old(setEventCalled) <= 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 239 locations, 1 error locations. SAFE Result, 7.9s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 2944 SDtfs, 1643 SDslu, 3427 SDs, 0 SdLazy, 700 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 330 PreInvPairs, 403 NumberOfFragments, 2652 HoareAnnotationTreeSize, 330 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 84 FomulaSimplificationsInter, 2094 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 90456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...