java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:59:53,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:59:53,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:59:53,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:59:53,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:59:53,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:59:53,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:59:53,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:59:53,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:59:53,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:59:53,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:59:53,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:59:53,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:59:53,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:59:53,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:59:53,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:59:53,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:59:53,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:59:53,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:59:53,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:59:53,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:59:53,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:59:53,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:59:53,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:59:53,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:59:53,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:59:53,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:59:53,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:59:53,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:59:53,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:59:53,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:59:53,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:59:53,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:59:53,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:59:53,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:59:53,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:59:53,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:59:53,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:59:53,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:59:53,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:59:53,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:59:53,343 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-09-20 12:59:53,357 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:59:53,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:59:53,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:59:53,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:59:53,359 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:59:53,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:59:53,359 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:59:53,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:59:53,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:59:53,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:59:53,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:59:53,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:59:53,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:59:53,360 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:59:53,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:59:53,361 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:59:53,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:59:53,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:59:53,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:59:53,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:59:53,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:59:53,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:53,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:59:53,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:59:53,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:59:53,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:59:53,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:59:53,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:59:53,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:59:53,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:59:53,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:59:53,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:59:53,406 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:59:53,407 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:59:53,407 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-09-20 12:59:53,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d4f37b3/365af942f6ad4bfba13d5a42e3cea192/FLAG4a1696b3e [2019-09-20 12:59:53,935 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:59:53,936 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-09-20 12:59:53,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d4f37b3/365af942f6ad4bfba13d5a42e3cea192/FLAG4a1696b3e [2019-09-20 12:59:54,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d4f37b3/365af942f6ad4bfba13d5a42e3cea192 [2019-09-20 12:59:54,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:59:54,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:59:54,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:54,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:59:54,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:59:54,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:54" (1/1) ... [2019-09-20 12:59:54,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702abad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:54, skipping insertion in model container [2019-09-20 12:59:54,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:54" (1/1) ... [2019-09-20 12:59:54,316 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:59:54,370 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:59:54,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:54,766 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:59:54,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:54,846 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:59:54,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:54 WrapperNode [2019-09-20 12:59:54,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:54,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:59:54,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:59:54,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:59:54,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:54" (1/1) ... [2019-09-20 12:59:54,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:54" (1/1) ... [2019-09-20 12:59:54,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:54" (1/1) ... [2019-09-20 12:59:54,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:54" (1/1) ... [2019-09-20 12:59:54,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:54" (1/1) ... [2019-09-20 12:59:54,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:54" (1/1) ... [2019-09-20 12:59:54,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:54" (1/1) ... [2019-09-20 12:59:54,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:59:54,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:59:54,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:59:54,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:59:54,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:54" (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-09-20 12:59:54,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:59:54,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:59:54,964 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-20 12:59:54,964 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-20 12:59:54,964 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-09-20 12:59:54,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:59:54,965 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-20 12:59:54,965 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-20 12:59:54,965 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-20 12:59:54,965 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-20 12:59:54,965 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-20 12:59:54,965 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-09-20 12:59:54,966 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-20 12:59:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:59:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 12:59:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:59:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 12:59:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 12:59:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-09-20 12:59:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-20 12:59:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-20 12:59:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-20 12:59:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-09-20 12:59:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-20 12:59:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-20 12:59:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-20 12:59:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-20 12:59:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:59:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-20 12:59:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:59:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:59:55,234 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:55,346 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-09-20 12:59:55,346 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-09-20 12:59:55,348 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:55,419 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2019-09-20 12:59:55,420 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2019-09-20 12:59:55,463 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:55,502 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-20 12:59:55,502 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-20 12:59:55,526 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:55,654 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-09-20 12:59:55,655 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-09-20 12:59:55,662 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:59:55,662 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 12:59:55,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:55 BoogieIcfgContainer [2019-09-20 12:59:55,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:59:55,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:59:55,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:59:55,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:59:55,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:54" (1/3) ... [2019-09-20 12:59:55,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ab49f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:55, skipping insertion in model container [2019-09-20 12:59:55,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:54" (2/3) ... [2019-09-20 12:59:55,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ab49f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:55, skipping insertion in model container [2019-09-20 12:59:55,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:55" (3/3) ... [2019-09-20 12:59:55,672 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-09-20 12:59:55,682 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:59:55,691 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:59:55,708 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:59:55,739 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:59:55,740 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:59:55,741 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:59:55,741 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:59:55,741 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:59:55,741 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:59:55,741 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:59:55,742 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:59:55,742 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:59:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-09-20 12:59:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:59:55,771 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:55,772 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:55,774 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2019-09-20 12:59:55,782 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:55,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:55,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:55,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:56,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:56,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:56,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:56,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:56,026 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 3 states. [2019-09-20 12:59:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:56,145 INFO L93 Difference]: Finished difference Result 286 states and 438 transitions. [2019-09-20 12:59:56,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:56,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 12:59:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:56,161 INFO L225 Difference]: With dead ends: 286 [2019-09-20 12:59:56,161 INFO L226 Difference]: Without dead ends: 140 [2019-09-20 12:59:56,167 INFO L636 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-09-20 12:59:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-20 12:59:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-09-20 12:59:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-20 12:59:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2019-09-20 12:59:56,229 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2019-09-20 12:59:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:56,230 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2019-09-20 12:59:56,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2019-09-20 12:59:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 12:59:56,231 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:56,231 INFO L407 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] [2019-09-20 12:59:56,232 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:56,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2019-09-20 12:59:56,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:56,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:56,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:56,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:56,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:56,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:56,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:56,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:56,472 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 3 states. [2019-09-20 12:59:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:56,615 INFO L93 Difference]: Finished difference Result 258 states and 346 transitions. [2019-09-20 12:59:56,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:56,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 12:59:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:56,624 INFO L225 Difference]: With dead ends: 258 [2019-09-20 12:59:56,624 INFO L226 Difference]: Without dead ends: 202 [2019-09-20 12:59:56,626 INFO L636 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-09-20 12:59:56,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-20 12:59:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2019-09-20 12:59:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-20 12:59:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2019-09-20 12:59:56,651 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 26 [2019-09-20 12:59:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:56,651 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2019-09-20 12:59:56,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2019-09-20 12:59:56,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 12:59:56,653 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:56,653 INFO L407 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] [2019-09-20 12:59:56,653 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:56,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:56,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2019-09-20 12:59:56,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:56,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:56,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:56,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:56,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:56,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:56,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:56,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:56,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:56,766 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand 4 states. [2019-09-20 12:59:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:56,830 INFO L93 Difference]: Finished difference Result 310 states and 406 transitions. [2019-09-20 12:59:56,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:56,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-20 12:59:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:56,833 INFO L225 Difference]: With dead ends: 310 [2019-09-20 12:59:56,833 INFO L226 Difference]: Without dead ends: 248 [2019-09-20 12:59:56,834 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-20 12:59:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2019-09-20 12:59:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-20 12:59:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2019-09-20 12:59:56,881 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 27 [2019-09-20 12:59:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:56,882 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2019-09-20 12:59:56,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2019-09-20 12:59:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-20 12:59:56,884 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:56,884 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:56,885 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:56,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:56,885 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2019-09-20 12:59:56,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:56,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:56,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:56,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:57,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:57,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:57,015 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand 4 states. [2019-09-20 12:59:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,167 INFO L93 Difference]: Finished difference Result 214 states and 284 transitions. [2019-09-20 12:59:57,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:57,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-09-20 12:59:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,170 INFO L225 Difference]: With dead ends: 214 [2019-09-20 12:59:57,170 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 12:59:57,171 INFO L636 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-09-20 12:59:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 12:59:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-09-20 12:59:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-20 12:59:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 281 transitions. [2019-09-20 12:59:57,190 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 281 transitions. Word has length 37 [2019-09-20 12:59:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,190 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 281 transitions. [2019-09-20 12:59:57,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 281 transitions. [2019-09-20 12:59:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 12:59:57,193 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,193 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:57,194 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2019-09-20 12:59:57,194 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:57,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:57,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:57,256 INFO L87 Difference]: Start difference. First operand 211 states and 281 transitions. Second operand 4 states. [2019-09-20 12:59:57,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,342 INFO L93 Difference]: Finished difference Result 268 states and 349 transitions. [2019-09-20 12:59:57,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:57,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-09-20 12:59:57,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,345 INFO L225 Difference]: With dead ends: 268 [2019-09-20 12:59:57,345 INFO L226 Difference]: Without dead ends: 202 [2019-09-20 12:59:57,345 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-20 12:59:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 184. [2019-09-20 12:59:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 12:59:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 243 transitions. [2019-09-20 12:59:57,362 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 243 transitions. Word has length 45 [2019-09-20 12:59:57,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,363 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 243 transitions. [2019-09-20 12:59:57,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 243 transitions. [2019-09-20 12:59:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 12:59:57,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,366 INFO L407 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-09-20 12:59:57,366 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2019-09-20 12:59:57,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:57,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:57,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:57,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:57,431 INFO L87 Difference]: Start difference. First operand 184 states and 243 transitions. Second operand 3 states. [2019-09-20 12:59:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,507 INFO L93 Difference]: Finished difference Result 243 states and 318 transitions. [2019-09-20 12:59:57,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:57,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-20 12:59:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,517 INFO L225 Difference]: With dead ends: 243 [2019-09-20 12:59:57,518 INFO L226 Difference]: Without dead ends: 182 [2019-09-20 12:59:57,518 INFO L636 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-09-20 12:59:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-20 12:59:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-09-20 12:59:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-20 12:59:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2019-09-20 12:59:57,553 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 51 [2019-09-20 12:59:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,554 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2019-09-20 12:59:57,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2019-09-20 12:59:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 12:59:57,557 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,557 INFO L407 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-09-20 12:59:57,557 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2019-09-20 12:59:57,558 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:57,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:57,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:57,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:57,604 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand 3 states. [2019-09-20 12:59:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,627 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2019-09-20 12:59:57,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:57,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-20 12:59:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,630 INFO L225 Difference]: With dead ends: 191 [2019-09-20 12:59:57,630 INFO L226 Difference]: Without dead ends: 91 [2019-09-20 12:59:57,631 INFO L636 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-09-20 12:59:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-20 12:59:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-20 12:59:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-20 12:59:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-09-20 12:59:57,642 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 50 [2019-09-20 12:59:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,642 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-09-20 12:59:57,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-09-20 12:59:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 12:59:57,645 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,645 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:57,645 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2019-09-20 12:59:57,646 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:59:57,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:59:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:59:57,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:57,735 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 6 states. [2019-09-20 12:59:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,788 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2019-09-20 12:59:57,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:59:57,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-20 12:59:57,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,790 INFO L225 Difference]: With dead ends: 142 [2019-09-20 12:59:57,790 INFO L226 Difference]: Without dead ends: 101 [2019-09-20 12:59:57,791 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:59:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-20 12:59:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-09-20 12:59:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-20 12:59:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-09-20 12:59:57,800 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 59 [2019-09-20 12:59:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,801 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-09-20 12:59:57,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:59:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-09-20 12:59:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 12:59:57,802 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,802 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:57,802 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,803 INFO L82 PathProgramCache]: Analyzing trace with hash -367309916, now seen corresponding path program 1 times [2019-09-20 12:59:57,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:59:57,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:59:57,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:59:57,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:57,893 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 6 states. [2019-09-20 12:59:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,952 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2019-09-20 12:59:57,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:59:57,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-20 12:59:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,955 INFO L225 Difference]: With dead ends: 107 [2019-09-20 12:59:57,955 INFO L226 Difference]: Without dead ends: 100 [2019-09-20 12:59:57,956 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-20 12:59:57,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-09-20 12:59:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-20 12:59:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-09-20 12:59:57,968 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 59 [2019-09-20 12:59:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,968 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-09-20 12:59:57,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:59:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-09-20 12:59:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 12:59:57,970 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,971 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:57,975 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,976 INFO L82 PathProgramCache]: Analyzing trace with hash 857146700, now seen corresponding path program 1 times [2019-09-20 12:59:57,976 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:58,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:58,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:58,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:58,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:58,031 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 3 states. [2019-09-20 12:59:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,054 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2019-09-20 12:59:58,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:58,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-20 12:59:58,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,057 INFO L225 Difference]: With dead ends: 187 [2019-09-20 12:59:58,057 INFO L226 Difference]: Without dead ends: 180 [2019-09-20 12:59:58,057 INFO L636 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-09-20 12:59:58,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-20 12:59:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2019-09-20 12:59:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-20 12:59:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2019-09-20 12:59:58,071 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 60 [2019-09-20 12:59:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,072 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2019-09-20 12:59:58,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2019-09-20 12:59:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 12:59:58,073 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,073 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:58,073 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1662813234, now seen corresponding path program 1 times [2019-09-20 12:59:58,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:58,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:59:58,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:59:58,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:59:58,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:58,143 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 5 states. [2019-09-20 12:59:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,263 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2019-09-20 12:59:58,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:58,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-20 12:59:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,265 INFO L225 Difference]: With dead ends: 216 [2019-09-20 12:59:58,265 INFO L226 Difference]: Without dead ends: 152 [2019-09-20 12:59:58,266 INFO L636 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-09-20 12:59:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-20 12:59:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-20 12:59:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 12:59:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2019-09-20 12:59:58,282 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 60 [2019-09-20 12:59:58,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,284 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2019-09-20 12:59:58,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:59:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2019-09-20 12:59:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 12:59:58,285 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,285 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:58,285 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1935953947, now seen corresponding path program 1 times [2019-09-20 12:59:58,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:58,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:58,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:58,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:58,335 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 3 states. [2019-09-20 12:59:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,369 INFO L93 Difference]: Finished difference Result 212 states and 240 transitions. [2019-09-20 12:59:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:58,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-20 12:59:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,371 INFO L225 Difference]: With dead ends: 212 [2019-09-20 12:59:58,371 INFO L226 Difference]: Without dead ends: 164 [2019-09-20 12:59:58,372 INFO L636 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-09-20 12:59:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-20 12:59:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2019-09-20 12:59:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-20 12:59:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2019-09-20 12:59:58,389 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 62 [2019-09-20 12:59:58,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,389 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2019-09-20 12:59:58,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:58,389 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2019-09-20 12:59:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 12:59:58,390 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,390 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:58,391 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1349147933, now seen corresponding path program 1 times [2019-09-20 12:59:58,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:58,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:58,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:58,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:58,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:58,441 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand 3 states. [2019-09-20 12:59:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,478 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2019-09-20 12:59:58,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:58,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-20 12:59:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,483 INFO L225 Difference]: With dead ends: 178 [2019-09-20 12:59:58,484 INFO L226 Difference]: Without dead ends: 173 [2019-09-20 12:59:58,486 INFO L636 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-09-20 12:59:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-20 12:59:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2019-09-20 12:59:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-20 12:59:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2019-09-20 12:59:58,503 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 62 [2019-09-20 12:59:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,503 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2019-09-20 12:59:58,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2019-09-20 12:59:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 12:59:58,511 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,511 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:58,511 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2019-09-20 12:59:58,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:58,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:59:58,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:59:58,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:59:58,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:59:58,587 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand 7 states. [2019-09-20 12:59:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,648 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2019-09-20 12:59:58,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:59:58,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-09-20 12:59:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,651 INFO L225 Difference]: With dead ends: 184 [2019-09-20 12:59:58,651 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 12:59:58,652 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 12:59:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-09-20 12:59:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-20 12:59:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2019-09-20 12:59:58,666 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 62 [2019-09-20 12:59:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,666 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2019-09-20 12:59:58,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:59:58,666 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2019-09-20 12:59:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 12:59:58,667 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,667 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:58,668 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1363732376, now seen corresponding path program 1 times [2019-09-20 12:59:58,669 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:58,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 12:59:58,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 12:59:58,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 12:59:58,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:58,844 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 11 states. [2019-09-20 12:59:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:59,093 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2019-09-20 12:59:59,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:59:59,093 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-09-20 12:59:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:59,095 INFO L225 Difference]: With dead ends: 176 [2019-09-20 12:59:59,095 INFO L226 Difference]: Without dead ends: 151 [2019-09-20 12:59:59,095 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-09-20 12:59:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-20 12:59:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2019-09-20 12:59:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-20 12:59:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2019-09-20 12:59:59,113 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 63 [2019-09-20 12:59:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:59,114 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2019-09-20 12:59:59,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 12:59:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2019-09-20 12:59:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 12:59:59,115 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:59,116 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:59,116 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:59,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:59,116 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2019-09-20 12:59:59,117 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:59,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:59,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:59,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:59:59,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:59:59,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:59:59,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:59,245 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 5 states. [2019-09-20 12:59:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:59,360 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2019-09-20 12:59:59,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:59:59,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-20 12:59:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:59,362 INFO L225 Difference]: With dead ends: 165 [2019-09-20 12:59:59,362 INFO L226 Difference]: Without dead ends: 133 [2019-09-20 12:59:59,362 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-20 12:59:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-09-20 12:59:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-20 12:59:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-09-20 12:59:59,374 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2019-09-20 12:59:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:59,375 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-09-20 12:59:59,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:59:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-09-20 12:59:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 12:59:59,376 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:59,376 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:59,376 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:59,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:59,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2019-09-20 12:59:59,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:59,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:59,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:59,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:59,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:59,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:59:59,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:59:59,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:59:59,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:59,487 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 6 states. [2019-09-20 12:59:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:59,520 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2019-09-20 12:59:59,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:59:59,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-09-20 12:59:59,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:59,522 INFO L225 Difference]: With dead ends: 144 [2019-09-20 12:59:59,522 INFO L226 Difference]: Without dead ends: 133 [2019-09-20 12:59:59,523 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:59:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-20 12:59:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-09-20 12:59:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-20 12:59:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2019-09-20 12:59:59,535 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2019-09-20 12:59:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:59,535 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2019-09-20 12:59:59,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:59:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2019-09-20 12:59:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 12:59:59,537 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:59,538 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:59,538 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:59,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:59,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2019-09-20 12:59:59,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:59,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:59,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:59,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:59,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:59,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:59:59,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:59:59,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:59:59,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:59,615 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 6 states. [2019-09-20 12:59:59,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:59,701 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-09-20 12:59:59,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:59,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-20 12:59:59,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:59,702 INFO L225 Difference]: With dead ends: 133 [2019-09-20 12:59:59,702 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 12:59:59,703 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-09-20 12:59:59,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 12:59:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 12:59:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 12:59:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 12:59:59,704 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2019-09-20 12:59:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:59,704 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 12:59:59,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:59:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 12:59:59,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 12:59:59,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 13:00:00,073 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-20 13:00:00,187 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-20 13:00:00,438 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-20 13:00:00,557 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-20 13:00:00,770 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-20 13:00:00,971 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-20 13:00:01,075 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-20 13:00:01,244 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-20 13:00:01,501 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-20 13:00:01,837 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-20 13:00:02,062 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-20 13:00:02,170 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-20 13:00:02,285 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-09-20 13:00:02,492 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-20 13:00:02,630 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-20 13:00:02,770 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-20 13:00:02,999 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-20 13:00:03,200 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-20 13:00:03,312 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-20 13:00:03,492 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-20 13:00:03,926 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-20 13:00:04,149 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-20 13:00:04,287 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-20 13:00:04,685 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-20 13:00:04,808 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-20 13:00:04,893 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 514 521) the Hoare annotation is: true [2019-09-20 13:00:04,894 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 514 521) no Hoare annotation was computed. [2019-09-20 13:00:04,894 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 514 521) no Hoare annotation was computed. [2019-09-20 13:00:04,894 INFO L446 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 564 574) the Hoare annotation is: true [2019-09-20 13:00:04,894 INFO L446 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: true [2019-09-20 13:00:04,894 INFO L443 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2019-09-20 13:00:04,894 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteFINAL(lines 564 574) no Hoare annotation was computed. [2019-09-20 13:00:04,894 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 564 574) no Hoare annotation was computed. [2019-09-20 13:00:04,894 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 36 49) no Hoare annotation was computed. [2019-09-20 13:00:04,895 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 36 49) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 |old(~pended~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (not (= 1 ~pended~0)) (<= ~s~0 1) (<= ~compRegistered~0 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,895 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 36 49) no Hoare annotation was computed. [2019-09-20 13:00:04,895 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 50 71) no Hoare annotation was computed. [2019-09-20 13:00:04,895 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 50 71) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~s~0 ~MPR1~0) (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (not (= 1 ~pended~0)) (= ~MPR3~0 ~s~0) (<= 0 ~MPR3~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-09-20 13:00:04,895 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 50 71) no Hoare annotation was computed. [2019-09-20 13:00:04,896 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 576 583) the Hoare annotation is: true [2019-09-20 13:00:04,896 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-09-20 13:00:04,896 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 576 583) no Hoare annotation was computed. [2019-09-20 13:00:04,896 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 576 583) no Hoare annotation was computed. [2019-09-20 13:00:04,896 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 287 421) no Hoare annotation was computed. [2019-09-20 13:00:04,896 INFO L439 ceAbstractionStarter]: At program point L399(line 399) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|)) (not (<= |old(~compRegistered~0)| 0))) [2019-09-20 13:00:04,896 INFO L443 ceAbstractionStarter]: For program point L358(line 358) no Hoare annotation was computed. [2019-09-20 13:00:04,897 INFO L439 ceAbstractionStarter]: At program point L383(lines 376 416) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-09-20 13:00:04,897 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 410) no Hoare annotation was computed. [2019-09-20 13:00:04,897 INFO L439 ceAbstractionStarter]: At program point L375(lines 368 417) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-09-20 13:00:04,897 INFO L443 ceAbstractionStarter]: For program point L384(lines 368 417) no Hoare annotation was computed. [2019-09-20 13:00:04,897 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 366) no Hoare annotation was computed. [2019-09-20 13:00:04,897 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 287 421) no Hoare annotation was computed. [2019-09-20 13:00:04,898 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 414) no Hoare annotation was computed. [2019-09-20 13:00:04,898 INFO L439 ceAbstractionStarter]: At program point L352(lines 351 366) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (<= ~NP~0 1) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= ~compRegistered~0 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-09-20 13:00:04,898 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 287 421) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~s~0 ~MPR1~0) (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (not (= 1 ~pended~0)) (= ~MPR3~0 ~s~0) (<= 0 ~MPR3~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-09-20 13:00:04,898 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-09-20 13:00:04,898 INFO L443 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2019-09-20 13:00:04,898 INFO L443 ceAbstractionStarter]: For program point L336(lines 322 367) no Hoare annotation was computed. [2019-09-20 13:00:04,898 INFO L443 ceAbstractionStarter]: For program point L386(lines 386 413) no Hoare annotation was computed. [2019-09-20 13:00:04,899 INFO L439 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (or (and (= ~s~0 ~MPR1~0) (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (not (= 1 ~pended~0)) (<= 0 main_~status~1) (= ~MPR3~0 ~s~0) (<= 0 ~MPR3~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-09-20 13:00:04,899 INFO L443 ceAbstractionStarter]: For program point L320-1(lines 296 420) no Hoare annotation was computed. [2019-09-20 13:00:04,899 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 411) no Hoare annotation was computed. [2019-09-20 13:00:04,899 INFO L439 ceAbstractionStarter]: At program point L395(lines 386 413) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-09-20 13:00:04,899 INFO L443 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-09-20 13:00:04,899 INFO L439 ceAbstractionStarter]: At program point L354(lines 353 366) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-09-20 13:00:04,899 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-09-20 13:00:04,899 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 390) no Hoare annotation was computed. [2019-09-20 13:00:04,899 INFO L439 ceAbstractionStarter]: At program point L322(lines 296 420) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 1 ~pended~0)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-09-20 13:00:04,900 INFO L443 ceAbstractionStarter]: For program point L339-1(lines 338 348) no Hoare annotation was computed. [2019-09-20 13:00:04,900 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. [2019-09-20 13:00:04,900 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 334) no Hoare annotation was computed. [2019-09-20 13:00:04,900 INFO L439 ceAbstractionStarter]: At program point L331-2(lines 331 334) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (<= ~NP~0 1) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= ~compRegistered~0 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~MPR3~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (<= 0 |old(~MPR3~0)|))) [2019-09-20 13:00:04,900 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-09-20 13:00:04,900 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 444 447) no Hoare annotation was computed. [2019-09-20 13:00:04,900 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 495) no Hoare annotation was computed. [2019-09-20 13:00:04,900 INFO L439 ceAbstractionStarter]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= 0 ~compRegistered~0)) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (and (<= 1 ~s~0) (<= ~s~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))))) [2019-09-20 13:00:04,900 INFO L443 ceAbstractionStarter]: For program point L445-1(line 445) no Hoare annotation was computed. [2019-09-20 13:00:04,901 INFO L439 ceAbstractionStarter]: At program point L470(lines 443 498) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (let ((.cse3 (= ~s~0 ~MPR1~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (and .cse3 (= 259 IofCallDriver_~returnVal2~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (and .cse3 (= 0 IofCallDriver_~returnVal2~0)) (and .cse3 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)))) (or (not (<= 0 ~compRegistered~0)) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-09-20 13:00:04,901 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 436 499) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (and (<= 1 ~s~0) (<= ~s~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) (or (not (<= 0 ~compRegistered~0)) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-09-20 13:00:04,901 INFO L439 ceAbstractionStarter]: At program point L458(lines 457 472) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~s~0 ~MPR1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) (or (not (<= 0 ~compRegistered~0)) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-09-20 13:00:04,901 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 494) no Hoare annotation was computed. [2019-09-20 13:00:04,901 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 473) no Hoare annotation was computed. [2019-09-20 13:00:04,901 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 436 499) no Hoare annotation was computed. [2019-09-20 13:00:04,901 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 485) no Hoare annotation was computed. [2019-09-20 13:00:04,901 INFO L439 ceAbstractionStarter]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= 0 ~compRegistered~0)) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (and (<= 1 ~s~0) (<= ~s~0 1) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))))) [2019-09-20 13:00:04,902 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 436 499) no Hoare annotation was computed. [2019-09-20 13:00:04,902 INFO L439 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 |old(~s~0)|))) (or (not (<= 0 ~compRegistered~0)) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-09-20 13:00:04,902 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 474 496) no Hoare annotation was computed. [2019-09-20 13:00:04,902 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 472) no Hoare annotation was computed. [2019-09-20 13:00:04,902 INFO L439 ceAbstractionStarter]: At program point L451(lines 450 473) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (= ~s~0 ~MPR1~0) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) .cse2 (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) (or (not (<= 0 ~compRegistered~0)) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-09-20 13:00:04,902 INFO L439 ceAbstractionStarter]: At program point L456(lines 455 472) the Hoare annotation is: (let ((.cse0 (not (<= ~SKIP1~0 3))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= 3 ~SKIP1~0)))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) .cse0 .cse1 (not (<= (+ ~NP~0 4) ~MPR1~0)) (= ~s~0 ~MPR1~0) (not (<= ~NP~0 1)) .cse2 (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) (or (not (<= 0 ~compRegistered~0)) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (not (<= ~compRegistered~0 0))))) [2019-09-20 13:00:04,903 INFO L439 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= 1 ~setEventCalled~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-09-20 13:00:04,903 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 422 435) no Hoare annotation was computed. [2019-09-20 13:00:04,903 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 422 435) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (and (<= 1 ~s~0) (<= ~s~0 1)) (not (<= 1 ~setEventCalled~0)) (not (<= 1 ~compRegistered~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|)) (not (<= ~setEventCalled~0 1))) [2019-09-20 13:00:04,903 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 422 435) no Hoare annotation was computed. [2019-09-20 13:00:04,903 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-20 13:00:04,903 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~s~0 |old(~s~0)|) [2019-09-20 13:00:04,903 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:04,903 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 522 563) no Hoare annotation was computed. [2019-09-20 13:00:04,903 INFO L439 ceAbstractionStarter]: At program point L535(lines 527 546) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= ~SKIP1~0 3))) (.cse2 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0))) (.cse4 (not (<= 3 ~SKIP1~0)))) (and (or .cse0 (= ~s~0 ~NP~0) (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) .cse4 (not (<= |old(~setEventCalled~0)| 1))))) [2019-09-20 13:00:04,904 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 546) no Hoare annotation was computed. [2019-09-20 13:00:04,904 INFO L439 ceAbstractionStarter]: At program point L552(lines 551 561) the Hoare annotation is: (let ((.cse2 (= 1 ~pended~0)) (.cse9 (<= 3 ~SKIP1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= ~SKIP1~0 3))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse6 (not .cse9)) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (and (not .cse2) (= ~s~0 ~NP~0) .cse7 .cse8 .cse9))) (and (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (not (<= ~NP~0 1)) .cse5 .cse6 (not (<= |old(~setEventCalled~0)| 1))) (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse4 .cse6) .cse3 .cse5)))) [2019-09-20 13:00:04,904 INFO L439 ceAbstractionStarter]: At program point L550(lines 549 561) the Hoare annotation is: (let ((.cse2 (= 1 ~pended~0)) (.cse9 (<= 3 ~SKIP1~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= ~SKIP1~0 3))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse6 (not .cse9)) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (and (not .cse2) (= ~s~0 ~NP~0) .cse7 .cse8 .cse9))) (and (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (not (<= ~NP~0 1)) .cse5 .cse6 (not (<= |old(~setEventCalled~0)| 1))) (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse4 .cse6) .cse3 .cse5)))) [2019-09-20 13:00:04,904 INFO L439 ceAbstractionStarter]: At program point L542(line 542) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= ~SKIP1~0 3))) (.cse2 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0))) (.cse4 (not (<= 3 ~SKIP1~0)))) (and (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) .cse4 (not (<= |old(~setEventCalled~0)| 1))))) [2019-09-20 13:00:04,904 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 522 563) no Hoare annotation was computed. [2019-09-20 13:00:04,904 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 544) no Hoare annotation was computed. [2019-09-20 13:00:04,904 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 527 546) no Hoare annotation was computed. [2019-09-20 13:00:04,904 INFO L443 ceAbstractionStarter]: For program point L528(lines 528 533) no Hoare annotation was computed. [2019-09-20 13:00:04,905 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 522 563) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (<= ~SKIP1~0 3))) (.cse2 (= 1 ~pended~0)) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0))) (.cse4 (not (<= 3 ~SKIP1~0)))) (and (or .cse0 (= ~s~0 ~NP~0) (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5) (or .cse0 (not (<= 1 |old(~setEventCalled~0)|)) (not (<= 1 ~NP~0)) (and (= ~MPR3~0 ~s~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1)) .cse4 (not (<= |old(~setEventCalled~0)| 1))))) [2019-09-20 13:00:04,905 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 561) no Hoare annotation was computed. [2019-09-20 13:00:04,905 INFO L439 ceAbstractionStarter]: At program point L508(line 508) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= 1 ~compRegistered~0)) (not (<= 3 ~SKIP1~0))) [2019-09-20 13:00:04,905 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 500 513) no Hoare annotation was computed. [2019-09-20 13:00:04,905 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 500 513) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (= ~s~0 ~NP~0) (not (<= 1 ~compRegistered~0)) (not (<= 3 ~SKIP1~0))) [2019-09-20 13:00:04,905 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 510) no Hoare annotation was computed. [2019-09-20 13:00:04,905 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 500 513) no Hoare annotation was computed. [2019-09-20 13:00:04,905 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 13:00:04,905 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (= ~MPR3~0 ~s~0) (<= ~MPR3~0 0) (<= 0 ~MPR3~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) [2019-09-20 13:00:04,905 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 13:00:04,905 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 13:00:04,905 INFO L439 ceAbstractionStarter]: At program point L225(lines 225 226) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,906 INFO L443 ceAbstractionStarter]: For program point L225-1(lines 225 226) no Hoare annotation was computed. [2019-09-20 13:00:04,906 INFO L439 ceAbstractionStarter]: At program point L250(line 250) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,906 INFO L443 ceAbstractionStarter]: For program point L250-1(lines 246 252) no Hoare annotation was computed. [2019-09-20 13:00:04,906 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 269) no Hoare annotation was computed. [2019-09-20 13:00:04,906 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 280) no Hoare annotation was computed. [2019-09-20 13:00:04,906 INFO L439 ceAbstractionStarter]: At program point L102(lines 101 283) the Hoare annotation is: (let ((.cse0 (not (<= 0 |old(~compRegistered~0)|))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= ~SKIP1~0 3))) (.cse3 (= 1 ~pended~0)) (.cse4 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (not (<= ~NP~0 1))) (.cse6 (not (<= 3 ~SKIP1~0))) (.cse7 (not (<= |old(~compRegistered~0)| 0))) (.cse8 (not (<= |old(~s~0)| ~NP~0))) (.cse9 (not (<= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= 0 KbFilter_PnP_~status~0) (<= ~s~0 1) (<= ~compRegistered~0 0)) .cse8 .cse9))) [2019-09-20 13:00:04,906 INFO L439 ceAbstractionStarter]: At program point L193(lines 193 195) the Hoare annotation is: (let ((.cse5 (<= 1 ~compRegistered~0)) (.cse12 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse0 (not (<= 0 |old(~compRegistered~0)|))) (.cse1 (not .cse12)) (.cse2 (and (= ~s~0 ~NP~0) .cse12 .cse5)) (.cse3 (not (<= ~SKIP1~0 3))) (.cse4 (= 1 ~pended~0)) (.cse6 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse7 (not (<= ~NP~0 1))) (.cse8 (not (<= 3 ~SKIP1~0))) (.cse9 (not (<= |old(~compRegistered~0)| 0))) (.cse10 (not (<= |old(~s~0)| ~NP~0))) (.cse11 (not (<= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (<= 259 KbFilter_PnP_~__cil_tmp23~0) .cse5 (<= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse3 .cse4 (<= (+ ~myStatus~0 1073741637) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2019-09-20 13:00:04,906 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 193 195) no Hoare annotation was computed. [2019-09-20 13:00:04,906 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 266) no Hoare annotation was computed. [2019-09-20 13:00:04,906 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 277) no Hoare annotation was computed. [2019-09-20 13:00:04,907 INFO L439 ceAbstractionStarter]: At program point L210(line 210) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,907 INFO L439 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,907 INFO L439 ceAbstractionStarter]: At program point L235(line 235) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,907 INFO L443 ceAbstractionStarter]: For program point L235-1(lines 231 237) no Hoare annotation was computed. [2019-09-20 13:00:04,907 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 263) no Hoare annotation was computed. [2019-09-20 13:00:04,907 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 274) no Hoare annotation was computed. [2019-09-20 13:00:04,907 INFO L439 ceAbstractionStarter]: At program point L219(line 219) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,907 INFO L439 ceAbstractionStarter]: At program point L186(lines 186 187) the Hoare annotation is: (let ((.cse0 (not (<= 0 |old(~compRegistered~0)|))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= ~SKIP1~0 3))) (.cse3 (= 1 ~pended~0)) (.cse4 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (not (<= ~NP~0 1))) (.cse6 (not (<= 3 ~SKIP1~0))) (.cse7 (not (<= |old(~compRegistered~0)| 0))) (.cse8 (not (<= |old(~s~0)| ~NP~0))) (.cse9 (not (<= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= 0 KbFilter_PnP_~status~0) (<= ~s~0 1)) .cse8 .cse9) (or .cse0 .cse1 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse2 .cse3 (<= (+ ~myStatus~0 1073741637) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-09-20 13:00:04,907 INFO L443 ceAbstractionStarter]: For program point L219-1(lines 215 221) no Hoare annotation was computed. [2019-09-20 13:00:04,907 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 186 187) no Hoare annotation was computed. [2019-09-20 13:00:04,908 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 74 286) no Hoare annotation was computed. [2019-09-20 13:00:04,908 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 182) no Hoare annotation was computed. [2019-09-20 13:00:04,908 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 271) no Hoare annotation was computed. [2019-09-20 13:00:04,908 INFO L443 ceAbstractionStarter]: For program point L104(lines 104 282) no Hoare annotation was computed. [2019-09-20 13:00:04,908 INFO L446 ceAbstractionStarter]: At program point L261(lines 165 262) the Hoare annotation is: true [2019-09-20 13:00:04,908 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 268) no Hoare annotation was computed. [2019-09-20 13:00:04,908 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 279) no Hoare annotation was computed. [2019-09-20 13:00:04,908 INFO L439 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 74 286) the Hoare annotation is: (let ((.cse0 (not (<= 0 |old(~compRegistered~0)|))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= ~SKIP1~0 3))) (.cse3 (= 1 ~pended~0)) (.cse4 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (not (<= ~NP~0 1))) (.cse6 (not (<= 3 ~SKIP1~0))) (.cse7 (not (<= |old(~compRegistered~0)| 0))) (.cse8 (not (<= |old(~s~0)| ~NP~0))) (.cse9 (not (<= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (<= ~compRegistered~0 0)) .cse8 .cse9) (or .cse0 .cse1 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0)))) [2019-09-20 13:00:04,908 INFO L439 ceAbstractionStarter]: At program point L105(lines 104 282) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,908 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPFINAL(lines 74 286) no Hoare annotation was computed. [2019-09-20 13:00:04,909 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 265) no Hoare annotation was computed. [2019-09-20 13:00:04,909 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 276) no Hoare annotation was computed. [2019-09-20 13:00:04,909 INFO L439 ceAbstractionStarter]: At program point L172(line 172) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,909 INFO L439 ceAbstractionStarter]: At program point L164(lines 110 280) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,909 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 273) no Hoare annotation was computed. [2019-09-20 13:00:04,909 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 270) no Hoare annotation was computed. [2019-09-20 13:00:04,909 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 281) no Hoare annotation was computed. [2019-09-20 13:00:04,909 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 237) no Hoare annotation was computed. [2019-09-20 13:00:04,910 INFO L439 ceAbstractionStarter]: At program point L256(lines 256 257) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,910 INFO L443 ceAbstractionStarter]: For program point L256-1(lines 256 257) no Hoare annotation was computed. [2019-09-20 13:00:04,910 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 221) no Hoare annotation was computed. [2019-09-20 13:00:04,910 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 267) no Hoare annotation was computed. [2019-09-20 13:00:04,910 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 278) no Hoare annotation was computed. [2019-09-20 13:00:04,910 INFO L439 ceAbstractionStarter]: At program point L108(lines 107 281) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (not (<= |old(~s~0)| ~NP~0)) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,910 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 205) no Hoare annotation was computed. [2019-09-20 13:00:04,910 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 197) no Hoare annotation was computed. [2019-09-20 13:00:04,910 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 264) no Hoare annotation was computed. [2019-09-20 13:00:04,910 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 275) no Hoare annotation was computed. [2019-09-20 13:00:04,910 INFO L443 ceAbstractionStarter]: For program point L191-2(lines 165 260) no Hoare annotation was computed. [2019-09-20 13:00:04,910 INFO L439 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (or (not (<= 0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~SKIP1~0 3)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 3 ~SKIP1~0)) (not (<= |old(~compRegistered~0)| 0)) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (<= |old(~s~0)| ~NP~0)) (not (<= 1 |old(~s~0)|))) [2019-09-20 13:00:04,910 INFO L443 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2019-09-20 13:00:04,911 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 181) no Hoare annotation was computed. [2019-09-20 13:00:04,911 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 170 182) no Hoare annotation was computed. [2019-09-20 13:00:04,911 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 204) no Hoare annotation was computed. [2019-09-20 13:00:04,911 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 272) no Hoare annotation was computed. [2019-09-20 13:00:04,911 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 283) no Hoare annotation was computed. [2019-09-20 13:00:04,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:00:04 BoogieIcfgContainer [2019-09-20 13:00:04,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:00:04,950 INFO L168 Benchmark]: Toolchain (without parser) took 10652.35 ms. Allocated memory was 140.0 MB in the beginning and 384.3 MB in the end (delta: 244.3 MB). Free memory was 86.8 MB in the beginning and 239.3 MB in the end (delta: -152.5 MB). Peak memory consumption was 222.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:04,950 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:00:04,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.74 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 86.6 MB in the beginning and 173.6 MB in the end (delta: -87.0 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:04,952 INFO L168 Benchmark]: Boogie Preprocessor took 55.17 ms. Allocated memory is still 200.3 MB. Free memory was 173.6 MB in the beginning and 171.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:04,953 INFO L168 Benchmark]: RCFGBuilder took 761.37 ms. Allocated memory is still 200.3 MB. Free memory was 171.1 MB in the beginning and 126.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:04,954 INFO L168 Benchmark]: TraceAbstraction took 9282.99 ms. Allocated memory was 200.3 MB in the beginning and 384.3 MB in the end (delta: 184.0 MB). Free memory was 125.8 MB in the beginning and 239.3 MB in the end (delta: -113.5 MB). Peak memory consumption was 200.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:00:04,958 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.21 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 547.74 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 86.6 MB in the beginning and 173.6 MB in the end (delta: -87.0 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.17 ms. Allocated memory is still 200.3 MB. Free memory was 173.6 MB in the beginning and 171.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 761.37 ms. Allocated memory is still 200.3 MB. Free memory was 171.1 MB in the beginning and 126.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9282.99 ms. Allocated memory was 200.3 MB in the beginning and 384.3 MB in the end (delta: 184.0 MB). Free memory was 125.8 MB in the beginning and 239.3 MB in the end (delta: -113.5 MB). Peak memory consumption was 200.9 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: ((((((((!(0 <= \old(compRegistered)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((!(0 <= \old(compRegistered)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((((((((!(0 <= \old(compRegistered)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((((!(0 <= \old(compRegistered)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || 0 <= status) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((((((((!(0 <= \old(compRegistered)) || !(NP + 5 <= MPR3)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(compRegistered) <= 0)) || !(\old(s) <= NP)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(1 <= \old(s)) - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || (((s == MPR1 && 259 == returnVal2) && 1 <= setEventCalled) && setEventCalled <= 1)) || (s == MPR1 && 0 == returnVal2)) || (s == MPR1 && returnVal2 + 1073741823 <= 0)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(1 <= \old(s))) && ((((((!(0 <= compRegistered) || SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) || !(compRegistered <= 0)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((!(NP + 5 <= MPR3) || s == NP) || (((!(\old(s) == NP) || !(SKIP1 <= 3)) || 1 == pended) || !(1 <= compRegistered)) || !(3 <= SKIP1)) || !(NP + 4 <= MPR1)) && ((((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(setEventCalled) <= 1)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((!(0 <= \old(compRegistered)) || !(NP + 5 <= MPR3)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(compRegistered) <= 0)) || !(\old(s) <= NP)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(1 <= \old(s)) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || s == MPR1) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(1 <= \old(s))) && ((((((!(0 <= compRegistered) || SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) || !(compRegistered <= 0)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || ((s == MPR1 && 1 <= setEventCalled) && setEventCalled <= 1)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(1 <= \old(s))) && ((((((!(0 <= compRegistered) || SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) || !(compRegistered <= 0)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((((((!(0 <= \old(compRegistered)) || !(NP + 5 <= MPR3)) || !(\old(myStatus) + 1073741637 <= 0)) || myStatus + 1073741637 <= 0) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(compRegistered) <= 0)) || !(\old(s) <= NP)) || !(1 <= \old(s))) && ((((((((((!(0 <= \old(compRegistered)) || !(NP + 5 <= MPR3)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(compRegistered) <= 0)) || ((((0 <= compRegistered && 1 <= s) && 0 <= status) && s <= 1) && compRegistered <= 0)) || !(\old(s) <= NP)) || !(1 <= \old(s))) - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) || !(3 <= SKIP1)) || !(\old(setEventCalled) <= 1)) && (((!(NP + 5 <= MPR3) || (((!(\old(s) == NP) || !(SKIP1 <= 3)) || 1 == pended) || !(1 <= compRegistered)) || !(3 <= SKIP1)) || !(NP + 4 <= MPR1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((!(0 <= \old(compRegistered)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || (!(1 == pended) && SKIP1 <= 3 && 3 <= SKIP1)) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((!(0 <= \old(compRegistered)) || !(NP + 5 <= MPR3)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(3 <= SKIP1)) || !(\old(compRegistered) <= 0)) || !(\old(s) <= NP)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(1 <= \old(s)) - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) || !(3 <= SKIP1)) || !(\old(setEventCalled) <= 1)) && (((!(NP + 5 <= MPR3) || (((!(\old(s) == NP) || !(SKIP1 <= 3)) || 1 == pended) || !(1 <= compRegistered)) || !(3 <= SKIP1)) || !(NP + 4 <= MPR1)) || ((((!(1 == pended) && s == NP) && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1)) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || !(SKIP1 <= 3)) || 1 == pended) || !(NP + 4 <= MPR1)) || s == MPR1) || !(NP <= 1)) || !(3 <= SKIP1)) || !(1 <= compRegistered)) || !(\old(s) <= NP)) || !(1 <= \old(s))) && ((((((!(0 <= compRegistered) || SKIP1 == s) || !(SKIP1 <= 3)) || 1 == pended) || !(SKIP1 == \old(s))) || !(3 <= SKIP1)) || !(compRegistered <= 0)) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((((((!(0 <= \old(compRegistered)) || ((((((((((0 <= compRegistered && 1 <= s) && NP + 4 <= MPR1) && s <= NP) && !(1 == pended)) && NP + 5 <= MPR3) && 0 <= status) && NP <= 1) && SKIP1 <= 3) && 3 <= SKIP1) && compRegistered <= 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(MPR3) <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(compRegistered) <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(0 <= \old(MPR3)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. SAFE Result, 9.1s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2242 SDtfs, 1294 SDslu, 2998 SDs, 0 SdLazy, 679 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 114 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 309 PreInvPairs, 382 NumberOfFragments, 3044 HoareAnnotationTreeSize, 309 FomulaSimplifications, 319 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 53 FomulaSimplificationsInter, 4955 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 925 ConstructedInterpolants, 0 QuantifiedInterpolants, 94387 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...