/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:27:34,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:27:34,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:27:34,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:27:34,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:27:34,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:27:34,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:27:34,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:27:34,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:27:34,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:27:34,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:27:34,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:27:34,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:27:34,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:27:34,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:27:34,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:27:34,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:27:34,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:27:34,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:27:34,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:27:34,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:27:34,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:27:34,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:27:34,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:27:34,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:27:34,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:27:34,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:27:34,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:27:34,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:27:34,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:27:34,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:27:34,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:27:34,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:27:34,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:27:34,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:27:34,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:27:34,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:27:34,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:27:34,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:27:34,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:27:34,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:27:34,621 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-11-06 21:27:34,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:27:34,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:27:34,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:27:34,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:27:34,641 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:27:34,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:27:34,641 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:27:34,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:27:34,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:27:34,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:27:34,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:27:34,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:27:34,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:27:34,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:27:34,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:27:34,643 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:27:34,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:27:34,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:27:34,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:27:34,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:27:34,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:27:34,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:27:34,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:27:34,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:27:34,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:27:34,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:27:34,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:27:34,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:27:34,647 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:27:34,905 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:27:34,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:27:34,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:27:34,928 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:27:34,928 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:27:34,929 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-06 21:27:35,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ad1fe25/5bbd47d68d894fbd939e0717e3f0f007/FLAG15dabd7d8 [2019-11-06 21:27:35,514 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:27:35,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-06 21:27:35,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ad1fe25/5bbd47d68d894fbd939e0717e3f0f007/FLAG15dabd7d8 [2019-11-06 21:27:35,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ad1fe25/5bbd47d68d894fbd939e0717e3f0f007 [2019-11-06 21:27:35,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:27:35,876 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:27:35,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:27:35,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:27:35,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:27:35,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:35" (1/1) ... [2019-11-06 21:27:35,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f26af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:35, skipping insertion in model container [2019-11-06 21:27:35,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:35" (1/1) ... [2019-11-06 21:27:35,892 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:27:35,962 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:27:36,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:27:36,267 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:27:36,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:27:36,447 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:27:36,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36 WrapperNode [2019-11-06 21:27:36,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:27:36,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:27:36,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:27:36,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:27:36,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:36,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:36,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:36,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:36,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:36,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:36,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (1/1) ... [2019-11-06 21:27:36,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:27:36,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:27:36,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:27:36,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:27:36,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (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-11-06 21:27:36,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:27:36,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:27:36,587 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-06 21:27:36,587 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-06 21:27:36,588 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-11-06 21:27:36,589 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:27:36,589 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-06 21:27:36,589 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-06 21:27:36,589 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-06 21:27:36,589 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-06 21:27:36,589 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-06 21:27:36,590 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-11-06 21:27:36,590 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-11-06 21:27:36,590 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-11-06 21:27:36,591 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-11-06 21:27:36,592 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-11-06 21:27:36,593 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-11-06 21:27:36,593 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-06 21:27:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:27:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 21:27:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:27:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 21:27:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 21:27:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-11-06 21:27:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-11-06 21:27:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-06 21:27:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-06 21:27:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-06 21:27:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-11-06 21:27:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-11-06 21:27:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-11-06 21:27:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-11-06 21:27:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-11-06 21:27:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-06 21:27:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-06 21:27:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-06 21:27:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-06 21:27:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:27:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-06 21:27:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:27:36,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:27:36,850 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:36,952 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-11-06 21:27:36,953 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-11-06 21:27:36,974 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:37,135 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-06 21:27:37,135 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-06 21:27:37,137 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:37,190 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-06 21:27:37,190 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-06 21:27:37,205 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:37,241 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-06 21:27:37,242 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-06 21:27:37,364 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:37,384 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-06 21:27:37,385 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-06 21:27:37,417 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:37,544 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-11-06 21:27:37,545 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-11-06 21:27:37,555 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:27:37,556 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 21:27:37,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:37 BoogieIcfgContainer [2019-11-06 21:27:37,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:27:37,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:27:37,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:27:37,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:27:37,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:27:35" (1/3) ... [2019-11-06 21:27:37,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da4d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:37, skipping insertion in model container [2019-11-06 21:27:37,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:36" (2/3) ... [2019-11-06 21:27:37,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da4d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:37, skipping insertion in model container [2019-11-06 21:27:37,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:37" (3/3) ... [2019-11-06 21:27:37,567 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-11-06 21:27:37,577 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:27:37,586 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:27:37,598 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:27:37,629 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:27:37,629 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:27:37,630 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:27:37,630 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:27:37,630 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:27:37,630 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:27:37,630 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:27:37,631 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:27:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2019-11-06 21:27:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:27:37,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:37,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:37,670 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:37,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:37,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1712773315, now seen corresponding path program 1 times [2019-11-06 21:27:37,682 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:37,683 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758031049] [2019-11-06 21:27:37,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:38,107 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758031049] [2019-11-06 21:27:38,107 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:38,108 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:27:38,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133437911] [2019-11-06 21:27:38,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:27:38,115 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:38,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:27:38,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:27:38,132 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 5 states. [2019-11-06 21:27:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:39,205 INFO L93 Difference]: Finished difference Result 416 states and 625 transitions. [2019-11-06 21:27:39,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:27:39,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-06 21:27:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:39,235 INFO L225 Difference]: With dead ends: 416 [2019-11-06 21:27:39,236 INFO L226 Difference]: Without dead ends: 256 [2019-11-06 21:27:39,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:27:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-06 21:27:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2019-11-06 21:27:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-06 21:27:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2019-11-06 21:27:39,327 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2019-11-06 21:27:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:39,328 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2019-11-06 21:27:39,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:27:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2019-11-06 21:27:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:27:39,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:39,330 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:39,330 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:39,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:39,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1840561730, now seen corresponding path program 1 times [2019-11-06 21:27:39,331 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:39,331 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533349309] [2019-11-06 21:27:39,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:39,616 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533349309] [2019-11-06 21:27:39,617 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:39,618 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:39,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828233935] [2019-11-06 21:27:39,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:39,620 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:39,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:39,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:39,621 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand 6 states. [2019-11-06 21:27:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:40,790 INFO L93 Difference]: Finished difference Result 401 states and 553 transitions. [2019-11-06 21:27:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:40,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-06 21:27:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:40,794 INFO L225 Difference]: With dead ends: 401 [2019-11-06 21:27:40,795 INFO L226 Difference]: Without dead ends: 343 [2019-11-06 21:27:40,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-06 21:27:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2019-11-06 21:27:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-06 21:27:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2019-11-06 21:27:40,837 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2019-11-06 21:27:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:40,838 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2019-11-06 21:27:40,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2019-11-06 21:27:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:27:40,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:40,840 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:40,840 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:40,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:40,841 INFO L82 PathProgramCache]: Analyzing trace with hash -919522484, now seen corresponding path program 1 times [2019-11-06 21:27:40,841 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:40,841 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993601201] [2019-11-06 21:27:40,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:41,052 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993601201] [2019-11-06 21:27:41,052 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:41,052 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:41,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081681534] [2019-11-06 21:27:41,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:41,053 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:41,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:41,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:41,054 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand 6 states. [2019-11-06 21:27:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:41,834 INFO L93 Difference]: Finished difference Result 478 states and 635 transitions. [2019-11-06 21:27:41,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:41,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-06 21:27:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:41,839 INFO L225 Difference]: With dead ends: 478 [2019-11-06 21:27:41,839 INFO L226 Difference]: Without dead ends: 362 [2019-11-06 21:27:41,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-06 21:27:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2019-11-06 21:27:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-11-06 21:27:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2019-11-06 21:27:41,874 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2019-11-06 21:27:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:41,875 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2019-11-06 21:27:41,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2019-11-06 21:27:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 21:27:41,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:41,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:41,878 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:41,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:41,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1823384951, now seen corresponding path program 1 times [2019-11-06 21:27:41,879 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:41,879 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181274462] [2019-11-06 21:27:41,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:42,035 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181274462] [2019-11-06 21:27:42,035 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:42,035 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:42,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772978802] [2019-11-06 21:27:42,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:42,036 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:42,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:42,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:42,037 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. Second operand 6 states. [2019-11-06 21:27:42,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:42,742 INFO L93 Difference]: Finished difference Result 344 states and 464 transitions. [2019-11-06 21:27:42,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:42,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-11-06 21:27:42,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:42,745 INFO L225 Difference]: With dead ends: 344 [2019-11-06 21:27:42,746 INFO L226 Difference]: Without dead ends: 340 [2019-11-06 21:27:42,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:27:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-06 21:27:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2019-11-06 21:27:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-11-06 21:27:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2019-11-06 21:27:42,774 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2019-11-06 21:27:42,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:42,775 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2019-11-06 21:27:42,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2019-11-06 21:27:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-06 21:27:42,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:42,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:42,779 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:42,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:42,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1946925920, now seen corresponding path program 1 times [2019-11-06 21:27:42,780 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:42,780 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723579027] [2019-11-06 21:27:42,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:42,972 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723579027] [2019-11-06 21:27:42,973 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:42,973 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:42,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205293752] [2019-11-06 21:27:42,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:42,975 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:42,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:42,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:42,976 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand 8 states. [2019-11-06 21:27:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:43,881 INFO L93 Difference]: Finished difference Result 385 states and 508 transitions. [2019-11-06 21:27:43,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:27:43,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-11-06 21:27:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:43,888 INFO L225 Difference]: With dead ends: 385 [2019-11-06 21:27:43,889 INFO L226 Difference]: Without dead ends: 319 [2019-11-06 21:27:43,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:27:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-06 21:27:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2019-11-06 21:27:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-06 21:27:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2019-11-06 21:27:43,911 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2019-11-06 21:27:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:43,911 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2019-11-06 21:27:43,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2019-11-06 21:27:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 21:27:43,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:43,913 INFO L410 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-11-06 21:27:43,914 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:43,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:43,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1615603168, now seen corresponding path program 1 times [2019-11-06 21:27:43,914 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:43,915 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734687650] [2019-11-06 21:27:43,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:44,110 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734687650] [2019-11-06 21:27:44,110 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:44,111 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:44,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548825743] [2019-11-06 21:27:44,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:44,112 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:44,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:44,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:44,112 INFO L87 Difference]: Start difference. First operand 301 states and 402 transitions. Second operand 8 states. [2019-11-06 21:27:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:44,489 INFO L93 Difference]: Finished difference Result 310 states and 413 transitions. [2019-11-06 21:27:44,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:27:44,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-06 21:27:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:44,491 INFO L225 Difference]: With dead ends: 310 [2019-11-06 21:27:44,491 INFO L226 Difference]: Without dead ends: 102 [2019-11-06 21:27:44,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:27:44,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-06 21:27:44,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-06 21:27:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-06 21:27:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2019-11-06 21:27:44,501 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2019-11-06 21:27:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:44,501 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2019-11-06 21:27:44,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2019-11-06 21:27:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-06 21:27:44,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:44,502 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:44,503 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:44,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:44,503 INFO L82 PathProgramCache]: Analyzing trace with hash -582629432, now seen corresponding path program 1 times [2019-11-06 21:27:44,503 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:44,504 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345983649] [2019-11-06 21:27:44,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:44,707 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345983649] [2019-11-06 21:27:44,707 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:44,707 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:44,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626334143] [2019-11-06 21:27:44,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:44,709 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:44,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:44,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:44,709 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 8 states. [2019-11-06 21:27:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:44,979 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2019-11-06 21:27:44,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:27:44,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-06 21:27:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:44,981 INFO L225 Difference]: With dead ends: 130 [2019-11-06 21:27:44,981 INFO L226 Difference]: Without dead ends: 100 [2019-11-06 21:27:44,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:27:44,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-06 21:27:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-06 21:27:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-06 21:27:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2019-11-06 21:27:44,991 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2019-11-06 21:27:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:44,992 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2019-11-06 21:27:44,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2019-11-06 21:27:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-06 21:27:44,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:44,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:44,993 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1306380805, now seen corresponding path program 1 times [2019-11-06 21:27:44,994 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:44,994 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540702612] [2019-11-06 21:27:44,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:45,222 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540702612] [2019-11-06 21:27:45,222 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:45,222 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 21:27:45,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298634097] [2019-11-06 21:27:45,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:27:45,223 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:45,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:27:45,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:27:45,224 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 11 states. [2019-11-06 21:27:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:45,450 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2019-11-06 21:27:45,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:27:45,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-11-06 21:27:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:45,455 INFO L225 Difference]: With dead ends: 152 [2019-11-06 21:27:45,455 INFO L226 Difference]: Without dead ends: 111 [2019-11-06 21:27:45,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:27:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-06 21:27:45,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2019-11-06 21:27:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-06 21:27:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2019-11-06 21:27:45,465 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2019-11-06 21:27:45,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:45,466 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2019-11-06 21:27:45,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:27:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2019-11-06 21:27:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-06 21:27:45,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:45,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:45,467 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:45,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:45,467 INFO L82 PathProgramCache]: Analyzing trace with hash -538994442, now seen corresponding path program 1 times [2019-11-06 21:27:45,468 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:45,468 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560893666] [2019-11-06 21:27:45,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:45,725 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560893666] [2019-11-06 21:27:45,725 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:45,725 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 21:27:45,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117719300] [2019-11-06 21:27:45,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:27:45,726 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:45,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:27:45,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:27:45,727 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 11 states. [2019-11-06 21:27:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:46,010 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2019-11-06 21:27:46,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:27:46,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-11-06 21:27:46,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:46,012 INFO L225 Difference]: With dead ends: 116 [2019-11-06 21:27:46,013 INFO L226 Difference]: Without dead ends: 109 [2019-11-06 21:27:46,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:27:46,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-06 21:27:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-11-06 21:27:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-06 21:27:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-11-06 21:27:46,023 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2019-11-06 21:27:46,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:46,023 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-11-06 21:27:46,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:27:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-11-06 21:27:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 21:27:46,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:46,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:46,024 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:46,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:46,025 INFO L82 PathProgramCache]: Analyzing trace with hash -914264427, now seen corresponding path program 1 times [2019-11-06 21:27:46,025 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:46,025 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114877296] [2019-11-06 21:27:46,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:46,176 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114877296] [2019-11-06 21:27:46,176 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:46,176 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:46,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638166295] [2019-11-06 21:27:46,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:46,177 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:46,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:46,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:46,178 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 8 states. [2019-11-06 21:27:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:46,484 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2019-11-06 21:27:46,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:27:46,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-06 21:27:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:46,485 INFO L225 Difference]: With dead ends: 122 [2019-11-06 21:27:46,485 INFO L226 Difference]: Without dead ends: 117 [2019-11-06 21:27:46,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:27:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-06 21:27:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-11-06 21:27:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-06 21:27:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-11-06 21:27:46,495 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 58 [2019-11-06 21:27:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:46,496 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-11-06 21:27:46,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-11-06 21:27:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 21:27:46,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:46,497 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:46,497 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1535327622, now seen corresponding path program 1 times [2019-11-06 21:27:46,498 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:46,498 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759424770] [2019-11-06 21:27:46,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:46,756 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759424770] [2019-11-06 21:27:46,756 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:46,757 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 21:27:46,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537050646] [2019-11-06 21:27:46,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:27:46,758 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:46,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:27:46,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:27:46,759 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 10 states. [2019-11-06 21:27:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:46,944 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2019-11-06 21:27:46,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:27:46,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-11-06 21:27:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:46,946 INFO L225 Difference]: With dead ends: 146 [2019-11-06 21:27:46,946 INFO L226 Difference]: Without dead ends: 102 [2019-11-06 21:27:46,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:27:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-06 21:27:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-11-06 21:27:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-06 21:27:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-11-06 21:27:46,961 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 58 [2019-11-06 21:27:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:46,963 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-11-06 21:27:46,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:27:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-11-06 21:27:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-06 21:27:46,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:46,964 INFO L410 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-11-06 21:27:46,965 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:46,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1832020397, now seen corresponding path program 1 times [2019-11-06 21:27:46,965 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:46,965 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939857440] [2019-11-06 21:27:46,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:47,232 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939857440] [2019-11-06 21:27:47,232 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:47,232 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 21:27:47,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464408467] [2019-11-06 21:27:47,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 21:27:47,233 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:47,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 21:27:47,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:27:47,234 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 12 states. [2019-11-06 21:27:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:47,643 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2019-11-06 21:27:47,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:27:47,644 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-11-06 21:27:47,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:47,645 INFO L225 Difference]: With dead ends: 132 [2019-11-06 21:27:47,645 INFO L226 Difference]: Without dead ends: 94 [2019-11-06 21:27:47,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-06 21:27:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-06 21:27:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-11-06 21:27:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-06 21:27:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-06 21:27:47,655 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 62 [2019-11-06 21:27:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:47,656 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-06 21:27:47,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 21:27:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-06 21:27:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-06 21:27:47,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:47,657 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:47,657 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash 198062706, now seen corresponding path program 1 times [2019-11-06 21:27:47,658 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:47,658 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282053454] [2019-11-06 21:27:47,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:47,837 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282053454] [2019-11-06 21:27:47,838 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:47,838 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 21:27:47,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815652348] [2019-11-06 21:27:47,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 21:27:47,839 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:47,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 21:27:47,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:27:47,840 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 9 states. [2019-11-06 21:27:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:48,032 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2019-11-06 21:27:48,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:27:48,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-11-06 21:27:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:48,034 INFO L225 Difference]: With dead ends: 130 [2019-11-06 21:27:48,034 INFO L226 Difference]: Without dead ends: 100 [2019-11-06 21:27:48,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:27:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-06 21:27:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-11-06 21:27:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-06 21:27:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-06 21:27:48,043 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2019-11-06 21:27:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:48,044 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-06 21:27:48,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 21:27:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-06 21:27:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-06 21:27:48,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:48,045 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:48,045 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:48,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:48,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1883613746, now seen corresponding path program 1 times [2019-11-06 21:27:48,046 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:48,046 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074413790] [2019-11-06 21:27:48,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:48,297 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074413790] [2019-11-06 21:27:48,297 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:48,297 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 21:27:48,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951088053] [2019-11-06 21:27:48,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 21:27:48,298 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:48,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 21:27:48,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:27:48,299 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 13 states. [2019-11-06 21:27:48,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:48,718 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-11-06 21:27:48,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:27:48,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-11-06 21:27:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:48,719 INFO L225 Difference]: With dead ends: 116 [2019-11-06 21:27:48,719 INFO L226 Difference]: Without dead ends: 97 [2019-11-06 21:27:48,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:27:48,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-06 21:27:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-11-06 21:27:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-06 21:27:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-11-06 21:27:48,728 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 64 [2019-11-06 21:27:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:48,728 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-11-06 21:27:48,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 21:27:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-11-06 21:27:48,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-06 21:27:48,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:48,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:48,730 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:48,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:48,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1968245100, now seen corresponding path program 1 times [2019-11-06 21:27:48,730 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:48,730 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439861930] [2019-11-06 21:27:48,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:48,988 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439861930] [2019-11-06 21:27:48,988 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:48,989 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-06 21:27:48,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867661877] [2019-11-06 21:27:48,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:27:48,989 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:27:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:27:48,990 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 14 states. [2019-11-06 21:27:49,242 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-06 21:27:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:49,748 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-11-06 21:27:49,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 21:27:49,749 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-11-06 21:27:49,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:49,750 INFO L225 Difference]: With dead ends: 109 [2019-11-06 21:27:49,750 INFO L226 Difference]: Without dead ends: 91 [2019-11-06 21:27:49,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2019-11-06 21:27:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-06 21:27:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2019-11-06 21:27:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-06 21:27:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2019-11-06 21:27:49,767 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2019-11-06 21:27:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:49,767 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2019-11-06 21:27:49,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:27:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2019-11-06 21:27:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-06 21:27:49,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:49,769 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:49,769 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash -603130258, now seen corresponding path program 1 times [2019-11-06 21:27:49,770 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:49,771 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715698669] [2019-11-06 21:27:49,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:50,085 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715698669] [2019-11-06 21:27:50,087 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:50,087 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 21:27:50,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028402203] [2019-11-06 21:27:50,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:27:50,088 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:50,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:27:50,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:27:50,089 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 11 states. [2019-11-06 21:27:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:50,556 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-11-06 21:27:50,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:27:50,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-06 21:27:50,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:50,558 INFO L225 Difference]: With dead ends: 98 [2019-11-06 21:27:50,558 INFO L226 Difference]: Without dead ends: 78 [2019-11-06 21:27:50,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:27:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-06 21:27:50,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-06 21:27:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-06 21:27:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-11-06 21:27:50,571 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2019-11-06 21:27:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:50,571 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-11-06 21:27:50,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:27:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-11-06 21:27:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-06 21:27:50,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:50,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:50,574 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1151601388, now seen corresponding path program 1 times [2019-11-06 21:27:50,574 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:50,575 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573299152] [2019-11-06 21:27:50,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:50,901 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573299152] [2019-11-06 21:27:50,902 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:50,902 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 21:27:50,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146798686] [2019-11-06 21:27:50,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 21:27:50,903 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:50,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 21:27:50,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:27:50,903 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 12 states. [2019-11-06 21:27:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:51,201 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2019-11-06 21:27:51,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:27:51,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-11-06 21:27:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:51,202 INFO L225 Difference]: With dead ends: 87 [2019-11-06 21:27:51,203 INFO L226 Difference]: Without dead ends: 78 [2019-11-06 21:27:51,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:27:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-06 21:27:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-06 21:27:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-06 21:27:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-11-06 21:27:51,213 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2019-11-06 21:27:51,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:51,213 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-11-06 21:27:51,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 21:27:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-11-06 21:27:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-06 21:27:51,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:51,217 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:51,217 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:51,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:51,218 INFO L82 PathProgramCache]: Analyzing trace with hash -42695807, now seen corresponding path program 1 times [2019-11-06 21:27:51,218 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:51,218 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369618461] [2019-11-06 21:27:51,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:51,460 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369618461] [2019-11-06 21:27:51,460 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:51,460 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 21:27:51,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534665516] [2019-11-06 21:27:51,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:27:51,461 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:51,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:27:51,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:27:51,461 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 11 states. [2019-11-06 21:27:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:51,638 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-11-06 21:27:51,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:27:51,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2019-11-06 21:27:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:51,639 INFO L225 Difference]: With dead ends: 78 [2019-11-06 21:27:51,640 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:27:51,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:27:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:27:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:27:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:27:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:27:51,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2019-11-06 21:27:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:51,642 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:27:51,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:27:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:27:51,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:27:51,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:27:52,496 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 18 [2019-11-06 21:27:52,654 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-11-06 21:27:52,855 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2019-11-06 21:27:52,965 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-06 21:27:53,685 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2019-11-06 21:27:54,792 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-11-06 21:27:55,016 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2019-11-06 21:27:55,798 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2019-11-06 21:27:56,090 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2019-11-06 21:27:56,365 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2019-11-06 21:27:56,804 INFO L439 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 567 574) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= ~s~0 1)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 1 ~s~0))) [2019-11-06 21:27:56,804 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 567 574) no Hoare annotation was computed. [2019-11-06 21:27:56,804 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 567 574) no Hoare annotation was computed. [2019-11-06 21:27:56,804 INFO L439 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 617 627) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= ~s~0 1)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 1 ~s~0))) [2019-11-06 21:27:56,805 INFO L439 ceAbstractionStarter]: At program point L623(line 623) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= ~s~0 1)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 1 ~s~0))) [2019-11-06 21:27:56,805 INFO L443 ceAbstractionStarter]: For program point L623-1(line 623) no Hoare annotation was computed. [2019-11-06 21:27:56,805 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteFINAL(lines 617 627) no Hoare annotation was computed. [2019-11-06 21:27:56,805 INFO L443 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 617 627) no Hoare annotation was computed. [2019-11-06 21:27:56,805 INFO L443 ceAbstractionStarter]: For program point L702(lines 702 727) no Hoare annotation was computed. [2019-11-06 21:27:56,806 INFO L439 ceAbstractionStarter]: At program point L733(line 733) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2019-11-06 21:27:56,806 INFO L439 ceAbstractionStarter]: At program point L700(lines 699 728) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|))) [2019-11-06 21:27:56,806 INFO L443 ceAbstractionStarter]: For program point L733-1(lines 729 735) no Hoare annotation was computed. [2019-11-06 21:27:56,806 INFO L439 ceAbstractionStarter]: At program point L723(lines 698 742) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|))) [2019-11-06 21:27:56,806 INFO L443 ceAbstractionStarter]: For program point KbFilter_PowerEXIT(lines 688 743) no Hoare annotation was computed. [2019-11-06 21:27:56,806 INFO L439 ceAbstractionStarter]: At program point KbFilter_PowerENTRY(lines 688 743) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|))) [2019-11-06 21:27:56,807 INFO L443 ceAbstractionStarter]: For program point L705(lines 705 726) no Hoare annotation was computed. [2019-11-06 21:27:56,807 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 728) no Hoare annotation was computed. [2019-11-06 21:27:56,807 INFO L443 ceAbstractionStarter]: For program point KbFilter_PowerFINAL(lines 688 743) no Hoare annotation was computed. [2019-11-06 21:27:56,807 INFO L443 ceAbstractionStarter]: For program point L708(lines 708 725) no Hoare annotation was computed. [2019-11-06 21:27:56,807 INFO L439 ceAbstractionStarter]: At program point L739(line 739) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~s~0)) [2019-11-06 21:27:56,807 INFO L443 ceAbstractionStarter]: For program point L739-1(line 739) no Hoare annotation was computed. [2019-11-06 21:27:56,807 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 42 55) no Hoare annotation was computed. [2019-11-06 21:27:56,808 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 42 55) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= ~pended~0 |old(~pended~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~s~0 ~NP~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|))) [2019-11-06 21:27:56,808 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 42 55) no Hoare annotation was computed. [2019-11-06 21:27:56,808 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 56 77) no Hoare annotation was computed. [2019-11-06 21:27:56,808 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 56 77) the Hoare annotation is: (or (and (= ~pended~0 |old(~pended~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~DC~0 |old(~DC~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0) (= ~NP~0 ~MPR1~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~MPR1~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~MPR3~0 |old(~MPR3~0)|)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,808 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 56 77) no Hoare annotation was computed. [2019-11-06 21:27:56,808 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 1008 1015) the Hoare annotation is: true [2019-11-06 21:27:56,808 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 1008 1015) no Hoare annotation was computed. [2019-11-06 21:27:56,809 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-11-06 21:27:56,809 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 1008 1015) no Hoare annotation was computed. [2019-11-06 21:27:56,809 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 456) no Hoare annotation was computed. [2019-11-06 21:27:56,809 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 294 465) no Hoare annotation was computed. [2019-11-06 21:27:56,809 INFO L439 ceAbstractionStarter]: At program point L440(lines 431 458) the Hoare annotation is: (or (not (= 1 ~pended~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,809 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 438) no Hoare annotation was computed. [2019-11-06 21:27:56,809 INFO L443 ceAbstractionStarter]: For program point L399(line 399) no Hoare annotation was computed. [2019-11-06 21:27:56,809 INFO L439 ceAbstractionStarter]: At program point L358(lines 357 410) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,809 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 451) no Hoare annotation was computed. [2019-11-06 21:27:56,809 INFO L439 ceAbstractionStarter]: At program point L375(lines 374 407) the Hoare annotation is: (or (<= 0 main_~status~1) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,810 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 435) no Hoare annotation was computed. [2019-11-06 21:27:56,810 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 408) no Hoare annotation was computed. [2019-11-06 21:27:56,810 INFO L443 ceAbstractionStarter]: For program point L384(line 384) no Hoare annotation was computed. [2019-11-06 21:27:56,810 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 446) no Hoare annotation was computed. [2019-11-06 21:27:56,810 INFO L443 ceAbstractionStarter]: For program point L343(lines 329 412) no Hoare annotation was computed. [2019-11-06 21:27:56,810 INFO L439 ceAbstractionStarter]: At program point L368(lines 367 408) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,810 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 294 465) no Hoare annotation was computed. [2019-11-06 21:27:56,810 INFO L439 ceAbstractionStarter]: At program point L327(line 327) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~MPR1~0 ~s~0) (<= 0 main_~status~1) (= ~NP~0 ~MPR1~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0))) [2019-11-06 21:27:56,810 INFO L443 ceAbstractionStarter]: For program point L327-1(lines 323 464) no Hoare annotation was computed. [2019-11-06 21:27:56,810 INFO L443 ceAbstractionStarter]: For program point L352(lines 352 411) no Hoare annotation was computed. [2019-11-06 21:27:56,811 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 294 465) the Hoare annotation is: (or (and (= ~pended~0 |old(~pended~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~DC~0 |old(~DC~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 ~s~0) (= ~Executive~0 |old(~Executive~0)|) (= ~NP~0 ~MPR1~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~DevicePowerState~0 |old(~DevicePowerState~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~MPR1~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~MPR3~0 |old(~MPR3~0)|)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,811 INFO L443 ceAbstractionStarter]: For program point L394(line 394) no Hoare annotation was computed. [2019-11-06 21:27:56,811 INFO L439 ceAbstractionStarter]: At program point L353(lines 352 411) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,811 INFO L439 ceAbstractionStarter]: At program point L444(line 444) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,811 INFO L439 ceAbstractionStarter]: At program point L428(lines 421 461) the Hoare annotation is: (or (not (= 1 ~pended~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,811 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 409) no Hoare annotation was computed. [2019-11-06 21:27:56,811 INFO L439 ceAbstractionStarter]: At program point L329(lines 323 464) the Hoare annotation is: (or (not (= 1 ~pended~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,812 INFO L443 ceAbstractionStarter]: For program point L453(lines 453 455) no Hoare annotation was computed. [2019-11-06 21:27:56,812 INFO L439 ceAbstractionStarter]: At program point L420(lines 413 462) the Hoare annotation is: (or (not (= 1 ~pended~0)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,812 INFO L443 ceAbstractionStarter]: For program point L379(line 379) no Hoare annotation was computed. [2019-11-06 21:27:56,812 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 341) no Hoare annotation was computed. [2019-11-06 21:27:56,812 INFO L439 ceAbstractionStarter]: At program point L338-2(lines 338 341) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (<= ~s~0 1) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2019-11-06 21:27:56,812 INFO L443 ceAbstractionStarter]: For program point L429(lines 413 462) no Hoare annotation was computed. [2019-11-06 21:27:56,812 INFO L439 ceAbstractionStarter]: At program point L363(lines 362 409) the Hoare annotation is: (or (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1) (<= ~s~0 1) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0))) [2019-11-06 21:27:56,813 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 407) no Hoare annotation was computed. [2019-11-06 21:27:56,813 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 459) no Hoare annotation was computed. [2019-11-06 21:27:56,813 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 426) no Hoare annotation was computed. [2019-11-06 21:27:56,813 INFO L443 ceAbstractionStarter]: For program point L389(line 389) no Hoare annotation was computed. [2019-11-06 21:27:56,813 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 418) no Hoare annotation was computed. [2019-11-06 21:27:56,813 INFO L439 ceAbstractionStarter]: At program point L373(lines 372 407) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= 0 main_~status~1)) (not (= |old(~NP~0)| |old(~MPR1~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2019-11-06 21:27:56,813 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 458) no Hoare annotation was computed. [2019-11-06 21:27:56,813 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 410) no Hoare annotation was computed. [2019-11-06 21:27:56,814 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 548) no Hoare annotation was computed. [2019-11-06 21:27:56,814 INFO L443 ceAbstractionStarter]: For program point L494(lines 494 498) no Hoare annotation was computed. [2019-11-06 21:27:56,814 INFO L439 ceAbstractionStarter]: At program point L523(lines 487 551) the Hoare annotation is: (let ((.cse2 (= 1 ~pended~0))) (and (let ((.cse0 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (.cse1 (= ~MPR1~0 ~s~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and .cse0 .cse1 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse2 (not (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse0 .cse1 (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (and .cse0 .cse1 (= 259 IofCallDriver_~returnVal2~0) (= ~setEventCalled~0 1)) (not (<= 1 |old(~s~0)|)))) (or .cse2 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0))))) [2019-11-06 21:27:56,814 INFO L439 ceAbstractionStarter]: At program point L490(line 490) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (not (<= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-11-06 21:27:56,814 INFO L443 ceAbstractionStarter]: For program point L490-1(line 490) no Hoare annotation was computed. [2019-11-06 21:27:56,815 INFO L439 ceAbstractionStarter]: At program point L511(lines 510 525) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0))))) [2019-11-06 21:27:56,815 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 547) no Hoare annotation was computed. [2019-11-06 21:27:56,815 INFO L443 ceAbstractionStarter]: For program point L503(lines 503 526) no Hoare annotation was computed. [2019-11-06 21:27:56,815 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 538) no Hoare annotation was computed. [2019-11-06 21:27:56,815 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 480 552) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0)) (.cse2 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse1 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (and .cse1 .cse2 (= ~SKIP1~0 ~s~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (and .cse2 (= ~s~0 ~NP~0) .cse1) (not (<= 1 |old(~s~0)|))))) [2019-11-06 21:27:56,815 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 480 552) no Hoare annotation was computed. [2019-11-06 21:27:56,815 INFO L439 ceAbstractionStarter]: At program point L545(line 545) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-11-06 21:27:56,816 INFO L443 ceAbstractionStarter]: For program point L545-1(lines 527 549) no Hoare annotation was computed. [2019-11-06 21:27:56,816 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 525) no Hoare annotation was computed. [2019-11-06 21:27:56,816 INFO L439 ceAbstractionStarter]: At program point L504(lines 503 526) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~MPR1~0 ~s~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))))) [2019-11-06 21:27:56,816 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 480 552) no Hoare annotation was computed. [2019-11-06 21:27:56,816 INFO L439 ceAbstractionStarter]: At program point L496(line 496) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (<= ~s~0 1) (<= 1 ~s~0) (= ~setEventCalled~0 1)) (not (<= |old(~s~0)| 1)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))))) [2019-11-06 21:27:56,816 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 500) no Hoare annotation was computed. [2019-11-06 21:27:56,816 INFO L443 ceAbstractionStarter]: For program point L488-1(lines 488 500) no Hoare annotation was computed. [2019-11-06 21:27:56,817 INFO L439 ceAbstractionStarter]: At program point L509(lines 508 525) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or .cse0 (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0) (= ~MPR1~0 ~s~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))))) [2019-11-06 21:27:56,817 INFO L439 ceAbstractionStarter]: At program point L474(line 474) the Hoare annotation is: (or (not (= ~setEventCalled~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,817 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 466 479) no Hoare annotation was computed. [2019-11-06 21:27:56,817 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 466 479) the Hoare annotation is: (or (not (= ~setEventCalled~0 1)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (= ~s~0 ~NP~0) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,817 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 466 479) no Hoare annotation was computed. [2019-11-06 21:27:56,817 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2019-11-06 21:27:56,817 INFO L443 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 744 820) no Hoare annotation was computed. [2019-11-06 21:27:56,817 INFO L443 ceAbstractionStarter]: For program point L808(lines 808 815) no Hoare annotation was computed. [2019-11-06 21:27:56,818 INFO L443 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 744 820) no Hoare annotation was computed. [2019-11-06 21:27:56,818 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 816) no Hoare annotation was computed. [2019-11-06 21:27:56,818 INFO L443 ceAbstractionStarter]: For program point L759(lines 759 763) no Hoare annotation was computed. [2019-11-06 21:27:56,818 INFO L439 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 744 820) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0))) [2019-11-06 21:27:56,818 INFO L439 ceAbstractionStarter]: At program point L788(lines 752 819) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0))) [2019-11-06 21:27:56,818 INFO L439 ceAbstractionStarter]: At program point L755(line 755) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-11-06 21:27:56,818 INFO L443 ceAbstractionStarter]: For program point L755-1(line 755) no Hoare annotation was computed. [2019-11-06 21:27:56,818 INFO L439 ceAbstractionStarter]: At program point L813(line 813) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-11-06 21:27:56,819 INFO L443 ceAbstractionStarter]: For program point L813-1(lines 792 817) no Hoare annotation was computed. [2019-11-06 21:27:56,819 INFO L439 ceAbstractionStarter]: At program point L776(lines 775 790) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0))) [2019-11-06 21:27:56,819 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 791) no Hoare annotation was computed. [2019-11-06 21:27:56,819 INFO L443 ceAbstractionStarter]: For program point L773(lines 773 790) no Hoare annotation was computed. [2019-11-06 21:27:56,819 INFO L439 ceAbstractionStarter]: At program point L769(lines 768 791) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0))) [2019-11-06 21:27:56,819 INFO L439 ceAbstractionStarter]: At program point L761(line 761) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|))) [2019-11-06 21:27:56,819 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 765) no Hoare annotation was computed. [2019-11-06 21:27:56,819 INFO L443 ceAbstractionStarter]: For program point L753-1(lines 753 765) no Hoare annotation was computed. [2019-11-06 21:27:56,820 INFO L439 ceAbstractionStarter]: At program point L774(lines 773 790) the Hoare annotation is: (or (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0))) [2019-11-06 21:27:56,820 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 654) no Hoare annotation was computed. [2019-11-06 21:27:56,820 INFO L439 ceAbstractionStarter]: At program point L659(line 659) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|))) [2019-11-06 21:27:56,820 INFO L443 ceAbstractionStarter]: For program point KbFilter_CreateCloseEXIT(lines 628 663) no Hoare annotation was computed. [2019-11-06 21:27:56,820 INFO L443 ceAbstractionStarter]: For program point L659-1(line 659) no Hoare annotation was computed. [2019-11-06 21:27:56,820 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 653) no Hoare annotation was computed. [2019-11-06 21:27:56,820 INFO L443 ceAbstractionStarter]: For program point L637(lines 637 655) no Hoare annotation was computed. [2019-11-06 21:27:56,820 INFO L439 ceAbstractionStarter]: At program point KbFilter_CreateCloseENTRY(lines 628 663) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-11-06 21:27:56,820 INFO L443 ceAbstractionStarter]: For program point KbFilter_CreateCloseFINAL(lines 628 663) no Hoare annotation was computed. [2019-11-06 21:27:56,821 INFO L439 ceAbstractionStarter]: At program point L652(lines 640 654) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-11-06 21:27:56,821 INFO L439 ceAbstractionStarter]: At program point L644(lines 637 655) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-11-06 21:27:56,821 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:27:56,821 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~pended~0 |old(~pended~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~s~0 |old(~s~0)|) (= ~DC~0 |old(~DC~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~DevicePowerState~0 |old(~DevicePowerState~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~MPR3~0 |old(~MPR3~0)|)) [2019-11-06 21:27:56,821 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:27:56,821 INFO L443 ceAbstractionStarter]: For program point L923(lines 923 975) no Hoare annotation was computed. [2019-11-06 21:27:56,821 INFO L443 ceAbstractionStarter]: For program point L890(lines 890 985) no Hoare annotation was computed. [2019-11-06 21:27:56,822 INFO L443 ceAbstractionStarter]: For program point L882(lines 882 987) no Hoare annotation was computed. [2019-11-06 21:27:56,822 INFO L443 ceAbstractionStarter]: For program point KbFilter_InternIoCtlEXIT(lines 821 1006) no Hoare annotation was computed. [2019-11-06 21:27:56,822 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 989) no Hoare annotation was computed. [2019-11-06 21:27:56,822 INFO L439 ceAbstractionStarter]: At program point L1002(line 1002) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-11-06 21:27:56,822 INFO L443 ceAbstractionStarter]: For program point L1002-1(line 1002) no Hoare annotation was computed. [2019-11-06 21:27:56,822 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 983) no Hoare annotation was computed. [2019-11-06 21:27:56,822 INFO L439 ceAbstractionStarter]: At program point L891(lines 890 985) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-11-06 21:27:56,822 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 977) no Hoare annotation was computed. [2019-11-06 21:27:56,822 INFO L439 ceAbstractionStarter]: At program point L883(lines 882 987) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-11-06 21:27:56,823 INFO L443 ceAbstractionStarter]: For program point L933(lines 933 972) no Hoare annotation was computed. [2019-11-06 21:27:56,823 INFO L443 ceAbstractionStarter]: For program point L958-1(lines 958 960) no Hoare annotation was computed. [2019-11-06 21:27:56,823 INFO L443 ceAbstractionStarter]: For program point L909(lines 909 979) no Hoare annotation was computed. [2019-11-06 21:27:56,823 INFO L439 ceAbstractionStarter]: At program point L971(lines 866 1005) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-11-06 21:27:56,823 INFO L439 ceAbstractionStarter]: At program point L934(lines 874 989) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-11-06 21:27:56,823 INFO L439 ceAbstractionStarter]: At program point L996(line 996) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|))) [2019-11-06 21:27:56,823 INFO L443 ceAbstractionStarter]: For program point L996-1(line 996) no Hoare annotation was computed. [2019-11-06 21:27:56,823 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 973) no Hoare annotation was computed. [2019-11-06 21:27:56,824 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 957) no Hoare annotation was computed. [2019-11-06 21:27:56,824 INFO L443 ceAbstractionStarter]: For program point L955-2(lines 933 970) no Hoare annotation was computed. [2019-11-06 21:27:56,824 INFO L439 ceAbstractionStarter]: At program point KbFilter_InternIoCtlENTRY(lines 821 1006) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|))) [2019-11-06 21:27:56,824 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 942) no Hoare annotation was computed. [2019-11-06 21:27:56,824 INFO L443 ceAbstractionStarter]: For program point L902(lines 902 981) no Hoare annotation was computed. [2019-11-06 21:27:56,824 INFO L443 ceAbstractionStarter]: For program point KbFilter_InternIoCtlFINAL(lines 821 1006) no Hoare annotation was computed. [2019-11-06 21:27:56,824 INFO L439 ceAbstractionStarter]: At program point L605(lines 604 614) the Hoare annotation is: (let ((.cse1 (= 1 ~pended~0))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (and (not .cse1) (= ~s~0 ~NP~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or (not (= |old(~setEventCalled~0)| 1)) .cse0 (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (not (<= ~NP~0 1))) (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4)))) [2019-11-06 21:27:56,825 INFO L439 ceAbstractionStarter]: At program point L603(lines 602 614) the Hoare annotation is: (let ((.cse1 (= 1 ~pended~0))) (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (and (not .cse1) (= ~s~0 ~NP~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or (not (= |old(~setEventCalled~0)| 1)) .cse0 (not (<= 1 ~NP~0)) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (not (<= ~NP~0 1))) (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4)))) [2019-11-06 21:27:56,825 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 575 616) no Hoare annotation was computed. [2019-11-06 21:27:56,825 INFO L439 ceAbstractionStarter]: At program point L595(line 595) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3) (or (not (= |old(~setEventCalled~0)| 1)) .cse0 (not (<= 1 ~NP~0)) .cse1 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1))))) [2019-11-06 21:27:56,825 INFO L443 ceAbstractionStarter]: For program point L593(lines 593 597) no Hoare annotation was computed. [2019-11-06 21:27:56,825 INFO L443 ceAbstractionStarter]: For program point L593-1(lines 580 599) no Hoare annotation was computed. [2019-11-06 21:27:56,825 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 586) no Hoare annotation was computed. [2019-11-06 21:27:56,825 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 575 616) no Hoare annotation was computed. [2019-11-06 21:27:56,825 INFO L443 ceAbstractionStarter]: For program point L602(lines 602 614) no Hoare annotation was computed. [2019-11-06 21:27:56,826 INFO L439 ceAbstractionStarter]: At program point L588(lines 580 599) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 ~pended~0)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= 1 ~compRegistered~0)))) (and (or (not (= |old(~setEventCalled~0)| 1)) .cse0 (not (<= 1 ~NP~0)) .cse1 .cse2 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (not (<= ~NP~0 1))) (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~s~0 |old(~s~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|)) .cse2 .cse3))) [2019-11-06 21:27:56,826 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 575 616) the Hoare annotation is: (let ((.cse2 (= ~customIrp~0 |old(~customIrp~0)|)) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (= 1 ~pended~0)) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 (and .cse2 (= ~s~0 |old(~s~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|)) .cse3 .cse4) (or (not (= |old(~setEventCalled~0)| 1)) (and .cse2 (= ~MPR3~0 ~s~0) (= ~setEventCalled~0 1)) .cse0 (not (<= 1 ~NP~0)) .cse1 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (not (<= ~NP~0 1))))) [2019-11-06 21:27:56,826 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 599) no Hoare annotation was computed. [2019-11-06 21:27:56,826 INFO L439 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 .cse1 (not (<= 1 ~compRegistered~0))) (or .cse0 .cse1 (not (= ~compRegistered~0 0))))) [2019-11-06 21:27:56,826 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 553 566) no Hoare annotation was computed. [2019-11-06 21:27:56,826 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 563) no Hoare annotation was computed. [2019-11-06 21:27:56,826 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 553 566) the Hoare annotation is: (let ((.cse2 (= ~s~0 |old(~s~0)|)) (.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2) (or .cse2 .cse0 .cse1 (not (<= 1 ~compRegistered~0))))) [2019-11-06 21:27:56,826 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 553 566) no Hoare annotation was computed. [2019-11-06 21:27:56,827 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:27:56,827 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~MPR1~0 ~s~0) (= ~NP~0 ~MPR1~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~s~0)) [2019-11-06 21:27:56,827 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:27:56,827 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:27:56,827 INFO L439 ceAbstractionStarter]: At program point KbFilter_DispatchPassThroughENTRY(lines 664 687) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (and (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|))) [2019-11-06 21:27:56,827 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 679) no Hoare annotation was computed. [2019-11-06 21:27:56,827 INFO L439 ceAbstractionStarter]: At program point L683(line 683) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~s~0)) [2019-11-06 21:27:56,828 INFO L443 ceAbstractionStarter]: For program point L683-1(line 683) no Hoare annotation was computed. [2019-11-06 21:27:56,828 INFO L443 ceAbstractionStarter]: For program point KbFilter_DispatchPassThroughFINAL(lines 664 687) no Hoare annotation was computed. [2019-11-06 21:27:56,828 INFO L439 ceAbstractionStarter]: At program point L677(line 677) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2019-11-06 21:27:56,828 INFO L443 ceAbstractionStarter]: For program point L677-1(lines 673 679) no Hoare annotation was computed. [2019-11-06 21:27:56,828 INFO L443 ceAbstractionStarter]: For program point KbFilter_DispatchPassThroughEXIT(lines 664 687) no Hoare annotation was computed. [2019-11-06 21:27:56,828 INFO L439 ceAbstractionStarter]: At program point L217(line 217) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,828 INFO L439 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,828 INFO L443 ceAbstractionStarter]: For program point L242-1(lines 238 244) no Hoare annotation was computed. [2019-11-06 21:27:56,829 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 188) no Hoare annotation was computed. [2019-11-06 21:27:56,829 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 278) no Hoare annotation was computed. [2019-11-06 21:27:56,829 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 289) no Hoare annotation was computed. [2019-11-06 21:27:56,829 INFO L439 ceAbstractionStarter]: At program point L226(line 226) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,829 INFO L439 ceAbstractionStarter]: At program point L193(lines 193 194) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= ~customIrp~0 |old(~customIrp~0)|) (<= 1 ~compRegistered~0) (= KbFilter_PnP_~status~0 0) (<= 1 ~s~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (<= ~s~0 1) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,829 INFO L443 ceAbstractionStarter]: For program point L226-1(lines 222 228) no Hoare annotation was computed. [2019-11-06 21:27:56,829 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 193 194) no Hoare annotation was computed. [2019-11-06 21:27:56,829 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 275) no Hoare annotation was computed. [2019-11-06 21:27:56,829 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 286) no Hoare annotation was computed. [2019-11-06 21:27:56,830 INFO L439 ceAbstractionStarter]: At program point L111(lines 110 289) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,830 INFO L446 ceAbstractionStarter]: At program point L268(lines 171 269) the Hoare annotation is: true [2019-11-06 21:27:56,830 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 272) no Hoare annotation was computed. [2019-11-06 21:27:56,830 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 283) no Hoare annotation was computed. [2019-11-06 21:27:56,830 INFO L439 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,830 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 80 293) no Hoare annotation was computed. [2019-11-06 21:27:56,830 INFO L439 ceAbstractionStarter]: At program point L170(lines 116 287) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,831 INFO L443 ceAbstractionStarter]: For program point L137(lines 137 280) no Hoare annotation was computed. [2019-11-06 21:27:56,831 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 277) no Hoare annotation was computed. [2019-11-06 21:27:56,831 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 288) no Hoare annotation was computed. [2019-11-06 21:27:56,831 INFO L439 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 80 293) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)) (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~s~0 ~NP~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|))) [2019-11-06 21:27:56,831 INFO L443 ceAbstractionStarter]: For program point KbFilter_PnPFINAL(lines 80 293) no Hoare annotation was computed. [2019-11-06 21:27:56,831 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 274) no Hoare annotation was computed. [2019-11-06 21:27:56,831 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 285) no Hoare annotation was computed. [2019-11-06 21:27:56,831 INFO L439 ceAbstractionStarter]: At program point L114(lines 113 288) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~s~0 |old(~s~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,832 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 244) no Hoare annotation was computed. [2019-11-06 21:27:56,832 INFO L439 ceAbstractionStarter]: At program point L263(lines 263 264) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,832 INFO L443 ceAbstractionStarter]: For program point L263-1(lines 263 264) no Hoare annotation was computed. [2019-11-06 21:27:56,832 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 271) no Hoare annotation was computed. [2019-11-06 21:27:56,832 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 282) no Hoare annotation was computed. [2019-11-06 21:27:56,832 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 228) no Hoare annotation was computed. [2019-11-06 21:27:56,832 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2019-11-06 21:27:56,832 INFO L443 ceAbstractionStarter]: For program point L181-1(lines 176 188) no Hoare annotation was computed. [2019-11-06 21:27:56,832 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 212) no Hoare annotation was computed. [2019-11-06 21:27:56,832 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 279) no Hoare annotation was computed. [2019-11-06 21:27:56,833 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 290) no Hoare annotation was computed. [2019-11-06 21:27:56,833 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 204) no Hoare annotation was computed. [2019-11-06 21:27:56,833 INFO L443 ceAbstractionStarter]: For program point L198-2(lines 171 267) no Hoare annotation was computed. [2019-11-06 21:27:56,833 INFO L439 ceAbstractionStarter]: At program point L248(line 248) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,833 INFO L443 ceAbstractionStarter]: For program point L248-1(line 248) no Hoare annotation was computed. [2019-11-06 21:27:56,833 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 276) no Hoare annotation was computed. [2019-11-06 21:27:56,833 INFO L443 ceAbstractionStarter]: For program point L116(lines 116 287) no Hoare annotation was computed. [2019-11-06 21:27:56,833 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 211) no Hoare annotation was computed. [2019-11-06 21:27:56,833 INFO L439 ceAbstractionStarter]: At program point L108(lines 107 290) the Hoare annotation is: (or (and (= ~customIrp~0 |old(~customIrp~0)|) (= KbFilter_PnP_~status~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~s~0 ~NP~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,834 INFO L439 ceAbstractionStarter]: At program point L232(lines 232 233) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (and (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,834 INFO L443 ceAbstractionStarter]: For program point L232-1(lines 232 233) no Hoare annotation was computed. [2019-11-06 21:27:56,834 INFO L439 ceAbstractionStarter]: At program point L257(line 257) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,834 INFO L443 ceAbstractionStarter]: For program point L257-1(lines 253 259) no Hoare annotation was computed. [2019-11-06 21:27:56,834 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 273) no Hoare annotation was computed. [2019-11-06 21:27:56,834 INFO L443 ceAbstractionStarter]: For program point L125(lines 125 284) no Hoare annotation was computed. [2019-11-06 21:27:56,834 INFO L439 ceAbstractionStarter]: At program point L183(line 183) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= 1 ~NP~0)) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|))) [2019-11-06 21:27:56,835 INFO L439 ceAbstractionStarter]: At program point L200(lines 200 202) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0) .cse0 (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259)) (not (<= 1 ~NP~0)) (and (= ~s~0 |old(~s~0)|) .cse0) (not (<= |old(~s~0)| 1)) (= 1 ~pended~0) (not (= |old(~compRegistered~0)| 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~NP~0 1)) (not (<= 1 |old(~s~0)|)))) [2019-11-06 21:27:56,835 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 270) no Hoare annotation was computed. [2019-11-06 21:27:56,835 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 200 202) no Hoare annotation was computed. [2019-11-06 21:27:56,835 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 281) no Hoare annotation was computed. [2019-11-06 21:27:56,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:27:56 BoogieIcfgContainer [2019-11-06 21:27:56,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:27:56,874 INFO L168 Benchmark]: Toolchain (without parser) took 20998.65 ms. Allocated memory was 145.2 MB in the beginning and 484.4 MB in the end (delta: 339.2 MB). Free memory was 100.7 MB in the beginning and 365.7 MB in the end (delta: -265.0 MB). Peak memory consumption was 331.1 MB. Max. memory is 7.1 GB. [2019-11-06 21:27:56,875 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-06 21:27:56,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 571.65 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 175.6 MB in the end (delta: -75.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-11-06 21:27:56,876 INFO L168 Benchmark]: Boogie Preprocessor took 75.32 ms. Allocated memory is still 202.9 MB. Free memory was 175.6 MB in the beginning and 172.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-11-06 21:27:56,877 INFO L168 Benchmark]: RCFGBuilder took 1033.18 ms. Allocated memory is still 202.9 MB. Free memory was 171.9 MB in the beginning and 102.3 MB in the end (delta: 69.6 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. [2019-11-06 21:27:56,877 INFO L168 Benchmark]: TraceAbstraction took 19313.48 ms. Allocated memory was 202.9 MB in the beginning and 484.4 MB in the end (delta: 281.5 MB). Free memory was 101.6 MB in the beginning and 365.7 MB in the end (delta: -264.1 MB). Peak memory consumption was 274.4 MB. Max. memory is 7.1 GB. [2019-11-06 21:27:56,881 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.71 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 571.65 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 175.6 MB in the end (delta: -75.1 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.32 ms. Allocated memory is still 202.9 MB. Free memory was 175.6 MB in the beginning and 172.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1033.18 ms. Allocated memory is still 202.9 MB. Free memory was 171.9 MB in the beginning and 102.3 MB in the end (delta: 69.6 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19313.48 ms. Allocated memory was 202.9 MB in the beginning and 484.4 MB in the end (delta: 281.5 MB). Free memory was 101.6 MB in the beginning and 365.7 MB in the end (delta: -264.1 MB). Peak memory consumption was 274.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: (((((!(\old(NP) == \old(MPR1)) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || (((((((!(1 == pended) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && 0 <= status) && s <= 1) && 1 <= s) && NP + 4 <= MPR1) - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || (((s == \old(s) && lowerDriverReturn == \old(lowerDriverReturn)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((!(NP + 5 <= MPR3) || !(1 <= NP)) || !(\old(s) <= 1)) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || (((((customIrp == \old(customIrp) && s == \old(s)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == \old(compRegistered)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus))) || !(1 <= \old(s)) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || ((s == \old(s) && lowerDriverReturn == \old(lowerDriverReturn)) && setEventCalled == \old(setEventCalled)) - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: (((((!(1 == pended) || !(\old(NP) == \old(MPR1))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((((((((((((customIrp == \old(customIrp) && status == 0) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && s == NP) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == \old(compRegistered)) || !(NP + 5 <= MPR3)) || !(1 <= NP)) || !(\old(s) <= 1)) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || !(1 <= \old(s)) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((!(\old(setEventCalled) == 1) || !(NP + 5 <= MPR3)) || !(1 <= NP)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) && (((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || 1 == pended) || ((customIrp == \old(customIrp) && s == \old(s)) && setEventCalled == \old(setEventCalled))) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (((((!(1 == pended) || !(\old(NP) == \old(MPR1))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(NP) == \old(MPR1))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: ((((((((!(NP + 5 <= MPR3) || !(1 <= NP)) || !(\old(s) <= 1)) || 1 == pended) || !(NP + 4 <= MPR1)) || ((__cil_tmp7 + 1073741802 == 0 && MPR1 == s) && setEventCalled == 1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(1 <= \old(s))) && (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || (((s == \old(s) && lowerDriverReturn == \old(lowerDriverReturn)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((!(1 == pended) || !(\old(NP) == \old(MPR1))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) && ((((((((!(NP + 5 <= MPR3) || (__cil_tmp7 + 1073741802 == 0 && MPR1 == s)) || !(1 <= NP)) || !(\old(s) <= 1)) || 1 == pended) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(1 <= \old(s))) - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(NP) == \old(MPR1))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 773]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(NP) == \old(MPR1))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 421]: Loop Invariant Derived loop invariant: (((((!(1 == pended) || !(\old(NP) == \old(MPR1))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((((0 <= status || !(\old(NP) == \old(MPR1))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 866]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || (((s == \old(s) && lowerDriverReturn == \old(lowerDriverReturn)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || (((s == \old(s) && lowerDriverReturn == \old(lowerDriverReturn)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) - InvariantResult [Line: 882]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || (((s == \old(s) && lowerDriverReturn == \old(lowerDriverReturn)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((!(NP + 5 <= MPR3) || !(1 <= NP)) || !(\old(s) <= 1)) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || (((((customIrp == \old(customIrp) && s == \old(s)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == \old(compRegistered)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus))) || !(1 <= \old(s)) - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) && ((((((((!(NP + 5 <= MPR3) || !(1 <= NP)) || !(\old(s) <= 1)) || 1 == pended) || !(NP + 4 <= MPR1)) || (__cil_tmp7 + 1073741802 == 0 && MPR1 == s)) || !(1 <= compRegistered)) || !(NP <= 1)) || !(1 <= \old(s))) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && s == NP) && 0 == compRegistered) && 0 <= status) || !(\old(NP) == \old(MPR1))) || 1 == \old(pended)) || !(\old(compRegistered) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 775]: Loop Invariant Derived loop invariant: ((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || (((s == \old(s) && lowerDriverReturn == \old(lowerDriverReturn)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((!(\old(s) == NP) || 1 == pended) || !(compRegistered == 0)) || ((s == \old(s) && lowerDriverReturn == \old(lowerDriverReturn)) && setEventCalled == \old(setEventCalled)) - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((((((((((!(NP + 5 <= MPR3) || ((__cil_tmp7 + 1073741802 == 0 && MPR1 == s) && returnVal2 + 1073741823 <= 0)) || !(1 <= NP)) || !(\old(s) <= 1)) || 1 == pended) || !(NP + 4 <= MPR1)) || (((__cil_tmp7 + 1073741802 == 0 && MPR1 == s) && returnVal2 <= 0) && 0 <= returnVal2)) || !(1 <= compRegistered)) || !(NP <= 1)) || (((__cil_tmp7 + 1073741802 == 0 && MPR1 == s) && 259 == returnVal2) && setEventCalled == 1)) || !(1 <= \old(s))) && (((1 == pended || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((!(NP + 5 <= MPR3) || !(1 <= NP)) || !(\old(s) <= 1)) || 1 == pended) || !(\old(compRegistered) == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || (((((customIrp == \old(customIrp) && s == \old(s)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == \old(compRegistered)) && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus))) || !(1 <= \old(s)) - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: ((((((((!(\old(setEventCalled) == 1) || !(NP + 5 <= MPR3)) || !(1 <= NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) && (((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: ((((((((!(\old(setEventCalled) == 1) || !(NP + 5 <= MPR3)) || !(1 <= NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(\old(s) == MPR3)) || !(1 <= compRegistered)) || !(NP <= 1)) && (((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || 1 == pended) || (!(1 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 239 locations, 1 error locations. Result: SAFE, OverallTime: 19.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, HoareTripleCheckerStatistics: 2604 SDtfs, 3535 SDslu, 3245 SDs, 0 SdLazy, 5001 SolverSat, 901 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 179 SyntacticMatches, 5 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 139 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 330 PreInvPairs, 409 NumberOfFragments, 3242 HoareAnnotationTreeSize, 330 FomulaSimplifications, 580 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 84 FomulaSimplificationsInter, 3664 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 211466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...