java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:01:16,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:01:16,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:01:16,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:01:16,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:01:16,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:01:16,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:01:16,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:01:16,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:01:16,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:01:16,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:01:16,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:01:16,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:01:16,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:01:16,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:01:16,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:01:16,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:01:16,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:01:16,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:01:16,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:01:16,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:01:16,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:01:16,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:01:16,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:01:16,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:01:16,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:01:16,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:01:16,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:01:16,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:01:16,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:01:16,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:01:16,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:01:16,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:01:16,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:01:16,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:01:16,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:01:16,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:01:16,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:01:16,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:01:16,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:01:16,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:01:16,508 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-13 23:01:16,528 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:01:16,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:01:16,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:01:16,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:01:16,533 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:01:16,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:01:16,534 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:01:16,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:01:16,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:01:16,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:01:16,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:01:16,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:01:16,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:01:16,536 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:01:16,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:01:16,537 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:01:16,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:01:16,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:01:16,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:01:16,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:01:16,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:01:16,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:01:16,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:01:16,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:01:16,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:01:16,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:01:16,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:01:16,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:01:16,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:01:16,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:01:16,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:01:16,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:01:16,867 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:01:16,868 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:01:16,868 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-10-13 23:01:16,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55a91aed/4b8d1de2d5c348708fa9b5740541b078/FLAG7f7946f03 [2019-10-13 23:01:17,381 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:01:17,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-10-13 23:01:17,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55a91aed/4b8d1de2d5c348708fa9b5740541b078/FLAG7f7946f03 [2019-10-13 23:01:17,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55a91aed/4b8d1de2d5c348708fa9b5740541b078 [2019-10-13 23:01:17,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:01:17,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:01:17,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:17,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:01:17,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:01:17,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:17" (1/1) ... [2019-10-13 23:01:17,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37409b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:17, skipping insertion in model container [2019-10-13 23:01:17,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:17" (1/1) ... [2019-10-13 23:01:17,729 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:01:17,776 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:01:17,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:18,002 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:01:18,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:18,148 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:01:18,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18 WrapperNode [2019-10-13 23:01:18,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:18,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:01:18,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:01:18,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:01:18,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (1/1) ... [2019-10-13 23:01:18,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:01:18,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:01:18,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:01:18,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:01:18,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (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-13 23:01:18,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:01:18,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:01:18,260 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-13 23:01:18,260 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-13 23:01:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-10-13 23:01:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:01:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-13 23:01:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-13 23:01:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-13 23:01:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-13 23:01:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-13 23:01:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-10-13 23:01:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-13 23:01:18,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:01:18,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:01:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:01:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 23:01:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 23:01:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-10-13 23:01:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-13 23:01:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-13 23:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-13 23:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-10-13 23:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-13 23:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-13 23:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-13 23:01:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-13 23:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-13 23:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:01:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:01:18,537 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:18,645 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-10-13 23:01:18,646 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-10-13 23:01:18,647 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:18,683 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2019-10-13 23:01:18,683 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2019-10-13 23:01:18,696 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:18,717 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-13 23:01:18,717 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-13 23:01:18,734 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:18,929 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-10-13 23:01:18,930 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-10-13 23:01:19,305 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:01:19,306 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:01:19,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:19 BoogieIcfgContainer [2019-10-13 23:01:19,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:01:19,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:01:19,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:01:19,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:01:19,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:01:17" (1/3) ... [2019-10-13 23:01:19,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec3a411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:19, skipping insertion in model container [2019-10-13 23:01:19,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:18" (2/3) ... [2019-10-13 23:01:19,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec3a411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:19, skipping insertion in model container [2019-10-13 23:01:19,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:19" (3/3) ... [2019-10-13 23:01:19,315 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-10-13 23:01:19,325 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:01:19,333 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:01:19,344 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:01:19,372 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:01:19,372 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:01:19,372 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:01:19,372 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:01:19,373 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:01:19,373 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:01:19,373 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:01:19,373 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:01:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2019-10-13 23:01:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 23:01:19,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:19,401 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:19,403 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:19,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:19,409 INFO L82 PathProgramCache]: Analyzing trace with hash 34539051, now seen corresponding path program 1 times [2019-10-13 23:01:19,417 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:19,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101274875] [2019-10-13 23:01:19,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:19,666 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-13 23:01:19,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101274875] [2019-10-13 23:01:19,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:19,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:19,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097834447] [2019-10-13 23:01:19,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:19,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:19,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:19,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:19,687 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2019-10-13 23:01:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:19,749 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2019-10-13 23:01:19,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:19,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 23:01:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:19,764 INFO L225 Difference]: With dead ends: 182 [2019-10-13 23:01:19,764 INFO L226 Difference]: Without dead ends: 99 [2019-10-13 23:01:19,768 INFO L600 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-13 23:01:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-13 23:01:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-10-13 23:01:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-13 23:01:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2019-10-13 23:01:19,823 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 18 [2019-10-13 23:01:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:19,824 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2019-10-13 23:01:19,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2019-10-13 23:01:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 23:01:19,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:19,826 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:19,827 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:19,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:19,828 INFO L82 PathProgramCache]: Analyzing trace with hash -422963892, now seen corresponding path program 1 times [2019-10-13 23:01:19,828 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:19,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466015637] [2019-10-13 23:01:19,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,031 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-13 23:01:20,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466015637] [2019-10-13 23:01:20,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:20,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495136460] [2019-10-13 23:01:20,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:20,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:20,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:20,040 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand 3 states. [2019-10-13 23:01:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:20,175 INFO L93 Difference]: Finished difference Result 164 states and 205 transitions. [2019-10-13 23:01:20,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:20,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 23:01:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:20,180 INFO L225 Difference]: With dead ends: 164 [2019-10-13 23:01:20,180 INFO L226 Difference]: Without dead ends: 118 [2019-10-13 23:01:20,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-13 23:01:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2019-10-13 23:01:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-13 23:01:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2019-10-13 23:01:20,216 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 21 [2019-10-13 23:01:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:20,217 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2019-10-13 23:01:20,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2019-10-13 23:01:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 23:01:20,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:20,221 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:20,221 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:20,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:20,221 INFO L82 PathProgramCache]: Analyzing trace with hash -226967532, now seen corresponding path program 1 times [2019-10-13 23:01:20,222 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:20,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833663745] [2019-10-13 23:01:20,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,304 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-13 23:01:20,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833663745] [2019-10-13 23:01:20,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:20,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761361616] [2019-10-13 23:01:20,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:20,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:20,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:20,308 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand 3 states. [2019-10-13 23:01:20,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:20,356 INFO L93 Difference]: Finished difference Result 195 states and 239 transitions. [2019-10-13 23:01:20,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:20,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 23:01:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:20,362 INFO L225 Difference]: With dead ends: 195 [2019-10-13 23:01:20,362 INFO L226 Difference]: Without dead ends: 154 [2019-10-13 23:01:20,363 INFO L600 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-13 23:01:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-13 23:01:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 110. [2019-10-13 23:01:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-13 23:01:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2019-10-13 23:01:20,395 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 22 [2019-10-13 23:01:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:20,395 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2019-10-13 23:01:20,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2019-10-13 23:01:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 23:01:20,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:20,397 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:20,398 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:20,398 INFO L82 PathProgramCache]: Analyzing trace with hash 534365083, now seen corresponding path program 1 times [2019-10-13 23:01:20,398 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:20,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210746878] [2019-10-13 23:01:20,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,475 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-13 23:01:20,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210746878] [2019-10-13 23:01:20,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:01:20,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254875421] [2019-10-13 23:01:20,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:01:20,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:01:20,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:01:20,478 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand 4 states. [2019-10-13 23:01:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:20,624 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2019-10-13 23:01:20,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:20,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-13 23:01:20,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:20,627 INFO L225 Difference]: With dead ends: 113 [2019-10-13 23:01:20,627 INFO L226 Difference]: Without dead ends: 110 [2019-10-13 23:01:20,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-13 23:01:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-10-13 23:01:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-13 23:01:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2019-10-13 23:01:20,644 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 30 [2019-10-13 23:01:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:20,644 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2019-10-13 23:01:20,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:01:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2019-10-13 23:01:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 23:01:20,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:20,647 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:20,647 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1733019036, now seen corresponding path program 1 times [2019-10-13 23:01:20,648 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:20,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300042177] [2019-10-13 23:01:20,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,649 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,723 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-13 23:01:20,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300042177] [2019-10-13 23:01:20,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:01:20,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446716864] [2019-10-13 23:01:20,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:01:20,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:01:20,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:20,726 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand 6 states. [2019-10-13 23:01:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:20,893 INFO L93 Difference]: Finished difference Result 172 states and 206 transitions. [2019-10-13 23:01:20,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:20,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-13 23:01:20,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:20,896 INFO L225 Difference]: With dead ends: 172 [2019-10-13 23:01:20,896 INFO L226 Difference]: Without dead ends: 125 [2019-10-13 23:01:20,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-13 23:01:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2019-10-13 23:01:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-13 23:01:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2019-10-13 23:01:20,908 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 36 [2019-10-13 23:01:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:20,908 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2019-10-13 23:01:20,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:01:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2019-10-13 23:01:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:20,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:20,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:20,911 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:20,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:20,911 INFO L82 PathProgramCache]: Analyzing trace with hash -433086729, now seen corresponding path program 1 times [2019-10-13 23:01:20,911 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:20,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965937858] [2019-10-13 23:01:20,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,956 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-13 23:01:20,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965937858] [2019-10-13 23:01:20,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:20,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182124567] [2019-10-13 23:01:20,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:20,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:20,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:20,959 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand 3 states. [2019-10-13 23:01:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,013 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2019-10-13 23:01:21,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:21,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-13 23:01:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,015 INFO L225 Difference]: With dead ends: 153 [2019-10-13 23:01:21,015 INFO L226 Difference]: Without dead ends: 106 [2019-10-13 23:01:21,016 INFO L600 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-13 23:01:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-13 23:01:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-10-13 23:01:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-13 23:01:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2019-10-13 23:01:21,028 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 42 [2019-10-13 23:01:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,028 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2019-10-13 23:01:21,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2019-10-13 23:01:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:01:21,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,030 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:21,031 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2027529343, now seen corresponding path program 1 times [2019-10-13 23:01:21,031 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356806518] [2019-10-13 23:01:21,032 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,032 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,110 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-13 23:01:21,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356806518] [2019-10-13 23:01:21,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:21,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853809966] [2019-10-13 23:01:21,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:21,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:21,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:21,114 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 7 states. [2019-10-13 23:01:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,166 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2019-10-13 23:01:21,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:01:21,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-13 23:01:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,170 INFO L225 Difference]: With dead ends: 115 [2019-10-13 23:01:21,170 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 23:01:21,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 23:01:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-13 23:01:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 23:01:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-10-13 23:01:21,179 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 41 [2019-10-13 23:01:21,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,179 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-10-13 23:01:21,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-10-13 23:01:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 23:01:21,185 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,186 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:21,186 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1231135340, now seen corresponding path program 1 times [2019-10-13 23:01:21,187 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376445865] [2019-10-13 23:01:21,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,278 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-13 23:01:21,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376445865] [2019-10-13 23:01:21,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:21,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701292604] [2019-10-13 23:01:21,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:21,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:21,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:21,282 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 5 states. [2019-10-13 23:01:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,384 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-10-13 23:01:21,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:21,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-13 23:01:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,387 INFO L225 Difference]: With dead ends: 81 [2019-10-13 23:01:21,388 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 23:01:21,388 INFO L600 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-13 23:01:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 23:01:21,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-13 23:01:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 23:01:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-13 23:01:21,396 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 48 [2019-10-13 23:01:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,397 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-13 23:01:21,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-13 23:01:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 23:01:21,399 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,400 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:21,400 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,401 INFO L82 PathProgramCache]: Analyzing trace with hash -936739084, now seen corresponding path program 1 times [2019-10-13 23:01:21,401 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403526990] [2019-10-13 23:01:21,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,508 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-13 23:01:21,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403526990] [2019-10-13 23:01:21,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:21,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650792026] [2019-10-13 23:01:21,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:21,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:21,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:21,511 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2019-10-13 23:01:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,655 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-10-13 23:01:21,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:21,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-10-13 23:01:21,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,656 INFO L225 Difference]: With dead ends: 67 [2019-10-13 23:01:21,656 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 23:01:21,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 23:01:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-13 23:01:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 23:01:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-10-13 23:01:21,668 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 49 [2019-10-13 23:01:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,668 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-10-13 23:01:21,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-10-13 23:01:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:21,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,670 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:21,670 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1166632459, now seen corresponding path program 1 times [2019-10-13 23:01:21,671 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944950261] [2019-10-13 23:01:21,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,761 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-13 23:01:21,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944950261] [2019-10-13 23:01:21,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:21,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325323078] [2019-10-13 23:01:21,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:21,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:21,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:21,764 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 7 states. [2019-10-13 23:01:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,838 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-10-13 23:01:21,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:21,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-10-13 23:01:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,839 INFO L225 Difference]: With dead ends: 65 [2019-10-13 23:01:21,839 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 23:01:21,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 23:01:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-10-13 23:01:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 23:01:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 51 transitions. [2019-10-13 23:01:21,844 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 51 transitions. Word has length 50 [2019-10-13 23:01:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,845 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 51 transitions. [2019-10-13 23:01:21,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 51 transitions. [2019-10-13 23:01:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:01:21,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,846 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:21,846 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1568222522, now seen corresponding path program 1 times [2019-10-13 23:01:21,847 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419687819] [2019-10-13 23:01:21,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,893 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-13 23:01:21,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419687819] [2019-10-13 23:01:21,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:21,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302572793] [2019-10-13 23:01:21,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:21,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:21,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:21,895 INFO L87 Difference]: Start difference. First operand 52 states and 51 transitions. Second operand 3 states. [2019-10-13 23:01:21,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,906 INFO L93 Difference]: Finished difference Result 52 states and 51 transitions. [2019-10-13 23:01:21,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:21,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-13 23:01:21,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,907 INFO L225 Difference]: With dead ends: 52 [2019-10-13 23:01:21,907 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 23:01:21,909 INFO L600 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-13 23:01:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 23:01:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 23:01:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 23:01:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 23:01:21,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-10-13 23:01:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,910 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 23:01:21,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 23:01:21,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 23:01:21,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 23:01:23,796 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 514 521) the Hoare annotation is: true [2019-10-13 23:01:23,796 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 514 521) no Hoare annotation was computed. [2019-10-13 23:01:23,797 INFO L446 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 564 574) the Hoare annotation is: true [2019-10-13 23:01:23,797 INFO L446 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: true [2019-10-13 23:01:23,797 INFO L443 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2019-10-13 23:01:23,797 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 564 574) no Hoare annotation was computed. [2019-10-13 23:01:23,797 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 36 49) no Hoare annotation was computed. [2019-10-13 23:01:23,798 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 36 49) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,798 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 50 71) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0))) [2019-10-13 23:01:23,798 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 50 71) no Hoare annotation was computed. [2019-10-13 23:01:23,799 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 576 583) the Hoare annotation is: true [2019-10-13 23:01:23,799 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-10-13 23:01:23,799 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 576 583) no Hoare annotation was computed. [2019-10-13 23:01:23,799 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 287 421) no Hoare annotation was computed. [2019-10-13 23:01:23,799 INFO L439 ceAbstractionStarter]: At program point L399(line 399) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-13 23:01:23,799 INFO L443 ceAbstractionStarter]: For program point L358(line 358) no Hoare annotation was computed. [2019-10-13 23:01:23,800 INFO L439 ceAbstractionStarter]: At program point L383(lines 376 416) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= 0 ~pended~0) (or (= 0 main_~__cil_tmp8~0) (= 1 main_~__cil_tmp8~0)) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-13 23:01:23,800 INFO L439 ceAbstractionStarter]: At program point L375(lines 368 417) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= 0 ~pended~0) (or (= 0 main_~__cil_tmp8~0) (= 1 main_~__cil_tmp8~0)) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-13 23:01:23,800 INFO L443 ceAbstractionStarter]: For program point L384(lines 368 417) no Hoare annotation was computed. [2019-10-13 23:01:23,800 INFO L439 ceAbstractionStarter]: At program point L351(lines 351 366) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (or (= 0 main_~__cil_tmp8~0) (= 1 main_~__cil_tmp8~0)) (= 0 ~compRegistered~0) (< 0 (+ main_~status~1 1)) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-13 23:01:23,800 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 287 421) no Hoare annotation was computed. [2019-10-13 23:01:23,801 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 414) no Hoare annotation was computed. [2019-10-13 23:01:23,801 INFO L439 ceAbstractionStarter]: At program point L352(lines 351 366) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (or (= 0 main_~__cil_tmp8~0) (= 1 main_~__cil_tmp8~0)) (= 0 ~compRegistered~0) (< 0 (+ main_~status~1 1)) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-13 23:01:23,801 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 287 421) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0))) [2019-10-13 23:01:23,801 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-10-13 23:01:23,801 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2019-10-13 23:01:23,802 INFO L443 ceAbstractionStarter]: For program point L336(lines 322 367) no Hoare annotation was computed. [2019-10-13 23:01:23,802 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 413) no Hoare annotation was computed. [2019-10-13 23:01:23,802 INFO L439 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (or (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~MPR3~0 ~s~0) (< 0 (+ main_~status~1 1)) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-13 23:01:23,802 INFO L443 ceAbstractionStarter]: For program point L320-1(lines 296 420) no Hoare annotation was computed. [2019-10-13 23:01:23,802 INFO L439 ceAbstractionStarter]: At program point L395(lines 386 413) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= 0 ~pended~0) (or (= 0 main_~__cil_tmp8~0) (= 1 main_~__cil_tmp8~0)) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-13 23:01:23,802 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-10-13 23:01:23,802 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 390) no Hoare annotation was computed. [2019-10-13 23:01:23,803 INFO L439 ceAbstractionStarter]: At program point L322(lines 296 420) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= 0 ~pended~0) (or (= 0 main_~__cil_tmp8~0) (= 1 main_~__cil_tmp8~0)) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-13 23:01:23,803 INFO L443 ceAbstractionStarter]: For program point L339-1(lines 338 348) no Hoare annotation was computed. [2019-10-13 23:01:23,803 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. [2019-10-13 23:01:23,803 INFO L439 ceAbstractionStarter]: At program point L331-2(lines 331 334) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (< 0 (+ main_~status~1 1)) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-10-13 23:01:23,803 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-10-13 23:01:23,804 INFO L439 ceAbstractionStarter]: At program point L444-1(lines 444 447) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse3 (= ~compRegistered~0 0)) (.cse1 (not (= 0 ~pended~0))) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (= |old(~s~0)| ~NP~0)) (and (= ~s~0 ~MPR1~0) (= ~setEventCalled~0 1)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 .cse3) (or .cse0 (not .cse3) (not (= ~SKIP1~0 |old(~s~0)|)) .cse1 (= ~SKIP1~0 ~s~0) .cse2))) [2019-10-13 23:01:23,804 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 495) no Hoare annotation was computed. [2019-10-13 23:01:23,804 INFO L439 ceAbstractionStarter]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse2 (not (= 0 ~pended~0))) (.cse3 (not (<= 3 ~SKIP1~0))) (.cse1 (= ~compRegistered~0 0))) (and (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 .cse3) (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) .cse0 .cse2 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse3 .cse1))) [2019-10-13 23:01:23,804 INFO L443 ceAbstractionStarter]: For program point L445-1(line 445) no Hoare annotation was computed. [2019-10-13 23:01:23,804 INFO L439 ceAbstractionStarter]: At program point L470(lines 443 498) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse3 (= ~compRegistered~0 0)) (.cse1 (not (= 0 ~pended~0))) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (= |old(~s~0)| ~NP~0)) (and (= ~s~0 ~MPR1~0) (= ~setEventCalled~0 1)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 .cse3) (or .cse0 (not .cse3) (not (= ~SKIP1~0 |old(~s~0)|)) .cse1 (= ~SKIP1~0 ~s~0) .cse2))) [2019-10-13 23:01:23,804 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 436 499) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse3 (= ~compRegistered~0 0)) (.cse1 (not (= 0 ~pended~0))) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 .cse3) (or .cse0 (not .cse3) (not (= ~SKIP1~0 |old(~s~0)|)) .cse1 (= ~SKIP1~0 ~s~0) .cse2))) [2019-10-13 23:01:23,805 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 494) no Hoare annotation was computed. [2019-10-13 23:01:23,805 INFO L439 ceAbstractionStarter]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse3 (= ~compRegistered~0 0)) (.cse1 (not (= 0 ~pended~0))) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (= |old(~s~0)| ~NP~0)) .cse0 (and (= ~s~0 ~NP~0) (= ~setEventCalled~0 1)) .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 .cse3) (or .cse0 (not .cse3) (not (= ~SKIP1~0 |old(~s~0)|)) .cse1 .cse2))) [2019-10-13 23:01:23,805 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 436 499) no Hoare annotation was computed. [2019-10-13 23:01:23,805 INFO L439 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse3 (= ~compRegistered~0 0)) (.cse1 (not (= 0 ~pended~0))) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (= |old(~s~0)| ~NP~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 .cse3) (or .cse0 (not .cse3) (not (= ~SKIP1~0 |old(~s~0)|)) .cse1 .cse2))) [2019-10-13 23:01:23,805 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 474 496) no Hoare annotation was computed. [2019-10-13 23:01:23,805 INFO L439 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (or (not (= ~setEventCalled~0 1)) (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (= ~compRegistered~0 0)) [2019-10-13 23:01:23,806 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 422 435) no Hoare annotation was computed. [2019-10-13 23:01:23,806 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 422 435) the Hoare annotation is: (or (not (= ~setEventCalled~0 1)) (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (= ~s~0 ~NP~0) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (= ~compRegistered~0 0)) [2019-10-13 23:01:23,806 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 422 435) no Hoare annotation was computed. [2019-10-13 23:01:23,806 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 23:01:23,806 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 23:01:23,806 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 522 563) no Hoare annotation was computed. [2019-10-13 23:01:23,806 INFO L439 ceAbstractionStarter]: At program point L535(lines 527 546) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (not (<= ~SKIP1~0 3)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| ~MPR3~0)) (not (<= 3 ~SKIP1~0)) (= ~compRegistered~0 0)) [2019-10-13 23:01:23,807 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 546) no Hoare annotation was computed. [2019-10-13 23:01:23,807 INFO L439 ceAbstractionStarter]: At program point L542(line 542) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (not (<= ~SKIP1~0 3)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| ~MPR3~0)) (not (<= 3 ~SKIP1~0)) (= ~compRegistered~0 0)) [2019-10-13 23:01:23,807 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 544) no Hoare annotation was computed. [2019-10-13 23:01:23,807 INFO L439 ceAbstractionStarter]: At program point L540-1(lines 527 546) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (not (<= ~SKIP1~0 3)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| ~MPR3~0)) (not (<= 3 ~SKIP1~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2019-10-13 23:01:23,807 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 533) no Hoare annotation was computed. [2019-10-13 23:01:23,807 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 522 563) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (not (<= ~SKIP1~0 3)) (and (= ~MPR3~0 ~s~0) (= ~setEventCalled~0 1)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= |old(~s~0)| ~MPR3~0)) (not (<= 3 ~SKIP1~0)) (= ~compRegistered~0 0)) [2019-10-13 23:01:23,808 INFO L439 ceAbstractionStarter]: At program point L508(line 508) the Hoare annotation is: (or (not (<= ~SKIP1~0 3)) (not (= 0 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 3 ~SKIP1~0)) (= ~compRegistered~0 0)) [2019-10-13 23:01:23,808 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 500 513) no Hoare annotation was computed. [2019-10-13 23:01:23,808 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 500 513) the Hoare annotation is: (or (not (<= ~SKIP1~0 3)) (not (= 0 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 3 ~SKIP1~0)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2019-10-13 23:01:23,808 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 510) no Hoare annotation was computed. [2019-10-13 23:01:23,808 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 500 513) no Hoare annotation was computed. [2019-10-13 23:01:23,808 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 23:01:23,808 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) [2019-10-13 23:01:23,809 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 23:01:23,809 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 23:01:23,809 INFO L439 ceAbstractionStarter]: At program point L225(lines 225 226) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,809 INFO L443 ceAbstractionStarter]: For program point L225-1(lines 225 226) no Hoare annotation was computed. [2019-10-13 23:01:23,809 INFO L439 ceAbstractionStarter]: At program point L250(line 250) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,809 INFO L443 ceAbstractionStarter]: For program point L250-1(lines 246 252) no Hoare annotation was computed. [2019-10-13 23:01:23,809 INFO L439 ceAbstractionStarter]: At program point L193(lines 193 195) the Hoare annotation is: (or (and (or (= ~s~0 ~NP~0) (= KbFilter_PnP_~__cil_tmp23~0 259)) (not (= 0 ~compRegistered~0)) (= ~MPR3~0 ~s~0) (= ~setEventCalled~0 1)) (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,810 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 193 195) no Hoare annotation was computed. [2019-10-13 23:01:23,810 INFO L439 ceAbstractionStarter]: At program point L210(line 210) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (and (= ~s~0 ~NP~0) (not (= 0 ~compRegistered~0)))) [2019-10-13 23:01:23,810 INFO L439 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,810 INFO L439 ceAbstractionStarter]: At program point L235(line 235) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,810 INFO L443 ceAbstractionStarter]: For program point L235-1(lines 231 237) no Hoare annotation was computed. [2019-10-13 23:01:23,810 INFO L439 ceAbstractionStarter]: At program point L219(line 219) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,811 INFO L439 ceAbstractionStarter]: At program point L186(lines 186 187) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= 0 ~compRegistered~0))) (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,811 INFO L443 ceAbstractionStarter]: For program point L219-1(lines 215 221) no Hoare annotation was computed. [2019-10-13 23:01:23,811 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 186 187) no Hoare annotation was computed. [2019-10-13 23:01:23,811 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 74 286) no Hoare annotation was computed. [2019-10-13 23:01:23,811 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 182) no Hoare annotation was computed. [2019-10-13 23:01:23,811 INFO L439 ceAbstractionStarter]: At program point L104(lines 104 282) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,812 INFO L446 ceAbstractionStarter]: At program point L261(lines 165 262) the Hoare annotation is: true [2019-10-13 23:01:23,812 INFO L439 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 74 286) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,812 INFO L439 ceAbstractionStarter]: At program point L172(line 172) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,812 INFO L439 ceAbstractionStarter]: At program point L164(lines 110 280) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,812 INFO L439 ceAbstractionStarter]: At program point L107(lines 107 281) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,812 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 237) no Hoare annotation was computed. [2019-10-13 23:01:23,813 INFO L439 ceAbstractionStarter]: At program point L256(lines 256 257) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,813 INFO L443 ceAbstractionStarter]: For program point L256-1(lines 256 257) no Hoare annotation was computed. [2019-10-13 23:01:23,813 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 221) no Hoare annotation was computed. [2019-10-13 23:01:23,813 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 197) no Hoare annotation was computed. [2019-10-13 23:01:23,813 INFO L443 ceAbstractionStarter]: For program point L191-2(lines 165 260) no Hoare annotation was computed. [2019-10-13 23:01:23,813 INFO L439 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,814 INFO L443 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2019-10-13 23:01:23,814 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 181) no Hoare annotation was computed. [2019-10-13 23:01:23,814 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 170 182) no Hoare annotation was computed. [2019-10-13 23:01:23,814 INFO L439 ceAbstractionStarter]: At program point L101(lines 101 283) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 3 ~SKIP1~0))) [2019-10-13 23:01:23,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:01:23 BoogieIcfgContainer [2019-10-13 23:01:23,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 23:01:23,841 INFO L168 Benchmark]: Toolchain (without parser) took 6127.09 ms. Allocated memory was 138.4 MB in the beginning and 287.3 MB in the end (delta: 148.9 MB). Free memory was 102.9 MB in the beginning and 182.0 MB in the end (delta: -79.1 MB). Peak memory consumption was 157.0 MB. Max. memory is 7.1 GB. [2019-10-13 23:01:23,842 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-13 23:01:23,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.70 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.7 MB in the beginning and 178.8 MB in the end (delta: -76.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-10-13 23:01:23,844 INFO L168 Benchmark]: Boogie Preprocessor took 55.57 ms. Allocated memory is still 202.9 MB. Free memory was 178.8 MB in the beginning and 176.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-13 23:01:23,845 INFO L168 Benchmark]: RCFGBuilder took 1102.55 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 176.0 MB in the beginning and 207.2 MB in the end (delta: -31.1 MB). Peak memory consumption was 91.2 MB. Max. memory is 7.1 GB. [2019-10-13 23:01:23,846 INFO L168 Benchmark]: TraceAbstraction took 4529.82 ms. Allocated memory was 235.9 MB in the beginning and 287.3 MB in the end (delta: 51.4 MB). Free memory was 205.7 MB in the beginning and 182.0 MB in the end (delta: 23.7 MB). Peak memory consumption was 162.3 MB. Max. memory is 7.1 GB. [2019-10-13 23:01:23,850 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.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 434.70 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.7 MB in the beginning and 178.8 MB in the end (delta: -76.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.57 ms. Allocated memory is still 202.9 MB. Free memory was 178.8 MB in the beginning and 176.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1102.55 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 176.0 MB in the beginning and 207.2 MB in the end (delta: -31.1 MB). Peak memory consumption was 91.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4529.82 ms. Allocated memory was 235.9 MB in the beginning and 287.3 MB in the end (delta: 51.4 MB). Free memory was 205.7 MB in the beginning and 182.0 MB in the end (delta: 23.7 MB). Peak memory consumption was 162.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: 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: 386]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(\old(compRegistered) == 0)) || (((0 == pended && (0 == __cil_tmp8 || 1 == __cil_tmp8)) && SKIP1 <= 3) && 3 <= SKIP1)) || !(\old(SKIP1) == \old(s))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((((!(\old(s) == NP) || !(SKIP1 <= 3)) || (s == NP && 0 == compRegistered)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(3 <= SKIP1) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(\old(compRegistered) == 0)) || (((0 == pended && (0 == __cil_tmp8 || 1 == __cil_tmp8)) && SKIP1 <= 3) && 3 <= SKIP1)) || !(\old(SKIP1) == \old(s))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(\old(compRegistered) == 0)) || (((0 == pended && (0 == __cil_tmp8 || 1 == __cil_tmp8)) && SKIP1 <= 3) && 3 <= SKIP1)) || !(\old(SKIP1) == \old(s))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((((!(\old(s) == NP) || (s == MPR1 && setEventCalled == 1)) || !(SKIP1 <= 3)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(3 <= SKIP1)) || compRegistered == 0) && (((((!(SKIP1 <= 3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || !(3 <= SKIP1)) - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((((!(\old(s) == NP) || (s == MPR1 && setEventCalled == 1)) || !(SKIP1 <= 3)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(3 <= SKIP1)) || compRegistered == 0) && (((((!(SKIP1 <= 3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP1 == s) || !(3 <= SKIP1)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((((!(\old(setEventCalled) == 1) || !(SKIP1 <= 3)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(3 <= SKIP1)) || compRegistered == 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((!(\old(s) == NP) || !(SKIP1 <= 3)) || (s == NP && 0 == compRegistered)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(3 <= SKIP1) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((!(\old(s) == NP) || !(SKIP1 <= 3)) || (s == NP && 0 == compRegistered)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(3 <= SKIP1) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((!(\old(s) == NP) || !(SKIP1 <= 3)) || (s == NP && 0 == compRegistered)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(3 <= SKIP1) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(NP)) || !(\old(compRegistered) == 0)) || (((0 == pended && (0 == __cil_tmp8 || 1 == __cil_tmp8)) && SKIP1 <= 3) && 3 <= SKIP1)) || !(\old(SKIP1) == \old(s))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((((((((((0 == pended && s == NP) && (0 == __cil_tmp8 || 1 == __cil_tmp8)) && 0 == compRegistered) && 0 < status + 1) && SKIP1 <= 3) && 3 <= SKIP1) && NP + 4 <= MPR1) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: ((((((!(\old(setEventCalled) == 1) || !(SKIP1 <= 3)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(3 <= SKIP1)) || s == NP) || compRegistered == 0 - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((((((((((0 == pended && s == NP) && (0 == __cil_tmp8 || 1 == __cil_tmp8)) && 0 == compRegistered) && 0 < status + 1) && SKIP1 <= 3) && 3 <= SKIP1) && NP + 4 <= MPR1) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 105 locations, 1 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, HoareTripleCheckerStatistics: 1013 SDtfs, 665 SDslu, 1031 SDs, 0 SdLazy, 402 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 63 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 172 PreInvPairs, 194 NumberOfFragments, 1642 HoareAnnotationTreeSize, 172 FomulaSimplifications, 158 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 50 FomulaSimplificationsInter, 732 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 397 ConstructedInterpolants, 0 QuantifiedInterpolants, 29231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...