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/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:41:54,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:41:54,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:41:54,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:41:54,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:41:54,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:41:54,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:41:54,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:41:54,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:41:54,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:41:54,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:41:54,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:41:54,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:41:54,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:41:54,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:41:54,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:41:54,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:41:54,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:41:54,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:41:54,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:41:54,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:41:54,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:41:54,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:41:54,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:41:54,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:41:54,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:41:54,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:41:54,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:41:54,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:41:54,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:41:54,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:41:54,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:41:54,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:41:54,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:41:54,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:41:54,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:41:54,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:41:54,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:41:54,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:41:54,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:41:54,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:41:54,605 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:41:54,620 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:41:54,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:41:54,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:41:54,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:41:54,622 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:41:54,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:41:54,622 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:41:54,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:41:54,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:41:54,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:41:54,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:41:54,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:41:54,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:41:54,624 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:41:54,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:41:54,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:41:54,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:41:54,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:41:54,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:41:54,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:41:54,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:41:54,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:41:54,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:41:54,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:41:54,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:41:54,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:41:54,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:41:54,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:41:54,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:41:54,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:41:54,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:41:54,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:41:54,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:41:54,676 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:41:54,676 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-02 11:41:54,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce66d6a43/db3fa55de51a42698b7be041cc5045ab/FLAG5d2abef4e [2019-10-02 11:41:55,351 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:41:55,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-02 11:41:55,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce66d6a43/db3fa55de51a42698b7be041cc5045ab/FLAG5d2abef4e [2019-10-02 11:41:55,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce66d6a43/db3fa55de51a42698b7be041cc5045ab [2019-10-02 11:41:55,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:41:55,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:41:55,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:41:55,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:41:55,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:41:55,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:41:55" (1/1) ... [2019-10-02 11:41:55,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d590555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:41:55, skipping insertion in model container [2019-10-02 11:41:55,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:41:55" (1/1) ... [2019-10-02 11:41:55,602 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:41:55,678 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:41:56,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:41:56,206 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:41:56,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:41:56,362 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:41:56,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:41:56 WrapperNode [2019-10-02 11:41:56,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:41:56,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:41:56,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:41:56,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:41:56,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:41:56" (1/1) ... [2019-10-02 11:41:56,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:41:56" (1/1) ... [2019-10-02 11:41:56,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:41:56" (1/1) ... [2019-10-02 11:41:56,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:41:56" (1/1) ... [2019-10-02 11:41:56,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:41:56" (1/1) ... [2019-10-02 11:41:56,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:41:56" (1/1) ... [2019-10-02 11:41:56,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:41:56" (1/1) ... [2019-10-02 11:41:56,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:41:56,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:41:56,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:41:56,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:41:56,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:41:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:41:56,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:41:56,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:41:56,581 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-02 11:41:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-02 11:41:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-02 11:41:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-02 11:41:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-02 11:41:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-02 11:41:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-02 11:41:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-02 11:41:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-02 11:41:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:41:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-02 11:41:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-02 11:41:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-02 11:41:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-02 11:41:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-02 11:41:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-02 11:41:56,585 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-02 11:41:56,585 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-02 11:41:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-02 11:41:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-02 11:41:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-02 11:41:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-02 11:41:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-02 11:41:56,587 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-02 11:41:56,587 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2019-10-02 11:41:56,587 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2019-10-02 11:41:56,587 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2019-10-02 11:41:56,587 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-02 11:41:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:41:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 11:41:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:41:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 11:41:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 11:41:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-02 11:41:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-02 11:41:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-02 11:41:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-02 11:41:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-02 11:41:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-02 11:41:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-02 11:41:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-02 11:41:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-02 11:41:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-02 11:41:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-02 11:41:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-02 11:41:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-02 11:41:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-02 11:41:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-02 11:41:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-02 11:41:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-02 11:41:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-02 11:41:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2019-10-02 11:41:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2019-10-02 11:41:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2019-10-02 11:41:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-02 11:41:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-02 11:41:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-02 11:41:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-02 11:41:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-02 11:41:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:41:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-02 11:41:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:41:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:41:57,036 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:57,113 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:41:57,113 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:41:57,121 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:57,132 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:41:57,133 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:41:57,139 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:57,444 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-02 11:41:57,444 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-02 11:41:57,448 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:57,608 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-10-02 11:41:57,608 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-10-02 11:41:57,638 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:57,665 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-02 11:41:57,666 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-02 11:41:57,767 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:57,776 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:41:57,777 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:41:57,777 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:57,788 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:41:57,789 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:41:57,789 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:57,803 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:41:57,804 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:41:57,877 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:57,918 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-02 11:41:57,919 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-02 11:41:57,921 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:58,062 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2019-10-02 11:41:58,063 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2019-10-02 11:41:58,128 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:58,134 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:41:58,134 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:41:58,134 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:58,156 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:41:58,156 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:41:58,157 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:41:58,168 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:41:58,168 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:41:58,185 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:41:58,185 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:41:58,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:41:58 BoogieIcfgContainer [2019-10-02 11:41:58,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:41:58,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:41:58,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:41:58,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:41:58,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:41:55" (1/3) ... [2019-10-02 11:41:58,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da614c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:41:58, skipping insertion in model container [2019-10-02 11:41:58,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:41:56" (2/3) ... [2019-10-02 11:41:58,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da614c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:41:58, skipping insertion in model container [2019-10-02 11:41:58,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:41:58" (3/3) ... [2019-10-02 11:41:58,199 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-10-02 11:41:58,210 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:41:58,222 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:41:58,240 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:41:58,301 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:41:58,302 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:41:58,302 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:41:58,302 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:41:58,302 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:41:58,302 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:41:58,303 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:41:58,303 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:41:58,303 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:41:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states. [2019-10-02 11:41:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:41:58,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:58,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:58,350 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:58,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:58,355 INFO L82 PathProgramCache]: Analyzing trace with hash 513471565, now seen corresponding path program 1 times [2019-10-02 11:41:58,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:58,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:58,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:58,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:58,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:58,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:58,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:41:58,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:41:58,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:41:58,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:41:58,710 INFO L87 Difference]: Start difference. First operand 389 states. Second operand 3 states. [2019-10-02 11:41:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:58,918 INFO L93 Difference]: Finished difference Result 624 states and 909 transitions. [2019-10-02 11:41:58,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:41:58,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:41:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:58,961 INFO L225 Difference]: With dead ends: 624 [2019-10-02 11:41:58,961 INFO L226 Difference]: Without dead ends: 380 [2019-10-02 11:41:58,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:41:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-02 11:41:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-10-02 11:41:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-02 11:41:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2019-10-02 11:41:59,121 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2019-10-02 11:41:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:59,122 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2019-10-02 11:41:59,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:41:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2019-10-02 11:41:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:41:59,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:59,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:59,125 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2120474792, now seen corresponding path program 1 times [2019-10-02 11:41:59,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:59,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:59,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:59,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:59,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:59,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:59,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:41:59,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:41:59,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:41:59,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:41:59,366 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand 3 states. [2019-10-02 11:41:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:59,601 INFO L93 Difference]: Finished difference Result 699 states and 950 transitions. [2019-10-02 11:41:59,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:41:59,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:41:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:59,614 INFO L225 Difference]: With dead ends: 699 [2019-10-02 11:41:59,615 INFO L226 Difference]: Without dead ends: 536 [2019-10-02 11:41:59,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:41:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-10-02 11:41:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 519. [2019-10-02 11:41:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-10-02 11:41:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 706 transitions. [2019-10-02 11:41:59,694 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 706 transitions. Word has length 25 [2019-10-02 11:41:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:59,694 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 706 transitions. [2019-10-02 11:41:59,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:41:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 706 transitions. [2019-10-02 11:41:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:41:59,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:59,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:59,698 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1525052010, now seen corresponding path program 1 times [2019-10-02 11:41:59,700 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:59,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:59,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:59,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:59,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:59,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:41:59,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:41:59,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:41:59,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:41:59,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:41:59,896 INFO L87 Difference]: Start difference. First operand 519 states and 706 transitions. Second operand 3 states. [2019-10-02 11:41:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:59,966 INFO L93 Difference]: Finished difference Result 642 states and 859 transitions. [2019-10-02 11:41:59,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:41:59,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 11:41:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:59,975 INFO L225 Difference]: With dead ends: 642 [2019-10-02 11:41:59,975 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 11:41:59,976 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:41:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 11:42:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 577. [2019-10-02 11:42:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-02 11:42:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 780 transitions. [2019-10-02 11:42:00,023 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 780 transitions. Word has length 31 [2019-10-02 11:42:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:00,024 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 780 transitions. [2019-10-02 11:42:00,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 780 transitions. [2019-10-02 11:42:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-02 11:42:00,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:00,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:00,034 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:00,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1803096900, now seen corresponding path program 1 times [2019-10-02 11:42:00,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:00,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:00,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:00,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:00,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:00,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:00,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:00,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:00,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:00,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:00,144 INFO L87 Difference]: Start difference. First operand 577 states and 780 transitions. Second operand 3 states. [2019-10-02 11:42:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:00,218 INFO L93 Difference]: Finished difference Result 1080 states and 1455 transitions. [2019-10-02 11:42:00,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:00,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-02 11:42:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:00,228 INFO L225 Difference]: With dead ends: 1080 [2019-10-02 11:42:00,228 INFO L226 Difference]: Without dead ends: 788 [2019-10-02 11:42:00,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-02 11:42:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 759. [2019-10-02 11:42:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-10-02 11:42:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1030 transitions. [2019-10-02 11:42:00,297 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1030 transitions. Word has length 33 [2019-10-02 11:42:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:00,297 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1030 transitions. [2019-10-02 11:42:00,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1030 transitions. [2019-10-02 11:42:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:42:00,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:00,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:00,304 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:00,305 INFO L82 PathProgramCache]: Analyzing trace with hash -535412243, now seen corresponding path program 1 times [2019-10-02 11:42:00,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:00,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:00,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:00,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:00,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:00,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:00,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:00,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:00,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:00,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:00,362 INFO L87 Difference]: Start difference. First operand 759 states and 1030 transitions. Second operand 3 states. [2019-10-02 11:42:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:00,459 INFO L93 Difference]: Finished difference Result 795 states and 1072 transitions. [2019-10-02 11:42:00,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:00,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-02 11:42:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:00,465 INFO L225 Difference]: With dead ends: 795 [2019-10-02 11:42:00,465 INFO L226 Difference]: Without dead ends: 790 [2019-10-02 11:42:00,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-02 11:42:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-10-02 11:42:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-02 11:42:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1065 transitions. [2019-10-02 11:42:00,504 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1065 transitions. Word has length 38 [2019-10-02 11:42:00,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:00,505 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 1065 transitions. [2019-10-02 11:42:00,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1065 transitions. [2019-10-02 11:42:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:42:00,507 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:00,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:00,507 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:00,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:00,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1074736541, now seen corresponding path program 1 times [2019-10-02 11:42:00,508 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:00,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:00,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:00,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:00,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:00,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:00,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:00,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:00,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:00,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:00,571 INFO L87 Difference]: Start difference. First operand 788 states and 1065 transitions. Second operand 3 states. [2019-10-02 11:42:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:00,690 INFO L93 Difference]: Finished difference Result 803 states and 1085 transitions. [2019-10-02 11:42:00,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:00,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-02 11:42:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:00,698 INFO L225 Difference]: With dead ends: 803 [2019-10-02 11:42:00,698 INFO L226 Difference]: Without dead ends: 800 [2019-10-02 11:42:00,699 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-10-02 11:42:00,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 799. [2019-10-02 11:42:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-10-02 11:42:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1079 transitions. [2019-10-02 11:42:00,747 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1079 transitions. Word has length 38 [2019-10-02 11:42:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:00,748 INFO L475 AbstractCegarLoop]: Abstraction has 799 states and 1079 transitions. [2019-10-02 11:42:00,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1079 transitions. [2019-10-02 11:42:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 11:42:00,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:00,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:00,752 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:00,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:00,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1033738490, now seen corresponding path program 1 times [2019-10-02 11:42:00,752 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:00,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:00,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:00,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:00,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:00,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:00,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:00,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:00,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:00,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:00,842 INFO L87 Difference]: Start difference. First operand 799 states and 1079 transitions. Second operand 5 states. [2019-10-02 11:42:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:00,903 INFO L93 Difference]: Finished difference Result 812 states and 1093 transitions. [2019-10-02 11:42:00,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:00,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-02 11:42:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:00,910 INFO L225 Difference]: With dead ends: 812 [2019-10-02 11:42:00,910 INFO L226 Difference]: Without dead ends: 797 [2019-10-02 11:42:00,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-10-02 11:42:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-10-02 11:42:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-02 11:42:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1075 transitions. [2019-10-02 11:42:00,954 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1075 transitions. Word has length 39 [2019-10-02 11:42:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:00,954 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 1075 transitions. [2019-10-02 11:42:00,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1075 transitions. [2019-10-02 11:42:00,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 11:42:00,956 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:00,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:00,956 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:00,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:00,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1325280387, now seen corresponding path program 1 times [2019-10-02 11:42:00,957 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:00,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:00,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:01,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:01,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:01,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:01,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:01,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:01,027 INFO L87 Difference]: Start difference. First operand 797 states and 1075 transitions. Second operand 5 states. [2019-10-02 11:42:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:01,098 INFO L93 Difference]: Finished difference Result 810 states and 1089 transitions. [2019-10-02 11:42:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:01,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-02 11:42:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:01,105 INFO L225 Difference]: With dead ends: 810 [2019-10-02 11:42:01,105 INFO L226 Difference]: Without dead ends: 790 [2019-10-02 11:42:01,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-02 11:42:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-10-02 11:42:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-02 11:42:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-10-02 11:42:01,147 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 40 [2019-10-02 11:42:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:01,149 INFO L475 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-10-02 11:42:01,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-10-02 11:42:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 11:42:01,151 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:01,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:01,151 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:01,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:01,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1677893832, now seen corresponding path program 1 times [2019-10-02 11:42:01,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:01,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:01,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:01,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:01,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:01,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:01,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:01,229 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-10-02 11:42:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:01,388 INFO L93 Difference]: Finished difference Result 1168 states and 1590 transitions. [2019-10-02 11:42:01,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:01,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-02 11:42:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:01,400 INFO L225 Difference]: With dead ends: 1168 [2019-10-02 11:42:01,400 INFO L226 Difference]: Without dead ends: 1165 [2019-10-02 11:42:01,402 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-10-02 11:42:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 913. [2019-10-02 11:42:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-10-02 11:42:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1235 transitions. [2019-10-02 11:42:01,473 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1235 transitions. Word has length 44 [2019-10-02 11:42:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:01,476 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1235 transitions. [2019-10-02 11:42:01,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1235 transitions. [2019-10-02 11:42:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 11:42:01,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:01,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:01,478 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:01,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:01,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2097381887, now seen corresponding path program 1 times [2019-10-02 11:42:01,479 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:01,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:01,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:01,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:01,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:01,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:01,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:42:01,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:42:01,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:42:01,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:01,586 INFO L87 Difference]: Start difference. First operand 913 states and 1235 transitions. Second operand 8 states. [2019-10-02 11:42:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:02,294 INFO L93 Difference]: Finished difference Result 935 states and 1257 transitions. [2019-10-02 11:42:02,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:42:02,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-02 11:42:02,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:02,301 INFO L225 Difference]: With dead ends: 935 [2019-10-02 11:42:02,301 INFO L226 Difference]: Without dead ends: 929 [2019-10-02 11:42:02,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:42:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-10-02 11:42:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 913. [2019-10-02 11:42:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-10-02 11:42:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1234 transitions. [2019-10-02 11:42:02,353 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1234 transitions. Word has length 43 [2019-10-02 11:42:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:02,353 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1234 transitions. [2019-10-02 11:42:02,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:42:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1234 transitions. [2019-10-02 11:42:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 11:42:02,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:02,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:02,356 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:02,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:02,357 INFO L82 PathProgramCache]: Analyzing trace with hash 667497540, now seen corresponding path program 1 times [2019-10-02 11:42:02,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:02,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:02,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:02,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:02,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:02,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:02,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:42:02,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:42:02,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:42:02,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:42:02,414 INFO L87 Difference]: Start difference. First operand 913 states and 1234 transitions. Second operand 4 states. [2019-10-02 11:42:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:02,513 INFO L93 Difference]: Finished difference Result 941 states and 1267 transitions. [2019-10-02 11:42:02,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:42:02,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-02 11:42:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:02,526 INFO L225 Difference]: With dead ends: 941 [2019-10-02 11:42:02,526 INFO L226 Difference]: Without dead ends: 919 [2019-10-02 11:42:02,529 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-10-02 11:42:02,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 915. [2019-10-02 11:42:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-10-02 11:42:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1236 transitions. [2019-10-02 11:42:02,597 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1236 transitions. Word has length 42 [2019-10-02 11:42:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:02,598 INFO L475 AbstractCegarLoop]: Abstraction has 915 states and 1236 transitions. [2019-10-02 11:42:02,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:42:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1236 transitions. [2019-10-02 11:42:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 11:42:02,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:02,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:02,600 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:02,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:02,600 INFO L82 PathProgramCache]: Analyzing trace with hash 237043572, now seen corresponding path program 1 times [2019-10-02 11:42:02,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:02,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:02,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:02,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:02,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:02,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:02,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:42:02,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:42:02,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:42:02,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:02,764 INFO L87 Difference]: Start difference. First operand 915 states and 1236 transitions. Second operand 8 states. [2019-10-02 11:42:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:03,934 INFO L93 Difference]: Finished difference Result 1641 states and 2187 transitions. [2019-10-02 11:42:03,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:42:03,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-10-02 11:42:03,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:03,942 INFO L225 Difference]: With dead ends: 1641 [2019-10-02 11:42:03,942 INFO L226 Difference]: Without dead ends: 1090 [2019-10-02 11:42:03,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-10-02 11:42:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 906. [2019-10-02 11:42:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-02 11:42:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1215 transitions. [2019-10-02 11:42:04,024 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1215 transitions. Word has length 45 [2019-10-02 11:42:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:04,024 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1215 transitions. [2019-10-02 11:42:04,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:42:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1215 transitions. [2019-10-02 11:42:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 11:42:04,026 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:04,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:04,027 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:04,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash -266291307, now seen corresponding path program 1 times [2019-10-02 11:42:04,027 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:04,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:04,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:04,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:04,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:42:04,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:42:04,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:42:04,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:04,119 INFO L87 Difference]: Start difference. First operand 906 states and 1215 transitions. Second operand 8 states. [2019-10-02 11:42:04,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:04,809 INFO L93 Difference]: Finished difference Result 928 states and 1236 transitions. [2019-10-02 11:42:04,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:42:04,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-02 11:42:04,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:04,815 INFO L225 Difference]: With dead ends: 928 [2019-10-02 11:42:04,815 INFO L226 Difference]: Without dead ends: 922 [2019-10-02 11:42:04,816 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:42:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-10-02 11:42:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 906. [2019-10-02 11:42:04,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-02 11:42:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-10-02 11:42:04,868 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 44 [2019-10-02 11:42:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:04,868 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-10-02 11:42:04,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:42:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-10-02 11:42:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 11:42:04,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:04,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:04,871 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:04,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2124566473, now seen corresponding path program 1 times [2019-10-02 11:42:04,871 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:04,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:04,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:04,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:04,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:42:04,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:42:04,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:42:04,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:42:04,919 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 4 states. [2019-10-02 11:42:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:05,005 INFO L93 Difference]: Finished difference Result 934 states and 1247 transitions. [2019-10-02 11:42:05,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:42:05,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-02 11:42:05,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:05,011 INFO L225 Difference]: With dead ends: 934 [2019-10-02 11:42:05,011 INFO L226 Difference]: Without dead ends: 912 [2019-10-02 11:42:05,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-10-02 11:42:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 906. [2019-10-02 11:42:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-02 11:42:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-10-02 11:42:05,062 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 43 [2019-10-02 11:42:05,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:05,063 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-10-02 11:42:05,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:42:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-10-02 11:42:05,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 11:42:05,065 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:05,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:05,065 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:05,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:05,066 INFO L82 PathProgramCache]: Analyzing trace with hash 418451048, now seen corresponding path program 1 times [2019-10-02 11:42:05,066 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:05,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:05,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:05,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:05,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:05,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:05,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:05,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:05,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:05,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:05,121 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 5 states. [2019-10-02 11:42:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:05,181 INFO L93 Difference]: Finished difference Result 922 states and 1229 transitions. [2019-10-02 11:42:05,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:05,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-02 11:42:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:05,187 INFO L225 Difference]: With dead ends: 922 [2019-10-02 11:42:05,188 INFO L226 Difference]: Without dead ends: 904 [2019-10-02 11:42:05,188 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-10-02 11:42:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2019-10-02 11:42:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-02 11:42:05,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1210 transitions. [2019-10-02 11:42:05,244 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1210 transitions. Word has length 45 [2019-10-02 11:42:05,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:05,245 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1210 transitions. [2019-10-02 11:42:05,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1210 transitions. [2019-10-02 11:42:05,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:42:05,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:05,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:05,247 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:05,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:05,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1008250026, now seen corresponding path program 1 times [2019-10-02 11:42:05,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:05,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:05,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:05,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:05,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:05,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:05,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:05,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:05,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:05,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:05,294 INFO L87 Difference]: Start difference. First operand 904 states and 1210 transitions. Second operand 3 states. [2019-10-02 11:42:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:05,352 INFO L93 Difference]: Finished difference Result 944 states and 1257 transitions. [2019-10-02 11:42:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:05,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-02 11:42:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:05,358 INFO L225 Difference]: With dead ends: 944 [2019-10-02 11:42:05,358 INFO L226 Difference]: Without dead ends: 868 [2019-10-02 11:42:05,360 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-10-02 11:42:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 865. [2019-10-02 11:42:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-10-02 11:42:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1159 transitions. [2019-10-02 11:42:05,418 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1159 transitions. Word has length 46 [2019-10-02 11:42:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:05,418 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1159 transitions. [2019-10-02 11:42:05,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1159 transitions. [2019-10-02 11:42:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 11:42:05,420 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:05,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:05,421 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:05,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:05,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1391552118, now seen corresponding path program 1 times [2019-10-02 11:42:05,422 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:05,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:05,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:05,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:05,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:05,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:05,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:05,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:05,520 INFO L87 Difference]: Start difference. First operand 865 states and 1159 transitions. Second operand 5 states. [2019-10-02 11:42:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:05,590 INFO L93 Difference]: Finished difference Result 881 states and 1174 transitions. [2019-10-02 11:42:05,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:05,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-02 11:42:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:05,598 INFO L225 Difference]: With dead ends: 881 [2019-10-02 11:42:05,598 INFO L226 Difference]: Without dead ends: 863 [2019-10-02 11:42:05,599 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-10-02 11:42:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-10-02 11:42:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-10-02 11:42:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1155 transitions. [2019-10-02 11:42:05,660 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1155 transitions. Word has length 47 [2019-10-02 11:42:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:05,661 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1155 transitions. [2019-10-02 11:42:05,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1155 transitions. [2019-10-02 11:42:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:42:05,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:05,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:05,663 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:05,664 INFO L82 PathProgramCache]: Analyzing trace with hash 868426094, now seen corresponding path program 1 times [2019-10-02 11:42:05,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:05,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:05,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:05,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:05,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:05,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:42:05,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:42:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:42:05,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:42:05,732 INFO L87 Difference]: Start difference. First operand 863 states and 1155 transitions. Second operand 4 states. [2019-10-02 11:42:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:06,003 INFO L93 Difference]: Finished difference Result 947 states and 1238 transitions. [2019-10-02 11:42:06,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:42:06,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-10-02 11:42:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:06,009 INFO L225 Difference]: With dead ends: 947 [2019-10-02 11:42:06,010 INFO L226 Difference]: Without dead ends: 614 [2019-10-02 11:42:06,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:42:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-02 11:42:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 577. [2019-10-02 11:42:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-02 11:42:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 748 transitions. [2019-10-02 11:42:06,046 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 748 transitions. Word has length 52 [2019-10-02 11:42:06,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:06,047 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 748 transitions. [2019-10-02 11:42:06,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:42:06,047 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 748 transitions. [2019-10-02 11:42:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:42:06,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:06,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:06,049 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:06,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:06,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1378147806, now seen corresponding path program 1 times [2019-10-02 11:42:06,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:06,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:06,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:06,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:06,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:06,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:06,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:06,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:06,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:06,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:06,117 INFO L87 Difference]: Start difference. First operand 577 states and 748 transitions. Second operand 6 states. [2019-10-02 11:42:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:06,206 INFO L93 Difference]: Finished difference Result 597 states and 768 transitions. [2019-10-02 11:42:06,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:06,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-10-02 11:42:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:06,210 INFO L225 Difference]: With dead ends: 597 [2019-10-02 11:42:06,211 INFO L226 Difference]: Without dead ends: 577 [2019-10-02 11:42:06,211 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-02 11:42:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-02 11:42:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-02 11:42:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 736 transitions. [2019-10-02 11:42:06,242 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 736 transitions. Word has length 50 [2019-10-02 11:42:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:06,242 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 736 transitions. [2019-10-02 11:42:06,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 736 transitions. [2019-10-02 11:42:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:42:06,244 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:06,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:06,245 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:06,245 INFO L82 PathProgramCache]: Analyzing trace with hash 994153444, now seen corresponding path program 1 times [2019-10-02 11:42:06,245 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:06,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:06,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:06,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:06,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:06,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:06,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:06,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:06,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:06,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:06,292 INFO L87 Difference]: Start difference. First operand 577 states and 736 transitions. Second operand 3 states. [2019-10-02 11:42:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:06,424 INFO L93 Difference]: Finished difference Result 779 states and 1004 transitions. [2019-10-02 11:42:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:06,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-02 11:42:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:06,429 INFO L225 Difference]: With dead ends: 779 [2019-10-02 11:42:06,430 INFO L226 Difference]: Without dead ends: 752 [2019-10-02 11:42:06,431 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-10-02 11:42:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 622. [2019-10-02 11:42:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-02 11:42:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 793 transitions. [2019-10-02 11:42:06,472 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 793 transitions. Word has length 50 [2019-10-02 11:42:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:06,472 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 793 transitions. [2019-10-02 11:42:06,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 793 transitions. [2019-10-02 11:42:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 11:42:06,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:06,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:06,476 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:06,477 INFO L82 PathProgramCache]: Analyzing trace with hash -12540829, now seen corresponding path program 1 times [2019-10-02 11:42:06,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:06,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:06,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:06,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:06,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:06,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:06,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:42:06,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:42:06,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:42:06,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:06,567 INFO L87 Difference]: Start difference. First operand 622 states and 793 transitions. Second operand 7 states. [2019-10-02 11:42:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:06,760 INFO L93 Difference]: Finished difference Result 661 states and 836 transitions. [2019-10-02 11:42:06,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:42:06,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-02 11:42:06,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:06,766 INFO L225 Difference]: With dead ends: 661 [2019-10-02 11:42:06,766 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 11:42:06,767 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:42:06,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 11:42:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-10-02 11:42:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-02 11:42:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2019-10-02 11:42:06,804 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 51 [2019-10-02 11:42:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:06,804 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2019-10-02 11:42:06,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:42:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2019-10-02 11:42:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 11:42:06,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:06,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:06,806 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:06,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:06,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1421151086, now seen corresponding path program 1 times [2019-10-02 11:42:06,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:06,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:06,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:06,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:06,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:06,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:06,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:06,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:06,870 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 6 states. [2019-10-02 11:42:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:06,926 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2019-10-02 11:42:06,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:06,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-02 11:42:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:06,930 INFO L225 Difference]: With dead ends: 637 [2019-10-02 11:42:06,930 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 11:42:06,931 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:06,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 11:42:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 11:42:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 11:42:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2019-10-02 11:42:06,962 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2019-10-02 11:42:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:06,963 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2019-10-02 11:42:06,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2019-10-02 11:42:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 11:42:06,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:06,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:06,965 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:06,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:06,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1205911361, now seen corresponding path program 1 times [2019-10-02 11:42:06,965 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:06,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:06,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:06,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:06,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:07,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:07,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:42:07,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:42:07,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:42:07,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:07,037 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 8 states. [2019-10-02 11:42:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:07,216 INFO L93 Difference]: Finished difference Result 642 states and 810 transitions. [2019-10-02 11:42:07,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:42:07,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-02 11:42:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:07,220 INFO L225 Difference]: With dead ends: 642 [2019-10-02 11:42:07,221 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 11:42:07,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 11:42:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2019-10-02 11:42:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 11:42:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 797 transitions. [2019-10-02 11:42:07,255 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 797 transitions. Word has length 51 [2019-10-02 11:42:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:07,256 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 797 transitions. [2019-10-02 11:42:07,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:42:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 797 transitions. [2019-10-02 11:42:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 11:42:07,258 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:07,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:07,258 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:07,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1205634531, now seen corresponding path program 1 times [2019-10-02 11:42:07,259 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:07,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:07,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:07,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:07,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:07,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:07,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:42:07,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:42:07,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:42:07,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:07,334 INFO L87 Difference]: Start difference. First operand 630 states and 797 transitions. Second operand 8 states. [2019-10-02 11:42:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:07,434 INFO L93 Difference]: Finished difference Result 1024 states and 1318 transitions. [2019-10-02 11:42:07,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:42:07,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-02 11:42:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:07,439 INFO L225 Difference]: With dead ends: 1024 [2019-10-02 11:42:07,439 INFO L226 Difference]: Without dead ends: 670 [2019-10-02 11:42:07,441 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:42:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-02 11:42:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2019-10-02 11:42:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 11:42:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 835 transitions. [2019-10-02 11:42:07,476 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 835 transitions. Word has length 51 [2019-10-02 11:42:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:07,476 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 835 transitions. [2019-10-02 11:42:07,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:42:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 835 transitions. [2019-10-02 11:42:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:42:07,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:07,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:07,478 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:07,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1316245040, now seen corresponding path program 1 times [2019-10-02 11:42:07,479 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:07,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:07,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:07,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:07,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:07,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:07,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 11:42:07,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:42:07,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:42:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:42:07,701 INFO L87 Difference]: Start difference. First operand 651 states and 835 transitions. Second operand 15 states. [2019-10-02 11:42:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:11,198 INFO L93 Difference]: Finished difference Result 1041 states and 1345 transitions. [2019-10-02 11:42:11,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 11:42:11,200 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-10-02 11:42:11,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:11,204 INFO L225 Difference]: With dead ends: 1041 [2019-10-02 11:42:11,205 INFO L226 Difference]: Without dead ends: 794 [2019-10-02 11:42:11,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2019-10-02 11:42:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-10-02 11:42:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 662. [2019-10-02 11:42:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-10-02 11:42:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 850 transitions. [2019-10-02 11:42:11,249 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 850 transitions. Word has length 52 [2019-10-02 11:42:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:11,249 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 850 transitions. [2019-10-02 11:42:11,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:42:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 850 transitions. [2019-10-02 11:42:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:42:11,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:11,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:11,252 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:11,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash 472130064, now seen corresponding path program 1 times [2019-10-02 11:42:11,252 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:11,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:11,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:11,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:11,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:11,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:11,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:42:11,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:42:11,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:42:11,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:42:11,376 INFO L87 Difference]: Start difference. First operand 662 states and 850 transitions. Second operand 10 states. [2019-10-02 11:42:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:13,444 INFO L93 Difference]: Finished difference Result 849 states and 1112 transitions. [2019-10-02 11:42:13,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:42:13,445 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-10-02 11:42:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:13,452 INFO L225 Difference]: With dead ends: 849 [2019-10-02 11:42:13,453 INFO L226 Difference]: Without dead ends: 833 [2019-10-02 11:42:13,454 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:42:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-10-02 11:42:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 676. [2019-10-02 11:42:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-10-02 11:42:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 863 transitions. [2019-10-02 11:42:13,525 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 863 transitions. Word has length 52 [2019-10-02 11:42:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:13,525 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 863 transitions. [2019-10-02 11:42:13,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:42:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 863 transitions. [2019-10-02 11:42:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:42:13,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:13,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:13,528 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1499440053, now seen corresponding path program 1 times [2019-10-02 11:42:13,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:13,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:13,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:13,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:13,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:13,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:13,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:42:13,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:42:13,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:42:13,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:13,633 INFO L87 Difference]: Start difference. First operand 676 states and 863 transitions. Second operand 7 states. [2019-10-02 11:42:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:14,495 INFO L93 Difference]: Finished difference Result 812 states and 1040 transitions. [2019-10-02 11:42:14,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:42:14,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-10-02 11:42:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:14,501 INFO L225 Difference]: With dead ends: 812 [2019-10-02 11:42:14,501 INFO L226 Difference]: Without dead ends: 714 [2019-10-02 11:42:14,502 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:42:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-02 11:42:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 694. [2019-10-02 11:42:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-02 11:42:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 886 transitions. [2019-10-02 11:42:14,545 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 886 transitions. Word has length 52 [2019-10-02 11:42:14,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:14,547 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 886 transitions. [2019-10-02 11:42:14,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:42:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 886 transitions. [2019-10-02 11:42:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:42:14,549 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:14,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:14,550 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1356160695, now seen corresponding path program 1 times [2019-10-02 11:42:14,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:14,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:14,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:14,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:14,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:14,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:14,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:14,598 INFO L87 Difference]: Start difference. First operand 694 states and 886 transitions. Second operand 3 states. [2019-10-02 11:42:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:14,724 INFO L93 Difference]: Finished difference Result 854 states and 1106 transitions. [2019-10-02 11:42:14,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:14,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-02 11:42:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:14,729 INFO L225 Difference]: With dead ends: 854 [2019-10-02 11:42:14,729 INFO L226 Difference]: Without dead ends: 781 [2019-10-02 11:42:14,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-10-02 11:42:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 667. [2019-10-02 11:42:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-10-02 11:42:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 865 transitions. [2019-10-02 11:42:14,777 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 865 transitions. Word has length 52 [2019-10-02 11:42:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:14,777 INFO L475 AbstractCegarLoop]: Abstraction has 667 states and 865 transitions. [2019-10-02 11:42:14,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 865 transitions. [2019-10-02 11:42:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 11:42:14,779 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:14,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:14,780 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1526640246, now seen corresponding path program 1 times [2019-10-02 11:42:14,780 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:14,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:14,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:14,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:14,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:14,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:14,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:14,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:14,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:14,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:14,852 INFO L87 Difference]: Start difference. First operand 667 states and 865 transitions. Second operand 3 states. [2019-10-02 11:42:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:14,932 INFO L93 Difference]: Finished difference Result 978 states and 1267 transitions. [2019-10-02 11:42:14,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:14,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 11:42:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:14,937 INFO L225 Difference]: With dead ends: 978 [2019-10-02 11:42:14,937 INFO L226 Difference]: Without dead ends: 661 [2019-10-02 11:42:14,940 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-10-02 11:42:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2019-10-02 11:42:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-02 11:42:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 848 transitions. [2019-10-02 11:42:14,980 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 848 transitions. Word has length 58 [2019-10-02 11:42:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:14,981 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 848 transitions. [2019-10-02 11:42:14,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 848 transitions. [2019-10-02 11:42:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 11:42:14,983 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:14,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:14,984 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:14,984 INFO L82 PathProgramCache]: Analyzing trace with hash 195627467, now seen corresponding path program 1 times [2019-10-02 11:42:14,984 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:14,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:14,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:14,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:14,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:15,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:15,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:42:15,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:42:15,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:42:15,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:15,138 INFO L87 Difference]: Start difference. First operand 661 states and 848 transitions. Second operand 11 states. [2019-10-02 11:42:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:16,204 INFO L93 Difference]: Finished difference Result 1020 states and 1331 transitions. [2019-10-02 11:42:16,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:42:16,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-10-02 11:42:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:16,215 INFO L225 Difference]: With dead ends: 1020 [2019-10-02 11:42:16,216 INFO L226 Difference]: Without dead ends: 691 [2019-10-02 11:42:16,218 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:42:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-02 11:42:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 661. [2019-10-02 11:42:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-02 11:42:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 848 transitions. [2019-10-02 11:42:16,261 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 848 transitions. Word has length 54 [2019-10-02 11:42:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:16,261 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 848 transitions. [2019-10-02 11:42:16,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:42:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 848 transitions. [2019-10-02 11:42:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 11:42:16,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:16,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:16,266 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:16,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:16,266 INFO L82 PathProgramCache]: Analyzing trace with hash 837184011, now seen corresponding path program 1 times [2019-10-02 11:42:16,266 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:16,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:16,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:16,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:16,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:16,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:16,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:16,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:16,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:16,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:16,335 INFO L87 Difference]: Start difference. First operand 661 states and 848 transitions. Second operand 5 states. [2019-10-02 11:42:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:16,770 INFO L93 Difference]: Finished difference Result 728 states and 929 transitions. [2019-10-02 11:42:16,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:16,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-02 11:42:16,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:16,775 INFO L225 Difference]: With dead ends: 728 [2019-10-02 11:42:16,775 INFO L226 Difference]: Without dead ends: 710 [2019-10-02 11:42:16,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:16,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-10-02 11:42:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 643. [2019-10-02 11:42:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-02 11:42:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 820 transitions. [2019-10-02 11:42:16,823 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 820 transitions. Word has length 54 [2019-10-02 11:42:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:16,823 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 820 transitions. [2019-10-02 11:42:16,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 820 transitions. [2019-10-02 11:42:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 11:42:16,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:16,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:16,829 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:16,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:16,830 INFO L82 PathProgramCache]: Analyzing trace with hash -848857517, now seen corresponding path program 1 times [2019-10-02 11:42:16,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:16,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:16,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:16,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:16,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:16,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:16,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:42:16,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:42:16,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:42:16,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:16,916 INFO L87 Difference]: Start difference. First operand 643 states and 820 transitions. Second operand 8 states. [2019-10-02 11:42:16,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:16,992 INFO L93 Difference]: Finished difference Result 656 states and 832 transitions. [2019-10-02 11:42:16,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:42:16,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-10-02 11:42:16,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:16,997 INFO L225 Difference]: With dead ends: 656 [2019-10-02 11:42:16,997 INFO L226 Difference]: Without dead ends: 628 [2019-10-02 11:42:16,999 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-02 11:42:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-10-02 11:42:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-02 11:42:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 801 transitions. [2019-10-02 11:42:17,053 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 801 transitions. Word has length 55 [2019-10-02 11:42:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:17,054 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 801 transitions. [2019-10-02 11:42:17,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:42:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 801 transitions. [2019-10-02 11:42:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 11:42:17,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:17,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:17,058 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:17,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:17,058 INFO L82 PathProgramCache]: Analyzing trace with hash 682290104, now seen corresponding path program 1 times [2019-10-02 11:42:17,058 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:17,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:17,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:17,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:17,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:17,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:17,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:42:17,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:42:17,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:42:17,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:17,140 INFO L87 Difference]: Start difference. First operand 628 states and 801 transitions. Second operand 8 states. [2019-10-02 11:42:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:17,313 INFO L93 Difference]: Finished difference Result 651 states and 824 transitions. [2019-10-02 11:42:17,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:42:17,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-02 11:42:17,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:17,317 INFO L225 Difference]: With dead ends: 651 [2019-10-02 11:42:17,317 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 11:42:17,319 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 11:42:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 11:42:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 11:42:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 793 transitions. [2019-10-02 11:42:17,363 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 793 transitions. Word has length 56 [2019-10-02 11:42:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:17,364 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 793 transitions. [2019-10-02 11:42:17,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:42:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 793 transitions. [2019-10-02 11:42:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 11:42:17,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:17,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:17,366 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:17,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1988865588, now seen corresponding path program 1 times [2019-10-02 11:42:17,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:17,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:17,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:17,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:17,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:17,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:17,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:17,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:17,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:17,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:17,527 INFO L87 Difference]: Start difference. First operand 623 states and 793 transitions. Second operand 5 states. [2019-10-02 11:42:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:17,595 INFO L93 Difference]: Finished difference Result 882 states and 1130 transitions. [2019-10-02 11:42:17,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:17,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-10-02 11:42:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:17,600 INFO L225 Difference]: With dead ends: 882 [2019-10-02 11:42:17,600 INFO L226 Difference]: Without dead ends: 565 [2019-10-02 11:42:17,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-10-02 11:42:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2019-10-02 11:42:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-02 11:42:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 709 transitions. [2019-10-02 11:42:17,678 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 709 transitions. Word has length 64 [2019-10-02 11:42:17,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:17,678 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 709 transitions. [2019-10-02 11:42:17,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 709 transitions. [2019-10-02 11:42:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 11:42:17,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:17,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:17,681 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:17,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:17,681 INFO L82 PathProgramCache]: Analyzing trace with hash 315715581, now seen corresponding path program 1 times [2019-10-02 11:42:17,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:17,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:17,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:17,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:17,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:17,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:17,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:17,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:17,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:17,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:17,750 INFO L87 Difference]: Start difference. First operand 565 states and 709 transitions. Second operand 6 states. [2019-10-02 11:42:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:17,835 INFO L93 Difference]: Finished difference Result 584 states and 728 transitions. [2019-10-02 11:42:17,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:17,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-02 11:42:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:17,838 INFO L225 Difference]: With dead ends: 584 [2019-10-02 11:42:17,838 INFO L226 Difference]: Without dead ends: 560 [2019-10-02 11:42:17,838 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-02 11:42:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-10-02 11:42:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-10-02 11:42:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 703 transitions. [2019-10-02 11:42:17,890 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 703 transitions. Word has length 60 [2019-10-02 11:42:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:17,891 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 703 transitions. [2019-10-02 11:42:17,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 703 transitions. [2019-10-02 11:42:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 11:42:17,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:17,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:17,893 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:17,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:17,893 INFO L82 PathProgramCache]: Analyzing trace with hash 365447091, now seen corresponding path program 1 times [2019-10-02 11:42:17,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:17,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:17,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:17,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:17,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:17,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:17,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:17,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:17,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:17,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:17,961 INFO L87 Difference]: Start difference. First operand 560 states and 703 transitions. Second operand 5 states. [2019-10-02 11:42:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:18,261 INFO L93 Difference]: Finished difference Result 819 states and 1033 transitions. [2019-10-02 11:42:18,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:18,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-02 11:42:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:18,264 INFO L225 Difference]: With dead ends: 819 [2019-10-02 11:42:18,266 INFO L226 Difference]: Without dead ends: 560 [2019-10-02 11:42:18,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:18,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-02 11:42:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-10-02 11:42:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-10-02 11:42:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 701 transitions. [2019-10-02 11:42:18,314 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 701 transitions. Word has length 68 [2019-10-02 11:42:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:18,315 INFO L475 AbstractCegarLoop]: Abstraction has 560 states and 701 transitions. [2019-10-02 11:42:18,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 701 transitions. [2019-10-02 11:42:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 11:42:18,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:18,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:18,317 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash -701574740, now seen corresponding path program 1 times [2019-10-02 11:42:18,318 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:18,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:18,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:18,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:18,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:18,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:18,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:18,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:18,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:18,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:18,403 INFO L87 Difference]: Start difference. First operand 560 states and 701 transitions. Second operand 9 states. [2019-10-02 11:42:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:18,617 INFO L93 Difference]: Finished difference Result 589 states and 732 transitions. [2019-10-02 11:42:18,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:18,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-10-02 11:42:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:18,621 INFO L225 Difference]: With dead ends: 589 [2019-10-02 11:42:18,621 INFO L226 Difference]: Without dead ends: 555 [2019-10-02 11:42:18,624 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-02 11:42:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-02 11:42:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-02 11:42:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 693 transitions. [2019-10-02 11:42:18,670 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 693 transitions. Word has length 61 [2019-10-02 11:42:18,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:18,672 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 693 transitions. [2019-10-02 11:42:18,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 693 transitions. [2019-10-02 11:42:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 11:42:18,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:18,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:18,674 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:18,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1376834024, now seen corresponding path program 1 times [2019-10-02 11:42:18,675 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:18,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:18,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:18,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:18,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:18,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:18,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:18,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:18,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:18,742 INFO L87 Difference]: Start difference. First operand 555 states and 693 transitions. Second operand 5 states. [2019-10-02 11:42:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:18,798 INFO L93 Difference]: Finished difference Result 678 states and 838 transitions. [2019-10-02 11:42:18,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:18,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-02 11:42:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:18,809 INFO L225 Difference]: With dead ends: 678 [2019-10-02 11:42:18,809 INFO L226 Difference]: Without dead ends: 561 [2019-10-02 11:42:18,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-02 11:42:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-10-02 11:42:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-02 11:42:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 697 transitions. [2019-10-02 11:42:18,844 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 697 transitions. Word has length 63 [2019-10-02 11:42:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:18,845 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 697 transitions. [2019-10-02 11:42:18,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 697 transitions. [2019-10-02 11:42:18,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 11:42:18,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:18,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:18,847 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:18,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:18,847 INFO L82 PathProgramCache]: Analyzing trace with hash 902963543, now seen corresponding path program 1 times [2019-10-02 11:42:18,847 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:18,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:18,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:18,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:18,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:18,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:18,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:18,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:18,934 INFO L87 Difference]: Start difference. First operand 559 states and 697 transitions. Second operand 9 states. [2019-10-02 11:42:19,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:19,027 INFO L93 Difference]: Finished difference Result 696 states and 856 transitions. [2019-10-02 11:42:19,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:19,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-02 11:42:19,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:19,031 INFO L225 Difference]: With dead ends: 696 [2019-10-02 11:42:19,031 INFO L226 Difference]: Without dead ends: 561 [2019-10-02 11:42:19,032 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-02 11:42:19,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-10-02 11:42:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-02 11:42:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 696 transitions. [2019-10-02 11:42:19,069 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 696 transitions. Word has length 63 [2019-10-02 11:42:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:19,070 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 696 transitions. [2019-10-02 11:42:19,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 696 transitions. [2019-10-02 11:42:19,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 11:42:19,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:19,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:19,072 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2118524936, now seen corresponding path program 1 times [2019-10-02 11:42:19,072 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:19,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:19,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:19,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:19,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:19,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:19,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:19,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:19,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:19,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:19,155 INFO L87 Difference]: Start difference. First operand 559 states and 696 transitions. Second operand 9 states. [2019-10-02 11:42:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:19,339 INFO L93 Difference]: Finished difference Result 588 states and 727 transitions. [2019-10-02 11:42:19,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:19,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-10-02 11:42:19,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:19,342 INFO L225 Difference]: With dead ends: 588 [2019-10-02 11:42:19,342 INFO L226 Difference]: Without dead ends: 553 [2019-10-02 11:42:19,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:19,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-02 11:42:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-02 11:42:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-02 11:42:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 687 transitions. [2019-10-02 11:42:19,378 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 687 transitions. Word has length 62 [2019-10-02 11:42:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:19,379 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 687 transitions. [2019-10-02 11:42:19,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 687 transitions. [2019-10-02 11:42:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 11:42:19,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:19,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:19,381 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:19,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:19,382 INFO L82 PathProgramCache]: Analyzing trace with hash -129702502, now seen corresponding path program 1 times [2019-10-02 11:42:19,382 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:19,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:19,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:19,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:19,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:19,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:19,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:19,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:19,510 INFO L87 Difference]: Start difference. First operand 553 states and 687 transitions. Second operand 9 states. [2019-10-02 11:42:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:19,688 INFO L93 Difference]: Finished difference Result 582 states and 718 transitions. [2019-10-02 11:42:19,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:19,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-10-02 11:42:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:19,691 INFO L225 Difference]: With dead ends: 582 [2019-10-02 11:42:19,691 INFO L226 Difference]: Without dead ends: 548 [2019-10-02 11:42:19,691 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:19,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-02 11:42:19,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-10-02 11:42:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-10-02 11:42:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 679 transitions. [2019-10-02 11:42:19,724 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 679 transitions. Word has length 62 [2019-10-02 11:42:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:19,725 INFO L475 AbstractCegarLoop]: Abstraction has 548 states and 679 transitions. [2019-10-02 11:42:19,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 679 transitions. [2019-10-02 11:42:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 11:42:19,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:19,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:19,727 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash -905491201, now seen corresponding path program 1 times [2019-10-02 11:42:19,728 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:19,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:19,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:19,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:19,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:19,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:19,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:42:19,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:42:19,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:42:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:42:19,809 INFO L87 Difference]: Start difference. First operand 548 states and 679 transitions. Second operand 8 states. [2019-10-02 11:42:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:19,964 INFO L93 Difference]: Finished difference Result 565 states and 696 transitions. [2019-10-02 11:42:19,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:42:19,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-10-02 11:42:19,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:19,967 INFO L225 Difference]: With dead ends: 565 [2019-10-02 11:42:19,968 INFO L226 Difference]: Without dead ends: 533 [2019-10-02 11:42:19,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-02 11:42:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2019-10-02 11:42:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-02 11:42:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 659 transitions. [2019-10-02 11:42:20,005 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 659 transitions. Word has length 62 [2019-10-02 11:42:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:20,005 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 659 transitions. [2019-10-02 11:42:20,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:42:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 659 transitions. [2019-10-02 11:42:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 11:42:20,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:20,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:20,007 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:20,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1235234569, now seen corresponding path program 1 times [2019-10-02 11:42:20,008 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:20,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:20,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:20,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:20,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:20,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:20,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:20,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:20,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:20,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:20,096 INFO L87 Difference]: Start difference. First operand 533 states and 659 transitions. Second operand 6 states. [2019-10-02 11:42:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:20,173 INFO L93 Difference]: Finished difference Result 775 states and 967 transitions. [2019-10-02 11:42:20,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:20,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-10-02 11:42:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:20,175 INFO L225 Difference]: With dead ends: 775 [2019-10-02 11:42:20,175 INFO L226 Difference]: Without dead ends: 549 [2019-10-02 11:42:20,177 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:20,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-02 11:42:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 533. [2019-10-02 11:42:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-02 11:42:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 657 transitions. [2019-10-02 11:42:20,213 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 657 transitions. Word has length 71 [2019-10-02 11:42:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:20,214 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 657 transitions. [2019-10-02 11:42:20,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 657 transitions. [2019-10-02 11:42:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 11:42:20,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:20,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:20,217 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash -981702428, now seen corresponding path program 1 times [2019-10-02 11:42:20,218 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:20,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:20,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:20,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:20,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:20,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:20,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:42:20,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:42:20,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:42:20,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:20,292 INFO L87 Difference]: Start difference. First operand 533 states and 657 transitions. Second operand 3 states. [2019-10-02 11:42:20,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:20,356 INFO L93 Difference]: Finished difference Result 890 states and 1105 transitions. [2019-10-02 11:42:20,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:42:20,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-02 11:42:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:20,360 INFO L225 Difference]: With dead ends: 890 [2019-10-02 11:42:20,361 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 11:42:20,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:42:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 11:42:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 607. [2019-10-02 11:42:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-02 11:42:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 751 transitions. [2019-10-02 11:42:20,425 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 751 transitions. Word has length 73 [2019-10-02 11:42:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:20,427 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 751 transitions. [2019-10-02 11:42:20,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:42:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 751 transitions. [2019-10-02 11:42:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 11:42:20,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:20,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:20,430 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:20,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash -573109325, now seen corresponding path program 1 times [2019-10-02 11:42:20,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:20,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:20,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:20,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:20,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:20,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:20,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:20,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:20,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:20,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:20,554 INFO L87 Difference]: Start difference. First operand 607 states and 751 transitions. Second operand 9 states. [2019-10-02 11:42:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:20,840 INFO L93 Difference]: Finished difference Result 636 states and 782 transitions. [2019-10-02 11:42:20,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:20,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-10-02 11:42:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:20,844 INFO L225 Difference]: With dead ends: 636 [2019-10-02 11:42:20,844 INFO L226 Difference]: Without dead ends: 561 [2019-10-02 11:42:20,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-02 11:42:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-02 11:42:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-02 11:42:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 694 transitions. [2019-10-02 11:42:20,891 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 694 transitions. Word has length 66 [2019-10-02 11:42:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:20,891 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 694 transitions. [2019-10-02 11:42:20,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 694 transitions. [2019-10-02 11:42:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 11:42:20,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:20,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:20,894 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:20,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:20,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1657933026, now seen corresponding path program 1 times [2019-10-02 11:42:20,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:20,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:20,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:20,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:20,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:20,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:42:20,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:42:20,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:42:20,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:42:20,975 INFO L87 Difference]: Start difference. First operand 561 states and 694 transitions. Second operand 4 states. [2019-10-02 11:42:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:21,179 INFO L93 Difference]: Finished difference Result 1273 states and 1559 transitions. [2019-10-02 11:42:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:42:21,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-02 11:42:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:21,183 INFO L225 Difference]: With dead ends: 1273 [2019-10-02 11:42:21,183 INFO L226 Difference]: Without dead ends: 765 [2019-10-02 11:42:21,185 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:42:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-10-02 11:42:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 655. [2019-10-02 11:42:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-02 11:42:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 800 transitions. [2019-10-02 11:42:21,229 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 800 transitions. Word has length 82 [2019-10-02 11:42:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:21,229 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 800 transitions. [2019-10-02 11:42:21,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:42:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 800 transitions. [2019-10-02 11:42:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 11:42:21,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:21,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:21,232 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:21,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1097233248, now seen corresponding path program 1 times [2019-10-02 11:42:21,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:21,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:21,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:21,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:21,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:42:21,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:42:21,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:42:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:21,355 INFO L87 Difference]: Start difference. First operand 655 states and 800 transitions. Second operand 7 states. [2019-10-02 11:42:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:22,419 INFO L93 Difference]: Finished difference Result 959 states and 1175 transitions. [2019-10-02 11:42:22,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:42:22,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-02 11:42:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:22,424 INFO L225 Difference]: With dead ends: 959 [2019-10-02 11:42:22,424 INFO L226 Difference]: Without dead ends: 650 [2019-10-02 11:42:22,426 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:42:22,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-02 11:42:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 639. [2019-10-02 11:42:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-02 11:42:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 772 transitions. [2019-10-02 11:42:22,496 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 772 transitions. Word has length 82 [2019-10-02 11:42:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:22,497 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 772 transitions. [2019-10-02 11:42:22,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:42:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 772 transitions. [2019-10-02 11:42:22,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 11:42:22,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:22,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:22,502 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:22,502 INFO L82 PathProgramCache]: Analyzing trace with hash -501162190, now seen corresponding path program 1 times [2019-10-02 11:42:22,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:22,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:22,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:22,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:22,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:22,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:22,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:22,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:22,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:22,599 INFO L87 Difference]: Start difference. First operand 639 states and 772 transitions. Second operand 5 states. [2019-10-02 11:42:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:22,664 INFO L93 Difference]: Finished difference Result 825 states and 989 transitions. [2019-10-02 11:42:22,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:22,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-02 11:42:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:22,667 INFO L225 Difference]: With dead ends: 825 [2019-10-02 11:42:22,667 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 11:42:22,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 11:42:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-10-02 11:42:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-02 11:42:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 768 transitions. [2019-10-02 11:42:22,720 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 768 transitions. Word has length 76 [2019-10-02 11:42:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:22,720 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 768 transitions. [2019-10-02 11:42:22,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 768 transitions. [2019-10-02 11:42:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 11:42:22,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:22,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:22,725 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:22,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash 211753811, now seen corresponding path program 1 times [2019-10-02 11:42:22,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:22,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:22,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:22,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:22,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:22,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:22,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:22,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:22,810 INFO L87 Difference]: Start difference. First operand 637 states and 768 transitions. Second operand 9 states. [2019-10-02 11:42:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:22,903 INFO L93 Difference]: Finished difference Result 651 states and 782 transitions. [2019-10-02 11:42:22,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:22,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-10-02 11:42:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:22,911 INFO L225 Difference]: With dead ends: 651 [2019-10-02 11:42:22,912 INFO L226 Difference]: Without dead ends: 591 [2019-10-02 11:42:22,913 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-02 11:42:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 587. [2019-10-02 11:42:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 11:42:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 703 transitions. [2019-10-02 11:42:22,961 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 703 transitions. Word has length 76 [2019-10-02 11:42:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:22,961 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 703 transitions. [2019-10-02 11:42:22,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 703 transitions. [2019-10-02 11:42:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-02 11:42:22,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:22,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:22,964 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:22,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1448627846, now seen corresponding path program 1 times [2019-10-02 11:42:22,965 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:22,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:22,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:22,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:22,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:23,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:23,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:23,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:23,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:23,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:23,066 INFO L87 Difference]: Start difference. First operand 587 states and 703 transitions. Second operand 6 states. [2019-10-02 11:42:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:23,157 INFO L93 Difference]: Finished difference Result 902 states and 1114 transitions. [2019-10-02 11:42:23,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:23,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-02 11:42:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:23,160 INFO L225 Difference]: With dead ends: 902 [2019-10-02 11:42:23,160 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 11:42:23,161 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 11:42:23,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 553. [2019-10-02 11:42:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-02 11:42:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 659 transitions. [2019-10-02 11:42:23,207 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 659 transitions. Word has length 83 [2019-10-02 11:42:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:23,207 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 659 transitions. [2019-10-02 11:42:23,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 659 transitions. [2019-10-02 11:42:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 11:42:23,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:23,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:23,210 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:23,210 INFO L82 PathProgramCache]: Analyzing trace with hash -433541091, now seen corresponding path program 1 times [2019-10-02 11:42:23,210 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:23,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:23,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:23,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:23,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:23,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:23,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:23,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:23,264 INFO L87 Difference]: Start difference. First operand 553 states and 659 transitions. Second operand 5 states. [2019-10-02 11:42:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:23,767 INFO L93 Difference]: Finished difference Result 1005 states and 1180 transitions. [2019-10-02 11:42:23,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:23,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-02 11:42:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:23,770 INFO L225 Difference]: With dead ends: 1005 [2019-10-02 11:42:23,770 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 11:42:23,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 11:42:23,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 628. [2019-10-02 11:42:23,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-02 11:42:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 735 transitions. [2019-10-02 11:42:23,824 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 735 transitions. Word has length 78 [2019-10-02 11:42:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:23,825 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 735 transitions. [2019-10-02 11:42:23,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 735 transitions. [2019-10-02 11:42:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 11:42:23,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:23,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:23,830 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:23,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1570342342, now seen corresponding path program 1 times [2019-10-02 11:42:23,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:23,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:23,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:23,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:23,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:23,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:23,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:23,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:23,917 INFO L87 Difference]: Start difference. First operand 628 states and 735 transitions. Second operand 9 states. [2019-10-02 11:42:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:24,114 INFO L93 Difference]: Finished difference Result 630 states and 736 transitions. [2019-10-02 11:42:24,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:24,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-10-02 11:42:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:24,119 INFO L225 Difference]: With dead ends: 630 [2019-10-02 11:42:24,124 INFO L226 Difference]: Without dead ends: 449 [2019-10-02 11:42:24,125 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:24,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-10-02 11:42:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-10-02 11:42:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-02 11:42:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 533 transitions. [2019-10-02 11:42:24,166 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 533 transitions. Word has length 79 [2019-10-02 11:42:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:24,166 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 533 transitions. [2019-10-02 11:42:24,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 533 transitions. [2019-10-02 11:42:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 11:42:24,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:24,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:24,168 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:24,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1336030567, now seen corresponding path program 1 times [2019-10-02 11:42:24,169 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:24,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:24,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:24,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:24,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:24,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:24,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:24,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:24,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:24,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:24,264 INFO L87 Difference]: Start difference. First operand 449 states and 533 transitions. Second operand 9 states. [2019-10-02 11:42:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:24,392 INFO L93 Difference]: Finished difference Result 470 states and 554 transitions. [2019-10-02 11:42:24,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:24,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-10-02 11:42:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:24,394 INFO L225 Difference]: With dead ends: 470 [2019-10-02 11:42:24,395 INFO L226 Difference]: Without dead ends: 449 [2019-10-02 11:42:24,395 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:42:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-10-02 11:42:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-10-02 11:42:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-02 11:42:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 532 transitions. [2019-10-02 11:42:24,432 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 532 transitions. Word has length 88 [2019-10-02 11:42:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:24,432 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 532 transitions. [2019-10-02 11:42:24,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 532 transitions. [2019-10-02 11:42:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 11:42:24,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:24,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:24,434 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:24,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2100668997, now seen corresponding path program 1 times [2019-10-02 11:42:24,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:24,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:24,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:24,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:24,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:24,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:24,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:42:24,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:42:24,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:42:24,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:24,521 INFO L87 Difference]: Start difference. First operand 449 states and 532 transitions. Second operand 7 states. [2019-10-02 11:42:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:24,702 INFO L93 Difference]: Finished difference Result 847 states and 1007 transitions. [2019-10-02 11:42:24,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:24,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-10-02 11:42:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:24,705 INFO L225 Difference]: With dead ends: 847 [2019-10-02 11:42:24,705 INFO L226 Difference]: Without dead ends: 792 [2019-10-02 11:42:24,711 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-10-02 11:42:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 370. [2019-10-02 11:42:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-02 11:42:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 431 transitions. [2019-10-02 11:42:24,748 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 431 transitions. Word has length 99 [2019-10-02 11:42:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:24,748 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 431 transitions. [2019-10-02 11:42:24,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:42:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 431 transitions. [2019-10-02 11:42:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 11:42:24,750 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:24,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:24,750 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash -289766285, now seen corresponding path program 1 times [2019-10-02 11:42:24,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:24,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:24,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:42:24,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:24,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:42:24,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:42:24,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:42:24,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:24,880 INFO L87 Difference]: Start difference. First operand 370 states and 431 transitions. Second operand 11 states. [2019-10-02 11:42:25,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:25,006 INFO L93 Difference]: Finished difference Result 515 states and 603 transitions. [2019-10-02 11:42:25,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:42:25,007 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-10-02 11:42:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:25,009 INFO L225 Difference]: With dead ends: 515 [2019-10-02 11:42:25,009 INFO L226 Difference]: Without dead ends: 366 [2019-10-02 11:42:25,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:42:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-10-02 11:42:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2019-10-02 11:42:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-10-02 11:42:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 408 transitions. [2019-10-02 11:42:25,043 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 408 transitions. Word has length 104 [2019-10-02 11:42:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:25,044 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 408 transitions. [2019-10-02 11:42:25,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:42:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 408 transitions. [2019-10-02 11:42:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 11:42:25,046 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:25,047 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:25,047 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:25,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:25,047 INFO L82 PathProgramCache]: Analyzing trace with hash -211623252, now seen corresponding path program 1 times [2019-10-02 11:42:25,047 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:25,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:25,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:25,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 11:42:25,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:25,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:25,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:25,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:25,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:25,123 INFO L87 Difference]: Start difference. First operand 353 states and 408 transitions. Second operand 6 states. [2019-10-02 11:42:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:25,177 INFO L93 Difference]: Finished difference Result 381 states and 434 transitions. [2019-10-02 11:42:25,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:25,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-10-02 11:42:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:25,178 INFO L225 Difference]: With dead ends: 381 [2019-10-02 11:42:25,179 INFO L226 Difference]: Without dead ends: 305 [2019-10-02 11:42:25,179 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-02 11:42:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2019-10-02 11:42:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-10-02 11:42:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 268 transitions. [2019-10-02 11:42:25,202 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 268 transitions. Word has length 113 [2019-10-02 11:42:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:25,203 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 268 transitions. [2019-10-02 11:42:25,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 268 transitions. [2019-10-02 11:42:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 11:42:25,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:25,205 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:25,205 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:25,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1015672895, now seen corresponding path program 1 times [2019-10-02 11:42:25,206 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:25,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:25,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:25,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 11:42:25,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:25,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:42:25,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:42:25,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:42:25,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:42:25,321 INFO L87 Difference]: Start difference. First operand 243 states and 268 transitions. Second operand 9 states. [2019-10-02 11:42:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:25,440 INFO L93 Difference]: Finished difference Result 316 states and 355 transitions. [2019-10-02 11:42:25,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:42:25,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-10-02 11:42:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:25,441 INFO L225 Difference]: With dead ends: 316 [2019-10-02 11:42:25,441 INFO L226 Difference]: Without dead ends: 287 [2019-10-02 11:42:25,442 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:42:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-02 11:42:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2019-10-02 11:42:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-02 11:42:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 293 transitions. [2019-10-02 11:42:25,464 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 293 transitions. Word has length 134 [2019-10-02 11:42:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:25,464 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 293 transitions. [2019-10-02 11:42:25,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:42:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 293 transitions. [2019-10-02 11:42:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 11:42:25,467 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:25,467 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:25,468 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash 14849890, now seen corresponding path program 1 times [2019-10-02 11:42:25,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:25,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:25,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:25,663 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 11:42:25,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:25,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 11:42:25,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:42:25,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:42:25,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:42:25,665 INFO L87 Difference]: Start difference. First operand 263 states and 293 transitions. Second operand 15 states. [2019-10-02 11:42:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:25,870 INFO L93 Difference]: Finished difference Result 368 states and 412 transitions. [2019-10-02 11:42:25,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:42:25,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 135 [2019-10-02 11:42:25,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:25,871 INFO L225 Difference]: With dead ends: 368 [2019-10-02 11:42:25,872 INFO L226 Difference]: Without dead ends: 271 [2019-10-02 11:42:25,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:42:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-02 11:42:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2019-10-02 11:42:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-02 11:42:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-10-02 11:42:25,900 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 135 [2019-10-02 11:42:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:25,901 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-10-02 11:42:25,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:42:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-10-02 11:42:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:42:25,903 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:25,904 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:25,904 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:25,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:25,904 INFO L82 PathProgramCache]: Analyzing trace with hash 709369442, now seen corresponding path program 1 times [2019-10-02 11:42:25,904 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:25,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:25,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:25,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 11:42:26,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:26,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:26,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:26,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:26,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:26,018 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 5 states. [2019-10-02 11:42:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:26,064 INFO L93 Difference]: Finished difference Result 305 states and 339 transitions. [2019-10-02 11:42:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:26,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-02 11:42:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:26,066 INFO L225 Difference]: With dead ends: 305 [2019-10-02 11:42:26,066 INFO L226 Difference]: Without dead ends: 276 [2019-10-02 11:42:26,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-10-02 11:42:26,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 263. [2019-10-02 11:42:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-02 11:42:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-10-02 11:42:26,089 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 143 [2019-10-02 11:42:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:26,089 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-10-02 11:42:26,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-10-02 11:42:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 11:42:26,091 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:26,091 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:26,091 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1897304323, now seen corresponding path program 1 times [2019-10-02 11:42:26,092 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:26,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:26,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:26,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:42:26,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:26,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:26,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:26,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:26,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:26,179 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 6 states. [2019-10-02 11:42:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:26,238 INFO L93 Difference]: Finished difference Result 357 states and 400 transitions. [2019-10-02 11:42:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:42:26,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 11:42:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:26,241 INFO L225 Difference]: With dead ends: 357 [2019-10-02 11:42:26,241 INFO L226 Difference]: Without dead ends: 269 [2019-10-02 11:42:26,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-02 11:42:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2019-10-02 11:42:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-02 11:42:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2019-10-02 11:42:26,273 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 144 [2019-10-02 11:42:26,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:26,274 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2019-10-02 11:42:26,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2019-10-02 11:42:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 11:42:26,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:26,277 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:26,278 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:26,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:26,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1361167968, now seen corresponding path program 1 times [2019-10-02 11:42:26,279 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:26,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:26,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:26,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 11:42:26,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:26,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:42:26,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:42:26,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:42:26,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:42:26,457 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand 14 states. [2019-10-02 11:42:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:27,712 INFO L93 Difference]: Finished difference Result 310 states and 347 transitions. [2019-10-02 11:42:27,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:42:27,713 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2019-10-02 11:42:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:27,715 INFO L225 Difference]: With dead ends: 310 [2019-10-02 11:42:27,715 INFO L226 Difference]: Without dead ends: 273 [2019-10-02 11:42:27,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2019-10-02 11:42:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-02 11:42:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2019-10-02 11:42:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-02 11:42:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2019-10-02 11:42:27,744 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 145 [2019-10-02 11:42:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:27,745 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2019-10-02 11:42:27,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:42:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2019-10-02 11:42:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 11:42:27,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:27,747 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:27,747 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash -659068543, now seen corresponding path program 1 times [2019-10-02 11:42:27,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:27,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:27,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:27,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 11:42:27,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:27,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:42:27,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:42:27,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:42:27,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:42:27,855 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand 6 states. [2019-10-02 11:42:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:27,951 INFO L93 Difference]: Finished difference Result 352 states and 397 transitions. [2019-10-02 11:42:27,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:42:27,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-02 11:42:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:27,953 INFO L225 Difference]: With dead ends: 352 [2019-10-02 11:42:27,953 INFO L226 Difference]: Without dead ends: 292 [2019-10-02 11:42:27,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:42:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-02 11:42:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 269. [2019-10-02 11:42:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-02 11:42:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 296 transitions. [2019-10-02 11:42:27,979 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 296 transitions. Word has length 148 [2019-10-02 11:42:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:27,980 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 296 transitions. [2019-10-02 11:42:27,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:42:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 296 transitions. [2019-10-02 11:42:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 11:42:27,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:27,982 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:27,982 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:27,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:27,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2021606810, now seen corresponding path program 1 times [2019-10-02 11:42:27,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:27,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:27,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:27,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:27,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 11:42:28,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:28,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:42:28,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:42:28,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:42:28,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:28,072 INFO L87 Difference]: Start difference. First operand 269 states and 296 transitions. Second operand 5 states. [2019-10-02 11:42:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:28,111 INFO L93 Difference]: Finished difference Result 305 states and 333 transitions. [2019-10-02 11:42:28,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:42:28,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-02 11:42:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:28,113 INFO L225 Difference]: With dead ends: 305 [2019-10-02 11:42:28,113 INFO L226 Difference]: Without dead ends: 275 [2019-10-02 11:42:28,114 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:42:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-02 11:42:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2019-10-02 11:42:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-10-02 11:42:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 300 transitions. [2019-10-02 11:42:28,139 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 300 transitions. Word has length 150 [2019-10-02 11:42:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:28,139 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 300 transitions. [2019-10-02 11:42:28,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:42:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 300 transitions. [2019-10-02 11:42:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 11:42:28,141 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:28,142 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:28,142 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2091873989, now seen corresponding path program 1 times [2019-10-02 11:42:28,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:28,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:28,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:28,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:42:28,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:42:28,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 11:42:28,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:42:28,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:42:28,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:42:28,380 INFO L87 Difference]: Start difference. First operand 273 states and 300 transitions. Second operand 15 states. [2019-10-02 11:42:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:28,642 INFO L93 Difference]: Finished difference Result 319 states and 354 transitions. [2019-10-02 11:42:28,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:42:28,642 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2019-10-02 11:42:28,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:28,644 INFO L225 Difference]: With dead ends: 319 [2019-10-02 11:42:28,644 INFO L226 Difference]: Without dead ends: 283 [2019-10-02 11:42:28,644 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:42:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-02 11:42:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 259. [2019-10-02 11:42:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-02 11:42:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 280 transitions. [2019-10-02 11:42:28,671 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 280 transitions. Word has length 150 [2019-10-02 11:42:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:28,672 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 280 transitions. [2019-10-02 11:42:28,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:42:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 280 transitions. [2019-10-02 11:42:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 11:42:28,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:28,674 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:28,674 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:28,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1666371012, now seen corresponding path program 1 times [2019-10-02 11:42:28,675 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:28,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:28,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:42:28,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:42:28,811 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:42:28,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:29,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 11:42:29,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:42:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 11:42:29,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:42:29,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-10-02 11:42:29,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 11:42:29,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 11:42:29,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:42:29,314 INFO L87 Difference]: Start difference. First operand 259 states and 280 transitions. Second operand 21 states. [2019-10-02 11:42:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:29,538 INFO L93 Difference]: Finished difference Result 305 states and 333 transitions. [2019-10-02 11:42:29,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:42:29,538 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 153 [2019-10-02 11:42:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:29,540 INFO L225 Difference]: With dead ends: 305 [2019-10-02 11:42:29,541 INFO L226 Difference]: Without dead ends: 264 [2019-10-02 11:42:29,542 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:42:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-02 11:42:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 253. [2019-10-02 11:42:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-02 11:42:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 272 transitions. [2019-10-02 11:42:29,597 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 272 transitions. Word has length 153 [2019-10-02 11:42:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:29,597 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 272 transitions. [2019-10-02 11:42:29,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 11:42:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 272 transitions. [2019-10-02 11:42:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 11:42:29,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:42:29,600 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:42:29,600 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:42:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:42:29,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1416389275, now seen corresponding path program 1 times [2019-10-02 11:42:29,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:42:29,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:42:29,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:29,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:42:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:42:29,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:42:29,801 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:42:29,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:42:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:42:30,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:42:30,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:42:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 11:42:30,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:42:30,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2019-10-02 11:42:30,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:42:30,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:42:30,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:42:30,256 INFO L87 Difference]: Start difference. First operand 253 states and 272 transitions. Second operand 14 states. [2019-10-02 11:42:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:42:30,414 INFO L93 Difference]: Finished difference Result 261 states and 280 transitions. [2019-10-02 11:42:30,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:42:30,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 158 [2019-10-02 11:42:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:42:30,415 INFO L225 Difference]: With dead ends: 261 [2019-10-02 11:42:30,415 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:42:30,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:42:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:42:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:42:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:42:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:42:30,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2019-10-02 11:42:30,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:42:30,417 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:42:30,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:42:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:42:30,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:42:30,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:42:31,110 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 162 [2019-10-02 11:42:32,506 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-10-02 11:42:33,170 WARN L191 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 71 [2019-10-02 11:42:33,377 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-10-02 11:42:33,712 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-10-02 11:42:33,835 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-02 11:42:34,111 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-10-02 11:42:34,302 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-10-02 11:42:34,516 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-10-02 11:42:35,133 WARN L191 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 81 [2019-10-02 11:42:35,243 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-02 11:42:35,631 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-10-02 11:42:35,817 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-10-02 11:42:36,230 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 64 [2019-10-02 11:42:36,798 WARN L191 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 93 [2019-10-02 11:42:36,914 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-02 11:42:37,864 WARN L191 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 95 [2019-10-02 11:42:38,008 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-02 11:42:38,160 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-10-02 11:42:38,735 WARN L191 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 81 [2019-10-02 11:42:39,572 WARN L191 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 97 [2019-10-02 11:42:39,938 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 73 [2019-10-02 11:42:40,054 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-02 11:42:40,386 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-10-02 11:42:40,686 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-10-02 11:42:40,799 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-02 11:42:41,486 WARN L191 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 92 [2019-10-02 11:42:42,001 WARN L191 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 94 [2019-10-02 11:42:42,159 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-10-02 11:42:42,269 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-02 11:42:42,488 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-10-02 11:42:42,896 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 78 [2019-10-02 11:42:43,040 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-10-02 11:42:44,178 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 183 DAG size of output: 108 [2019-10-02 11:42:44,527 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-10-02 11:42:44,903 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-10-02 11:42:45,062 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-02 11:42:45,177 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-02 11:42:45,412 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 77 [2019-10-02 11:42:45,602 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-10-02 11:42:46,541 WARN L191 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 98 [2019-10-02 11:42:46,920 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-10-02 11:42:47,061 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-10-02 11:42:47,915 WARN L191 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 99 [2019-10-02 11:42:48,086 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-10-02 11:42:48,333 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-10-02 11:42:48,446 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-02 11:42:49,270 WARN L191 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 97 [2019-10-02 11:42:49,848 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 94 [2019-10-02 11:42:51,043 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 152 DAG size of output: 104 [2019-10-02 11:42:51,204 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-10-02 11:42:51,600 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2019-10-02 11:42:51,733 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-10-02 11:42:51,892 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-10-02 11:42:52,024 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-10-02 11:42:52,128 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-02 11:42:52,789 WARN L191 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 97 [2019-10-02 11:42:53,307 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2019-10-02 11:42:53,461 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-10-02 11:42:53,648 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 93 [2019-10-02 11:42:53,751 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-02 11:42:54,027 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-10-02 11:42:54,538 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2019-10-02 11:42:54,985 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-10-02 11:42:55,270 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-10-02 11:42:55,382 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-02 11:42:55,624 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2019-10-02 11:42:56,104 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 94 [2019-10-02 11:42:57,315 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 152 DAG size of output: 104 [2019-10-02 11:42:57,518 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 93 [2019-10-02 11:42:57,788 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-10-02 11:42:57,945 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-10-02 11:42:58,109 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-10-02 11:42:58,287 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-10-02 11:42:58,532 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-02 11:42:58,682 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-10-02 11:42:58,849 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-10-02 11:42:58,986 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-10-02 11:42:59,543 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 79 [2019-10-02 11:43:00,024 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2019-10-02 11:43:00,408 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-10-02 11:43:00,743 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-10-02 11:43:00,944 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-10-02 11:43:01,058 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-02 11:43:01,214 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-10-02 11:43:01,325 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-02 11:43:01,531 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2019-10-02 11:43:01,641 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-02 11:43:01,819 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-10-02 11:43:01,931 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-02 11:43:02,163 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-10-02 11:43:02,333 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-02 11:43:02,336 INFO L443 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 908 929) no Hoare annotation was computed. [2019-10-02 11:43:02,336 INFO L443 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 908 929) no Hoare annotation was computed. [2019-10-02 11:43:02,337 INFO L446 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 908 929) the Hoare annotation is: true [2019-10-02 11:43:02,337 INFO L446 ceAbstractionStarter]: At program point L918(lines 917 927) the Hoare annotation is: true [2019-10-02 11:43:02,337 INFO L446 ceAbstractionStarter]: At program point L916(lines 915 927) the Hoare annotation is: true [2019-10-02 11:43:02,337 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 927) no Hoare annotation was computed. [2019-10-02 11:43:02,337 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 66 86) no Hoare annotation was computed. [2019-10-02 11:43:02,337 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 66 86) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (<= ~MaximumInterfaceType~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 ~PagingReferenceCount~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= ~PagingReferenceCount~0 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|)) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (<= ~MPR3~0 ~s~0) (= ~s~0 ~SKIP2~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (<= ~s~0 ~MPR3~0))) [2019-10-02 11:43:02,337 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 66 86) no Hoare annotation was computed. [2019-10-02 11:43:02,338 INFO L443 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 930 950) no Hoare annotation was computed. [2019-10-02 11:43:02,338 INFO L446 ceAbstractionStarter]: At program point L939(lines 938 948) the Hoare annotation is: true [2019-10-02 11:43:02,338 INFO L446 ceAbstractionStarter]: At program point L937(lines 936 948) the Hoare annotation is: true [2019-10-02 11:43:02,338 INFO L443 ceAbstractionStarter]: For program point L936(lines 936 948) no Hoare annotation was computed. [2019-10-02 11:43:02,338 INFO L446 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 930 950) the Hoare annotation is: true [2019-10-02 11:43:02,338 INFO L443 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 930 950) no Hoare annotation was computed. [2019-10-02 11:43:02,338 INFO L443 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 646 652) no Hoare annotation was computed. [2019-10-02 11:43:02,338 INFO L443 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsENTRY(lines 646 652) no Hoare annotation was computed. [2019-10-02 11:43:02,338 INFO L443 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsFINAL(lines 646 652) no Hoare annotation was computed. [2019-10-02 11:43:02,339 INFO L439 ceAbstractionStarter]: At program point L225(lines 224 419) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,339 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2019-10-02 11:43:02,339 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 194) no Hoare annotation was computed. [2019-10-02 11:43:02,339 INFO L439 ceAbstractionStarter]: At program point L341(line 341) the Hoare annotation is: (let ((.cse0 (= ~myStatus~0 0)) (.cse1 (<= FloppyPnp_~__cil_tmp30~0 259)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= ~PagingReferenceCount~0 1)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= 259 FloppyPnp_~__cil_tmp30~0)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (= ~setEventCalled~0 1)) (.cse8 (< 0 ~PagingReferenceCount~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse6 .cse7 .cse8) (= |old(~myStatus~0)| 259) (and .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 (not (= 259 FloppyPnp_~ntStatus~0)) .cse4 .cse5 .cse6 .cse7 .cse8) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))))) [2019-10-02 11:43:02,339 INFO L443 ceAbstractionStarter]: For program point L341-1(line 341) no Hoare annotation was computed. [2019-10-02 11:43:02,339 INFO L443 ceAbstractionStarter]: For program point L209(lines 209 424) no Hoare annotation was computed. [2019-10-02 11:43:02,339 INFO L443 ceAbstractionStarter]: For program point L300(lines 300 306) no Hoare annotation was computed. [2019-10-02 11:43:02,339 INFO L439 ceAbstractionStarter]: At program point L325(line 325) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,339 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 290) no Hoare annotation was computed. [2019-10-02 11:43:02,340 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 421) no Hoare annotation was computed. [2019-10-02 11:43:02,340 INFO L439 ceAbstractionStarter]: At program point L408(line 408) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,340 INFO L443 ceAbstractionStarter]: For program point L408-1(lines 404 410) no Hoare annotation was computed. [2019-10-02 11:43:02,340 INFO L439 ceAbstractionStarter]: At program point L243(line 243) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,340 INFO L443 ceAbstractionStarter]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2019-10-02 11:43:02,340 INFO L439 ceAbstractionStarter]: At program point L202(line 202) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,340 INFO L443 ceAbstractionStarter]: For program point L235-1(lines 228 416) no Hoare annotation was computed. [2019-10-02 11:43:02,340 INFO L443 ceAbstractionStarter]: For program point L202-1(line 202) no Hoare annotation was computed. [2019-10-02 11:43:02,341 INFO L439 ceAbstractionStarter]: At program point L392(lines 392 393) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0))) (or (and (= ~s~0 ~SKIP2~0) .cse0 .cse1 .cse2) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 (<= (+ ~IPC~0 ~SKIP1~0) (+ ~s~0 |old(~s~0)|))))) [2019-10-02 11:43:02,341 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2019-10-02 11:43:02,341 INFO L443 ceAbstractionStarter]: For program point L392-1(lines 392 393) no Hoare annotation was computed. [2019-10-02 11:43:02,341 INFO L439 ceAbstractionStarter]: At program point L227(lines 226 419) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,341 INFO L439 ceAbstractionStarter]: At program point L417(lines 228 418) the Hoare annotation is: (let ((.cse11 (<= (+ ~DC~0 5) ~IPC~0)) (.cse9 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (= 0 ~pended~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (= ~s~0 ~DC~0))) (let ((.cse0 (= ~s~0 ~IPC~0)) (.cse4 (= 1 ~pended~0)) (.cse5 (= 0 ~compRegistered~0)) (.cse8 (= ~s~0 ~SKIP2~0)) (.cse2 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0)) (.cse3 (<= ~compRegistered~0 0)) (.cse7 (and .cse11 .cse9 .cse1 .cse10 .cse6))) (or (and .cse0 .cse1 .cse2 (<= (+ ~IPC~0 ~SKIP1~0) (+ ~s~0 |old(~s~0)|)) .cse3) (and .cse4 (= ~s~0 ~NP~0) .cse5) (not (<= ~MaximumInterfaceType~0 0)) (and .cse4 .cse5 .cse6) (and .cse0 .cse4 .cse5) (= |old(~myStatus~0)| 259) (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) .cse7) (and .cse4 .cse8 .cse5) (and .cse8 .cse1 .cse2 .cse3) (or (not (<= ~MPR3~0 6)) (not .cse9) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not .cse10) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not .cse11) (not (= |old(~customIrp~0)| 0))) (and (not (= 259 FloppyPnp_~ntStatus~0)) (and (<= ~PagingReferenceCount~0 1) .cse7 (< 0 ~PagingReferenceCount~0)))))) [2019-10-02 11:43:02,342 INFO L439 ceAbstractionStarter]: At program point L351(line 351) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~s~0 ~NP~0)) (.cse2 (<= ~PagingReferenceCount~0 1)) (.cse3 (<= 1 ~compRegistered~0)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (< 0 ~PagingReferenceCount~0))) (or (and .cse0 .cse1 .cse2 (not (= 259 FloppyPnp_~ntStatus~0)) .cse3 .cse4 (= ~setEventCalled~0 1) .cse5) (and (= ~myStatus~0 0) .cse0 .cse1 .cse2 .cse3 (= 0 FloppyPnp_~ntStatus~0) .cse4 .cse5) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))))) [2019-10-02 11:43:02,342 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 330) no Hoare annotation was computed. [2019-10-02 11:43:02,342 INFO L439 ceAbstractionStarter]: At program point L219(lines 215 422) the Hoare annotation is: (or (and (= ~myStatus~0 0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~s~0 |old(~s~0)|) (= 0 FloppyPnp_~ntStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0)) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,342 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-10-02 11:43:02,342 INFO L439 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) [2019-10-02 11:43:02,342 INFO L443 ceAbstractionStarter]: For program point L310-1(line 310) no Hoare annotation was computed. [2019-10-02 11:43:02,343 INFO L439 ceAbstractionStarter]: At program point L335(line 335) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (and (= ~myStatus~0 0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= 0 FloppyPnp_~ntStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0)) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,343 INFO L443 ceAbstractionStarter]: For program point L335-1(line 335) no Hoare annotation was computed. [2019-10-02 11:43:02,343 INFO L439 ceAbstractionStarter]: At program point L261(lines 261 262) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= ~s~0 |old(~s~0)|))) (or (and (= 0 ~pended~0) .cse0 .cse1 (= |old(~customIrp~0)| ~customIrp~0)) (= |old(~myStatus~0)| 259) (and (= 1 ~pended~0) .cse0 .cse1) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))))) [2019-10-02 11:43:02,343 INFO L443 ceAbstractionStarter]: For program point L294-1(lines 228 416) no Hoare annotation was computed. [2019-10-02 11:43:02,343 INFO L443 ceAbstractionStarter]: For program point L261-1(lines 261 262) no Hoare annotation was computed. [2019-10-02 11:43:02,343 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 423) no Hoare annotation was computed. [2019-10-02 11:43:02,344 INFO L439 ceAbstractionStarter]: At program point L369(line 369) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) [2019-10-02 11:43:02,344 INFO L443 ceAbstractionStarter]: For program point L369-1(line 369) no Hoare annotation was computed. [2019-10-02 11:43:02,344 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 276) no Hoare annotation was computed. [2019-10-02 11:43:02,344 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-10-02 11:43:02,344 INFO L443 ceAbstractionStarter]: For program point L427-2(lines 427 429) no Hoare annotation was computed. [2019-10-02 11:43:02,344 INFO L439 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,344 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 420) no Hoare annotation was computed. [2019-10-02 11:43:02,345 INFO L439 ceAbstractionStarter]: At program point L213(lines 209 424) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,345 INFO L439 ceAbstractionStarter]: At program point L304(line 304) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,345 INFO L443 ceAbstractionStarter]: For program point L304-1(lines 300 306) no Hoare annotation was computed. [2019-10-02 11:43:02,345 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 205) no Hoare annotation was computed. [2019-10-02 11:43:02,345 INFO L439 ceAbstractionStarter]: At program point L288(line 288) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0))) (or (and (= 1 ~pended~0) (= ~s~0 ~NP~0) .cse0) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~pended~0) .cse0 (= ~s~0 |old(~s~0)|)))) [2019-10-02 11:43:02,346 INFO L439 ceAbstractionStarter]: At program point L255(line 255) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,346 INFO L439 ceAbstractionStarter]: At program point L222(lines 221 420) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,346 INFO L443 ceAbstractionStarter]: For program point L255-1(line 255) no Hoare annotation was computed. [2019-10-02 11:43:02,346 INFO L439 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= ~SKIP1~0 ~s~0))) (or (and (= 1 ~pended~0) .cse0 .cse1) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) .cse0 (= |old(~customIrp~0)| ~customIrp~0) .cse1))) [2019-10-02 11:43:02,346 INFO L443 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2019-10-02 11:43:02,346 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 245) no Hoare annotation was computed. [2019-10-02 11:43:02,346 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 425) no Hoare annotation was computed. [2019-10-02 11:43:02,347 INFO L439 ceAbstractionStarter]: At program point L363(line 363) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,347 INFO L443 ceAbstractionStarter]: For program point L396-1(lines 396 400) no Hoare annotation was computed. [2019-10-02 11:43:02,347 INFO L443 ceAbstractionStarter]: For program point L363-1(lines 359 365) no Hoare annotation was computed. [2019-10-02 11:43:02,347 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-10-02 11:43:02,347 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-10-02 11:43:02,347 INFO L443 ceAbstractionStarter]: For program point L264-2(lines 264 266) no Hoare annotation was computed. [2019-10-02 11:43:02,347 INFO L439 ceAbstractionStarter]: At program point L388(line 388) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) [2019-10-02 11:43:02,347 INFO L443 ceAbstractionStarter]: For program point L388-1(line 388) no Hoare annotation was computed. [2019-10-02 11:43:02,348 INFO L443 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 159 432) no Hoare annotation was computed. [2019-10-02 11:43:02,348 INFO L439 ceAbstractionStarter]: At program point L380(line 380) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,348 INFO L443 ceAbstractionStarter]: For program point L380-1(lines 376 382) no Hoare annotation was computed. [2019-10-02 11:43:02,348 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 422) no Hoare annotation was computed. [2019-10-02 11:43:02,348 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 344) no Hoare annotation was computed. [2019-10-02 11:43:02,348 INFO L443 ceAbstractionStarter]: For program point L339-2(lines 339 344) no Hoare annotation was computed. [2019-10-02 11:43:02,348 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 425) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~s~0 |old(~s~0)|) (= 0 FloppyPnp_~ntStatus~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0)) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,349 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 329) no Hoare annotation was computed. [2019-10-02 11:43:02,349 INFO L443 ceAbstractionStarter]: For program point L323-1(lines 318 330) no Hoare annotation was computed. [2019-10-02 11:43:02,349 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 419) no Hoare annotation was computed. [2019-10-02 11:43:02,349 INFO L439 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) [2019-10-02 11:43:02,349 INFO L443 ceAbstractionStarter]: For program point L414-1(line 414) no Hoare annotation was computed. [2019-10-02 11:43:02,349 INFO L439 ceAbstractionStarter]: At program point L249(line 249) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,349 INFO L443 ceAbstractionStarter]: For program point L249-1(line 249) no Hoare annotation was computed. [2019-10-02 11:43:02,350 INFO L439 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,350 INFO L443 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 159 432) no Hoare annotation was computed. [2019-10-02 11:43:02,350 INFO L443 ceAbstractionStarter]: For program point L274-1(lines 270 276) no Hoare annotation was computed. [2019-10-02 11:43:02,350 INFO L439 ceAbstractionStarter]: At program point L398(line 398) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0))) (or (and (= ~s~0 ~SKIP2~0) .cse0 .cse1 .cse2) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 (<= (+ ~IPC~0 ~SKIP1~0) (+ ~s~0 |old(~s~0)|))))) [2019-10-02 11:43:02,350 INFO L443 ceAbstractionStarter]: For program point L398-1(line 398) no Hoare annotation was computed. [2019-10-02 11:43:02,350 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 395) no Hoare annotation was computed. [2019-10-02 11:43:02,350 INFO L443 ceAbstractionStarter]: For program point L390-2(lines 228 416) no Hoare annotation was computed. [2019-10-02 11:43:02,351 INFO L439 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 159 432) the Hoare annotation is: (or (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0))) [2019-10-02 11:43:02,351 INFO L439 ceAbstractionStarter]: At program point L704(line 704) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= main_~status~1 ~lowerDriverReturn~0) (= ~s~0 ~MPR1~0) (= ~myStatus~0 0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~s~0 ~SKIP2~0) (<= 0 ~PagingReferenceCount~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (<= ~PagingReferenceCount~0 0) (<= ~s~0 ~MPR3~0) (= main_~status~1 0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-10-02 11:43:02,351 INFO L443 ceAbstractionStarter]: For program point L704-1(lines 700 837) no Hoare annotation was computed. [2019-10-02 11:43:02,351 INFO L443 ceAbstractionStarter]: For program point L795(lines 779 834) no Hoare annotation was computed. [2019-10-02 11:43:02,351 INFO L443 ceAbstractionStarter]: For program point L729(lines 729 777) no Hoare annotation was computed. [2019-10-02 11:43:02,351 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 666 838) no Hoare annotation was computed. [2019-10-02 11:43:02,351 INFO L443 ceAbstractionStarter]: For program point L812(lines 812 814) no Hoare annotation was computed. [2019-10-02 11:43:02,352 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 831) no Hoare annotation was computed. [2019-10-02 11:43:02,352 INFO L439 ceAbstractionStarter]: At program point L730(lines 729 777) the Hoare annotation is: (or (and (= main_~status~1 0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-10-02 11:43:02,352 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2019-10-02 11:43:02,352 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 784) no Hoare annotation was computed. [2019-10-02 11:43:02,352 INFO L439 ceAbstractionStarter]: At program point L747(lines 746 774) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-10-02 11:43:02,352 INFO L443 ceAbstractionStarter]: For program point L739(lines 739 775) no Hoare annotation was computed. [2019-10-02 11:43:02,353 INFO L439 ceAbstractionStarter]: At program point L706(lines 700 837) the Hoare annotation is: (let ((.cse11 (= ~s~0 ~SKIP2~0)) (.cse13 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (= ~s~0 ~IPC~0)) (.cse12 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse7 (<= ~compRegistered~0 0)) (.cse14 (not (= main_~status~1 259))) (.cse8 (= 1 ~pended~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (= 0 ~compRegistered~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse2 (= main_~status~1 0)) (.cse5 (= 0 ~pended~0)) (.cse10 (= ~s~0 ~DC~0))) (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse8 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (and .cse8 .cse11 .cse3 .cse4 .cse9 .cse12 .cse6 .cse13) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse14 .cse7) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse4 .cse5 .cse12 .cse6 (<= (+ ~DC~0 7) ~s~0) .cse7) (and (and .cse3 .cse4 .cse5 .cse6 .cse10) .cse14) (and .cse8 .cse3 .cse4 (= ~s~0 ~NP~0) .cse9 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (and .cse2 .cse5 .cse10) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|)))) [2019-10-02 11:43:02,353 INFO L443 ceAbstractionStarter]: For program point L797(lines 797 830) no Hoare annotation was computed. [2019-10-02 11:43:02,353 INFO L443 ceAbstractionStarter]: For program point L756(line 756) no Hoare annotation was computed. [2019-10-02 11:43:02,353 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 666 838) no Hoare annotation was computed. [2019-10-02 11:43:02,353 INFO L443 ceAbstractionStarter]: For program point L715(lines 715 718) no Hoare annotation was computed. [2019-10-02 11:43:02,354 INFO L439 ceAbstractionStarter]: At program point L715-2(lines 715 718) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 ~myStatus~0)) (<= ~PagingReferenceCount~0 0) (<= (+ ~NP~0 4) ~MPR1~0) (= main_~status~1 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 ~PagingReferenceCount~0) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= ~MaximumInterfaceType~0 0) (<= 6 ~MPR3~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-10-02 11:43:02,354 INFO L439 ceAbstractionStarter]: At program point L740(lines 739 775) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ~PagingReferenceCount~0 0) (<= (+ ~NP~0 4) ~MPR1~0) (= main_~status~1 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 ~PagingReferenceCount~0) (<= ~MPR3~0 6) (<= 6 ~MPR3~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-10-02 11:43:02,354 INFO L443 ceAbstractionStarter]: For program point L798(lines 798 808) no Hoare annotation was computed. [2019-10-02 11:43:02,354 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 666 838) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|)) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (<= ~MPR3~0 ~s~0) (= ~s~0 ~SKIP2~0) (<= 0 ~PagingReferenceCount~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (<= ~PagingReferenceCount~0 0) (<= ~s~0 ~MPR3~0) (<= ~MaximumInterfaceType~0 0))) [2019-10-02 11:43:02,354 INFO L443 ceAbstractionStarter]: For program point L823(lines 823 827) no Hoare annotation was computed. [2019-10-02 11:43:02,354 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2019-10-02 11:43:02,354 INFO L443 ceAbstractionStarter]: For program point L766(line 766) no Hoare annotation was computed. [2019-10-02 11:43:02,355 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 828) no Hoare annotation was computed. [2019-10-02 11:43:02,355 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 776) no Hoare annotation was computed. [2019-10-02 11:43:02,355 INFO L439 ceAbstractionStarter]: At program point L825(line 825) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-10-02 11:43:02,355 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2019-10-02 11:43:02,355 INFO L443 ceAbstractionStarter]: For program point L751(line 751) no Hoare annotation was computed. [2019-10-02 11:43:02,355 INFO L439 ceAbstractionStarter]: At program point L801(line 801) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-10-02 11:43:02,355 INFO L439 ceAbstractionStarter]: At program point L735(lines 734 776) the Hoare annotation is: (or (and (= main_~status~1 0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-10-02 11:43:02,356 INFO L439 ceAbstractionStarter]: At program point L810(lines 797 830) the Hoare annotation is: (let ((.cse6 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~s~0 ~DC~0))) (let ((.cse2 (and .cse6 (and .cse7 .cse8 .cse5)))) (let ((.cse4 (= main_~status~1 0)) (.cse3 (not (= main_~status~1 259))) (.cse0 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse1 (or (and (= main_~status~1 ~lowerDriverReturn~0) .cse6 .cse7 .cse8 (<= ~compRegistered~0 0)) .cse2))) (or (and (<= ~SKIP2~0 ~s~0) (and (and .cse0 .cse1) (<= (+ ~SKIP1~0 2) ~MPR1~0))) (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse2 .cse3) (and .cse1 .cse4) (not (<= 0 |old(~PagingReferenceCount~0)|)) (and .cse4 .cse5) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse0 .cse3) (and .cse0 (<= (+ ~DC~0 7) ~s~0) .cse1) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (and (= 1 ~pended~0) .cse6 .cse7 .cse8) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|)))))) [2019-10-02 11:43:02,356 INFO L443 ceAbstractionStarter]: For program point L744(lines 744 774) no Hoare annotation was computed. [2019-10-02 11:43:02,356 INFO L439 ceAbstractionStarter]: At program point L794(lines 787 833) the Hoare annotation is: (let ((.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (= ~s~0 ~DC~0))) (let ((.cse9 (= main_~status~1 0)) (.cse8 (and .cse3 .cse4 .cse5 .cse10)) (.cse0 (= ~s~0 ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (= 1 ~pended~0)) (.cse11 (= main_~status~1 ~lowerDriverReturn~0)) (.cse12 (= ~s~0 ~IPC~0)) (.cse1 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse13 (not (= main_~status~1 259))) (.cse6 (<= ~compRegistered~0 0))) (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (and .cse0 (and .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6)) .cse7) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse2 .cse8) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (and .cse9 .cse10) (not (= |old(~compRegistered~0)| 0)) (and .cse11 .cse12 .cse4 .cse1 .cse5 (<= (+ ~DC~0 7) ~s~0) .cse6) (and .cse11 .cse12 .cse9 .cse3 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (and .cse8 .cse13) (and .cse11 .cse0 .cse7 (and .cse3 .cse4 .cse1 .cse5 .cse6)) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse11 .cse12 .cse3 .cse4 .cse1 .cse5 .cse13 .cse6) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))))) [2019-10-02 11:43:02,356 INFO L443 ceAbstractionStarter]: For program point L761(line 761) no Hoare annotation was computed. [2019-10-02 11:43:02,357 INFO L439 ceAbstractionStarter]: At program point L819(line 819) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-10-02 11:43:02,357 INFO L439 ceAbstractionStarter]: At program point L786(lines 779 834) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse1 (= ~s~0 ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (= main_~status~1 ~lowerDriverReturn~0)) (.cse9 (= ~s~0 ~IPC~0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse12 (<= ~compRegistered~0 0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (not (= main_~status~1 259))) (.cse10 (= main_~status~1 0)) (.cse11 (= 0 ~pended~0)) (.cse13 (= ~s~0 ~DC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (and .cse8 .cse9 .cse10 .cse3 .cse2 .cse11 .cse6 .cse12) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse3 .cse2 .cse4 .cse6 .cse13) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse8 .cse9 .cse3 .cse2 .cse11 .cse5 .cse6 .cse14 .cse12) (and .cse8 .cse1 .cse3 .cse2 .cse11 .cse5 .cse6 .cse7 .cse12) (and .cse8 .cse9 .cse2 .cse11 .cse5 .cse6 (<= (+ ~DC~0 7) ~s~0) .cse12) (and (and .cse3 .cse2 .cse11 .cse6 .cse13) .cse14) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (and .cse10 .cse11 .cse13) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|)))) [2019-10-02 11:43:02,357 INFO L443 ceAbstractionStarter]: For program point L720(lines 706 778) no Hoare annotation was computed. [2019-10-02 11:43:02,357 INFO L439 ceAbstractionStarter]: At program point L745(lines 744 774) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= 259 ~myStatus~0)) (<= ~PagingReferenceCount~0 0) (<= (+ ~NP~0 4) ~MPR1~0) (= main_~status~1 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= 0 ~PagingReferenceCount~0) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= ~MaximumInterfaceType~0 0) (<= 6 ~MPR3~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-10-02 11:43:02,358 INFO L439 ceAbstractionStarter]: At program point L1176(line 1176) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2019-10-02 11:43:02,358 INFO L443 ceAbstractionStarter]: For program point L1176-1(line 1176) no Hoare annotation was computed. [2019-10-02 11:43:02,358 INFO L443 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 1167 1180) no Hoare annotation was computed. [2019-10-02 11:43:02,358 INFO L439 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 1167 1180) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2019-10-02 11:43:02,358 INFO L443 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 1167 1180) no Hoare annotation was computed. [2019-10-02 11:43:02,358 INFO L439 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (or (= ~myStatus~0 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (= ~setEventCalled~0 1)) (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)))) [2019-10-02 11:43:02,358 INFO L443 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2019-10-02 11:43:02,359 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 951 964) the Hoare annotation is: (or (= ~myStatus~0 259) (= ~s~0 |old(~s~0)|) (not (<= ~MaximumInterfaceType~0 0)) (or (not (= ~setEventCalled~0 1)) (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)))) [2019-10-02 11:43:02,359 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 951 964) no Hoare annotation was computed. [2019-10-02 11:43:02,359 INFO L446 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: true [2019-10-02 11:43:02,359 INFO L443 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2019-10-02 11:43:02,359 INFO L446 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 601 610) the Hoare annotation is: true [2019-10-02 11:43:02,359 INFO L443 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 601 610) no Hoare annotation was computed. [2019-10-02 11:43:02,359 INFO L443 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 601 610) no Hoare annotation was computed. [2019-10-02 11:43:02,360 INFO L439 ceAbstractionStarter]: At program point L1088(lines 1087 1099) the Hoare annotation is: (let ((.cse33 (= ~s~0 ~NP~0)) (.cse29 (<= ~PagingReferenceCount~0 1)) (.cse31 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse30 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse32 (<= ~MPR3~0 6)) (.cse27 (< 0 ~PagingReferenceCount~0)) (.cse28 (<= 6 ~MPR3~0)) (.cse34 (<= (+ ~DC~0 5) ~IPC~0)) (.cse38 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse36 (<= 1 ~compRegistered~0)) (.cse35 (= 0 ~pended~0)) (.cse37 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (not .cse37)) (.cse11 (not .cse35)) (.cse14 (not .cse36)) (.cse6 (not .cse38)) (.cse15 (not .cse34)) (.cse1 (and .cse34 .cse35 .cse33 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse29 .cse31 .cse36 .cse30 (not (= ~MPR3~0 |old(~s~0)|)) .cse37 .cse38 .cse32 (= ~setEventCalled~0 1) .cse27 .cse28)) (.cse20 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse19 (= ~s~0 |old(~s~0)|)) (.cse18 (not (= ~compRegistered~0 0))) (.cse0 (and .cse1 .cse20)) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse22 (not (= ~myStatus~0 0))) (.cse21 (not (= |old(~customIrp~0)| 0))) (.cse24 (and .cse33 .cse20)) (.cse16 (= ~myStatus~0 259)) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not .cse32)) (.cse9 (not .cse31)) (.cse10 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse23 (not (<= |old(~s~0)| ~MPR3~0))) (.cse5 (not .cse30)) (.cse25 (or .cse4 .cse11 .cse14 .cse6 .cse15)) (.cse12 (not .cse29)) (.cse7 (not .cse28)) (.cse13 (not .cse27)) (.cse26 (not (<= ~MPR3~0 |old(~s~0)|))) (.cse17 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (or .cse0 (and (= |old(~customIrp~0)| 1) .cse1 (= 0 ~customIrp~0))) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) (or .cse4 (not (= 1 ~pended~0)) .cse8 .cse9 .cse10 .cse18 .cse19 .cse6 .cse15) (or .cse3 (and .cse19 .cse20) .cse7 (or .cse4 .cse8 .cse9 .cse10 .cse18 .cse11 .cse5 .cse6 .cse15) .cse21) (or .cse2 .cse3 .cse4 .cse22 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (or .cse2 .cse3 .cse22 .cse5 .cse7 .cse9 .cse10 .cse23 .cse24 .cse25 .cse12 .cse13 .cse21 .cse26) (or .cse24 .cse16 (or .cse2 .cse3 .cse9 .cse10 .cse23 .cse5 .cse25 .cse12 .cse7 .cse13 .cse26) .cse17))))) [2019-10-02 11:43:02,360 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1060 1101) no Hoare annotation was computed. [2019-10-02 11:43:02,360 INFO L439 ceAbstractionStarter]: At program point L1080(line 1080) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse18 (not (= 0 ~pended~0))) (.cse21 (not (<= 1 ~compRegistered~0))) (.cse5 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse7 (= ~myStatus~0 259)) (.cse17 (not (<= ~MaximumInterfaceType~0 0))) (.cse8 (not (= |old(~setEventCalled~0)| 1))) (.cse9 (not (<= ~MPR3~0 6))) (.cse20 (not (= ~myStatus~0 0))) (.cse11 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse14 (not (<= 6 ~MPR3~0))) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse10 (not (<= |old(~s~0)| ~MPR3~0))) (.cse12 (or .cse0 .cse18 .cse21 .cse5 .cse6)) (.cse13 (not (<= ~PagingReferenceCount~0 1))) (.cse15 (not (< 0 ~PagingReferenceCount~0))) (.cse19 (not (= |old(~customIrp~0)| 0))) (.cse16 (not (<= ~MPR3~0 |old(~s~0)|)))) (and (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 (or .cse8 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17) (or .cse9 .cse14 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse11 .cse5 .cse6) .cse19) (or .cse8 .cse9 .cse0 .cse20 .cse11 .cse5 .cse14 .cse1 .cse2 .cse3 .cse18 .cse13 .cse15 .cse21 .cse6 .cse19) (or (or .cse8 .cse9 .cse0 .cse11 .cse5 .cse14 .cse1 .cse2 .cse3 .cse18 .cse13 .cse15 .cse21 .cse6) .cse7 .cse17) (or .cse8 .cse9 .cse20 .cse11 .cse14 .cse2 .cse3 .cse10 .cse12 .cse13 .cse15 .cse19 .cse16)))) [2019-10-02 11:43:02,360 INFO L443 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2019-10-02 11:43:02,361 INFO L443 ceAbstractionStarter]: For program point L1078-1(lines 1065 1084) no Hoare annotation was computed. [2019-10-02 11:43:02,361 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1071) no Hoare annotation was computed. [2019-10-02 11:43:02,361 INFO L443 ceAbstractionStarter]: For program point L1087(lines 1087 1099) no Hoare annotation was computed. [2019-10-02 11:43:02,361 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1060 1101) no Hoare annotation was computed. [2019-10-02 11:43:02,361 INFO L439 ceAbstractionStarter]: At program point L1073(lines 1065 1084) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse20 (not (= 0 ~pended~0))) (.cse21 (not (<= 1 ~compRegistered~0))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse1 (= ~s~0 |old(~s~0)|)) (.cse24 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse8 (= ~myStatus~0 259)) (.cse18 (not (<= ~MaximumInterfaceType~0 0))) (.cse22 (and .cse1 .cse24 (= ~setEventCalled~0 1))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (= ~compRegistered~0 0))) (.cse9 (not (= |old(~setEventCalled~0)| 1))) (.cse10 (not (<= ~MPR3~0 6))) (.cse19 (not (= ~myStatus~0 0))) (.cse12 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse15 (not (<= 6 ~MPR3~0))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse4 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse11 (not (<= |old(~s~0)| ~MPR3~0))) (.cse13 (or .cse0 .cse20 .cse21 .cse6 .cse7)) (.cse14 (not (<= ~PagingReferenceCount~0 1))) (.cse16 (not (< 0 ~PagingReferenceCount~0))) (.cse23 (not (= |old(~customIrp~0)| 0))) (.cse17 (not (<= ~MPR3~0 |old(~s~0)|)))) (and (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 (or .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18) (or .cse9 .cse10 .cse0 .cse19 .cse12 .cse6 .cse15 .cse2 .cse3 .cse4 .cse20 .cse14 .cse16 .cse21 .cse7 .cse22 .cse23) (or (or .cse9 .cse10 .cse0 .cse12 .cse6 .cse15 .cse2 .cse3 .cse4 .cse20 .cse14 .cse16 .cse21 .cse7) .cse8 .cse18 .cse22) (or .cse10 (and .cse1 .cse24) .cse15 (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse20 .cse12 .cse6 .cse7) .cse23) (or .cse9 .cse10 .cse19 .cse12 .cse15 .cse3 .cse4 .cse11 .cse13 .cse14 .cse16 .cse23 .cse17)))) [2019-10-02 11:43:02,361 INFO L443 ceAbstractionStarter]: For program point L1065(lines 1065 1084) no Hoare annotation was computed. [2019-10-02 11:43:02,362 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1060 1101) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse14 (not (= 0 ~pended~0))) (.cse17 (not (<= 1 ~compRegistered~0))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse4 (= ~s~0 |old(~s~0)|)) (.cse19 (= |old(~customIrp~0)| ~customIrp~0)) (.cse26 (= ~setEventCalled~0 1))) (let ((.cse5 (not (= ~compRegistered~0 0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse13 (and .cse4 .cse19 .cse26)) (.cse20 (= ~myStatus~0 259)) (.cse21 (not (<= ~MaximumInterfaceType~0 0))) (.cse8 (not (= |old(~setEventCalled~0)| 1))) (.cse9 (not (<= ~MPR3~0 6))) (.cse25 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse19 .cse26)) (.cse10 (not (= ~myStatus~0 0))) (.cse11 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse12 (not (<= 6 ~MPR3~0))) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse22 (not (<= |old(~s~0)| ~MPR3~0))) (.cse23 (or .cse0 .cse14 .cse17 .cse6 .cse7)) (.cse15 (not (<= ~PagingReferenceCount~0 1))) (.cse16 (not (< 0 ~PagingReferenceCount~0))) (.cse18 (not (= |old(~customIrp~0)| 0))) (.cse24 (not (<= ~MPR3~0 |old(~s~0)|)))) (and (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse0 .cse10 .cse11 .cse6 .cse12 .cse13 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18) (or .cse9 (and .cse4 .cse19) .cse12 (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse11 .cse6 .cse7) .cse18) (or (or .cse8 .cse9 .cse0 .cse11 .cse6 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse17 .cse7) .cse20 .cse13 .cse21) (or .cse20 (or .cse8 .cse9 .cse2 .cse3 .cse22 .cse11 .cse23 .cse15 .cse12 .cse16 .cse24) .cse21 .cse25) (or .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse2 .cse3 .cse22 .cse23 .cse15 .cse16 .cse18 .cse24)))) [2019-10-02 11:43:02,362 INFO L439 ceAbstractionStarter]: At program point L1090(lines 1089 1099) the Hoare annotation is: (let ((.cse33 (= ~s~0 ~NP~0)) (.cse29 (<= ~PagingReferenceCount~0 1)) (.cse31 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse30 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse32 (<= ~MPR3~0 6)) (.cse27 (< 0 ~PagingReferenceCount~0)) (.cse28 (<= 6 ~MPR3~0)) (.cse34 (<= (+ ~DC~0 5) ~IPC~0)) (.cse38 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse36 (<= 1 ~compRegistered~0)) (.cse35 (= 0 ~pended~0)) (.cse37 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (not .cse37)) (.cse11 (not .cse35)) (.cse14 (not .cse36)) (.cse6 (not .cse38)) (.cse15 (not .cse34)) (.cse1 (and .cse34 .cse35 .cse33 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse29 .cse31 .cse36 .cse30 (not (= ~MPR3~0 |old(~s~0)|)) .cse37 .cse38 .cse32 (= ~setEventCalled~0 1) .cse27 .cse28)) (.cse20 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse19 (= ~s~0 |old(~s~0)|)) (.cse18 (not (= ~compRegistered~0 0))) (.cse0 (and .cse1 .cse20)) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse22 (not (= ~myStatus~0 0))) (.cse21 (not (= |old(~customIrp~0)| 0))) (.cse24 (and .cse33 .cse20)) (.cse16 (= ~myStatus~0 259)) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not .cse32)) (.cse9 (not .cse31)) (.cse10 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse23 (not (<= |old(~s~0)| ~MPR3~0))) (.cse5 (not .cse30)) (.cse25 (or .cse4 .cse11 .cse14 .cse6 .cse15)) (.cse12 (not .cse29)) (.cse7 (not .cse28)) (.cse13 (not .cse27)) (.cse26 (not (<= ~MPR3~0 |old(~s~0)|))) (.cse17 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (or .cse0 (and (= |old(~customIrp~0)| 1) .cse1 (= 0 ~customIrp~0))) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) (or .cse4 (not (= 1 ~pended~0)) .cse8 .cse9 .cse10 .cse18 .cse19 .cse6 .cse15) (or .cse3 (and .cse19 .cse20) .cse7 (or .cse4 .cse8 .cse9 .cse10 .cse18 .cse11 .cse5 .cse6 .cse15) .cse21) (or .cse2 .cse3 .cse4 .cse22 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (or .cse2 .cse3 .cse22 .cse5 .cse7 .cse9 .cse10 .cse23 .cse24 .cse25 .cse12 .cse13 .cse21 .cse26) (or .cse24 .cse16 (or .cse2 .cse3 .cse9 .cse10 .cse23 .cse5 .cse25 .cse12 .cse7 .cse13 .cse26) .cse17))))) [2019-10-02 11:43:02,362 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1038 1051) the Hoare annotation is: (let ((.cse3 (not (= 0 ~pended~0))) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse5 (= ~s~0 ~NP~0)) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse6 (not (= ~compRegistered~0 0))) (.cse1 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or (= ~s~0 |old(~s~0)|) (or (not (<= ~MPR3~0 6)) .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse1 (not (<= 6 ~MPR3~0)) (or .cse2 .cse3) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) .cse4)) (or .cse5 .cse2 .cse6 .cse3) (or .cse0 (not (= 1 ~pended~0)) .cse5 .cse2 .cse6 .cse1 .cse4))) [2019-10-02 11:43:02,363 INFO L439 ceAbstractionStarter]: At program point L1046(line 1046) the Hoare annotation is: (let ((.cse2 (not (= 0 ~pended~0))) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or .cse0 .cse1 .cse2) (or (not (<= ~MPR3~0 6)) .cse3 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse4 (not (<= 6 ~MPR3~0)) (or .cse0 .cse2) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) .cse5) (or .cse3 (not (= 1 ~pended~0)) .cse0 .cse1 .cse4 .cse5))) [2019-10-02 11:43:02,363 INFO L443 ceAbstractionStarter]: For program point L1046-1(lines 1038 1051) no Hoare annotation was computed. [2019-10-02 11:43:02,363 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1038 1051) no Hoare annotation was computed. [2019-10-02 11:43:02,363 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1048) no Hoare annotation was computed. [2019-10-02 11:43:02,363 INFO L443 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 433 600) no Hoare annotation was computed. [2019-10-02 11:43:02,363 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2019-10-02 11:43:02,363 INFO L439 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 433 600) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0))) [2019-10-02 11:43:02,364 INFO L439 ceAbstractionStarter]: At program point L507(line 507) the Hoare annotation is: (or (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (and (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0))) [2019-10-02 11:43:02,364 INFO L443 ceAbstractionStarter]: For program point L507-1(line 507) no Hoare annotation was computed. [2019-10-02 11:43:02,364 INFO L439 ceAbstractionStarter]: At program point L532(line 532) the Hoare annotation is: (or (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (and (< 0 (+ FloppyStartDevice_~ntStatus~1 1)) (and (= ~myStatus~0 |old(~myStatus~0)|) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)))) (not (<= ~MaximumInterfaceType~0 0))) [2019-10-02 11:43:02,364 INFO L443 ceAbstractionStarter]: For program point L532-1(line 532) no Hoare annotation was computed. [2019-10-02 11:43:02,364 INFO L439 ceAbstractionStarter]: At program point L557(lines 557 559) the Hoare annotation is: (or (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0))) [2019-10-02 11:43:02,365 INFO L443 ceAbstractionStarter]: For program point L557-1(lines 557 559) no Hoare annotation was computed. [2019-10-02 11:43:02,365 INFO L439 ceAbstractionStarter]: At program point L549-2(lines 549 565) the Hoare annotation is: (or (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (and (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= FloppyStartDevice_~ntStatus~1 259)) (= ~myStatus~0 |old(~myStatus~0)|)) (<= 0 FloppyStartDevice_~InterfaceType~0))) [2019-10-02 11:43:02,365 INFO L439 ceAbstractionStarter]: At program point L566(lines 527 592) the Hoare annotation is: (or (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= FloppyStartDevice_~ntStatus~1 259)) (= ~myStatus~0 |old(~myStatus~0)|)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0))) [2019-10-02 11:43:02,365 INFO L439 ceAbstractionStarter]: At program point L525(line 525) the Hoare annotation is: (or (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (and (= ~myStatus~0 |old(~myStatus~0)|) (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (<= 1 ~compRegistered~0)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0))) (or (and .cse0 .cse1 (<= FloppyStartDevice_~__cil_tmp42~0 259) (< 258 FloppyStartDevice_~__cil_tmp42~0) .cse2) (and .cse0 .cse1 .cse2 (= ~setEventCalled~0 1))))) (not (<= ~MaximumInterfaceType~0 0))) [2019-10-02 11:43:02,365 INFO L439 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (or (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0))) [2019-10-02 11:43:02,366 INFO L443 ceAbstractionStarter]: For program point L525-1(line 525) no Hoare annotation was computed. [2019-10-02 11:43:02,366 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 588) no Hoare annotation was computed. [2019-10-02 11:43:02,366 INFO L443 ceAbstractionStarter]: For program point L550(lines 549 565) no Hoare annotation was computed. [2019-10-02 11:43:02,366 INFO L443 ceAbstractionStarter]: For program point L583-2(lines 583 588) no Hoare annotation was computed. [2019-10-02 11:43:02,366 INFO L439 ceAbstractionStarter]: At program point L542(lines 529 569) the Hoare annotation is: (let ((.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (= 0 ~pended~0)) (.cse7 (<= ~PagingReferenceCount~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (<= ~MPR3~0 6)) (.cse8 (< 0 ~PagingReferenceCount~0)) (.cse4 (<= 6 ~MPR3~0))) (or (or (not .cse0) (not .cse1) (not .cse2) (not .cse3) (not .cse4) (not (= |old(~s~0)| ~NP~0)) (not .cse5) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not .cse6) (not .cse7) (not .cse8) (not .cse9) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (let ((.cse10 (and .cse9 .cse6 (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse7 .cse5 (<= 1 ~compRegistered~0) .cse2 .cse1 .cse3 .cse0 .cse8 .cse4)) (.cse11 (= ~myStatus~0 |old(~myStatus~0)|))) (or (and (< 0 (+ FloppyStartDevice_~ntStatus~1 1)) .cse10 (= FloppyStartDevice_~ntStatus~1 |old(~myStatus~0)|) .cse11) (and (= FloppyStartDevice_~ntStatus~1 0) .cse10 .cse11))))) [2019-10-02 11:43:02,366 INFO L443 ceAbstractionStarter]: For program point L534(lines 534 537) no Hoare annotation was computed. [2019-10-02 11:43:02,366 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 543 546) no Hoare annotation was computed. [2019-10-02 11:43:02,366 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 592) no Hoare annotation was computed. [2019-10-02 11:43:02,367 INFO L443 ceAbstractionStarter]: For program point L527-1(lines 527 592) no Hoare annotation was computed. [2019-10-02 11:43:02,367 INFO L443 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 433 600) no Hoare annotation was computed. [2019-10-02 11:43:02,367 INFO L439 ceAbstractionStarter]: At program point L585(lines 585 586) the Hoare annotation is: (let ((.cse11 (<= (+ ~DC~0 5) ~IPC~0)) (.cse8 (= 0 ~pended~0)) (.cse9 (<= ~PagingReferenceCount~0 1)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse2 (<= ~MPR3~0 6)) (.cse10 (< 0 ~PagingReferenceCount~0)) (.cse6 (<= 6 ~MPR3~0))) (let ((.cse0 (and .cse11 .cse8 (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse9 .cse7 (<= 1 ~compRegistered~0) .cse4 .cse3 .cse5 .cse2 .cse10 .cse6)) (.cse1 (= ~myStatus~0 |old(~myStatus~0)|))) (or (and (and (< 0 (+ FloppyStartDevice_~ntStatus~1 1)) .cse0 .cse1) (not (= FloppyStartDevice_~ntStatus~1 259))) (or (not .cse2) (not .cse3) (not .cse4) (not .cse5) (not .cse6) (not (= |old(~s~0)| ~NP~0)) (not .cse7) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not .cse8) (not .cse9) (not .cse10) (not .cse11) (not (= |old(~customIrp~0)| 0))) (and (= FloppyStartDevice_~ntStatus~1 |old(~myStatus~0)|) .cse0 .cse1) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0))))) [2019-10-02 11:43:02,367 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 585 586) no Hoare annotation was computed. [2019-10-02 11:43:02,367 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 516) no Hoare annotation was computed. [2019-10-02 11:43:02,367 INFO L443 ceAbstractionStarter]: For program point L511-2(lines 511 516) no Hoare annotation was computed. [2019-10-02 11:43:02,367 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2019-10-02 11:43:02,367 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 501) no Hoare annotation was computed. [2019-10-02 11:43:02,368 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 490 502) no Hoare annotation was computed. [2019-10-02 11:43:02,368 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 569) no Hoare annotation was computed. [2019-10-02 11:43:02,368 INFO L439 ceAbstractionStarter]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0)) (.cse1 (<= FloppyStartDevice_~__cil_tmp42~0 259)) (.cse2 (< 258 FloppyStartDevice_~__cil_tmp42~0)) (.cse3 (= ~myStatus~0 |old(~myStatus~0)|)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (= ~setEventCalled~0 1))) (or (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (and .cse0 (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse1 .cse2 .cse3 .cse4 .cse5) (not (<= ~MaximumInterfaceType~0 0)) (and (= ~s~0 ~NP~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-10-02 11:43:02,368 INFO L443 ceAbstractionStarter]: For program point L513-1(line 513) no Hoare annotation was computed. [2019-10-02 11:43:02,368 INFO L443 ceAbstractionStarter]: For program point L571(lines 571 578) no Hoare annotation was computed. [2019-10-02 11:43:02,368 INFO L439 ceAbstractionStarter]: At program point L571-2(lines 571 578) the Hoare annotation is: (let ((.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (= 0 ~pended~0)) (.cse7 (<= ~PagingReferenceCount~0 1)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse1 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (<= ~MPR3~0 6)) (.cse8 (< 0 ~PagingReferenceCount~0)) (.cse4 (<= 6 ~MPR3~0))) (let ((.cse10 (and .cse9 .cse6 (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse7 .cse5 (<= 1 ~compRegistered~0) .cse2 .cse1 .cse3 .cse0 .cse8 .cse4)) (.cse11 (= ~myStatus~0 |old(~myStatus~0)|))) (or (or (not .cse0) (not .cse1) (not .cse2) (not .cse3) (not .cse4) (not (= |old(~s~0)| ~NP~0)) (not .cse5) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not .cse6) (not .cse7) (not .cse8) (not .cse9) (not (= |old(~customIrp~0)| 0))) (and (= FloppyStartDevice_~ntStatus~1 |old(~myStatus~0)|) .cse10 .cse11) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0)) (and (and (< 0 (+ FloppyStartDevice_~ntStatus~1 1)) .cse10 .cse11) (not (= FloppyStartDevice_~ntStatus~1 259)))))) [2019-10-02 11:43:02,369 INFO L439 ceAbstractionStarter]: At program point L596(line 596) the Hoare annotation is: (or (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= FloppyStartDevice_~ntStatus~1 259))) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0))) [2019-10-02 11:43:02,369 INFO L443 ceAbstractionStarter]: For program point L596-1(line 596) no Hoare annotation was computed. [2019-10-02 11:43:02,369 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 540) no Hoare annotation was computed. [2019-10-02 11:43:02,369 INFO L439 ceAbstractionStarter]: At program point L497(line 497) the Hoare annotation is: (or (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (= |old(~myStatus~0)| 259) (not (<= ~MaximumInterfaceType~0 0))) [2019-10-02 11:43:02,369 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 581) no Hoare annotation was computed. [2019-10-02 11:43:02,369 INFO L446 ceAbstractionStarter]: At program point L1134(lines 1133 1143) the Hoare annotation is: true [2019-10-02 11:43:02,369 INFO L443 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1124 1145) no Hoare annotation was computed. [2019-10-02 11:43:02,370 INFO L446 ceAbstractionStarter]: At program point L1132(lines 1131 1143) the Hoare annotation is: true [2019-10-02 11:43:02,370 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1143) no Hoare annotation was computed. [2019-10-02 11:43:02,370 INFO L446 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1124 1145) the Hoare annotation is: true [2019-10-02 11:43:02,370 INFO L443 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1124 1145) no Hoare annotation was computed. [2019-10-02 11:43:02,370 INFO L443 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1102 1123) no Hoare annotation was computed. [2019-10-02 11:43:02,370 INFO L446 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1102 1123) the Hoare annotation is: true [2019-10-02 11:43:02,370 INFO L443 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1102 1123) no Hoare annotation was computed. [2019-10-02 11:43:02,370 INFO L446 ceAbstractionStarter]: At program point L1112(lines 1111 1121) the Hoare annotation is: true [2019-10-02 11:43:02,370 INFO L446 ceAbstractionStarter]: At program point L1110(lines 1109 1121) the Hoare annotation is: true [2019-10-02 11:43:02,371 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1121) no Hoare annotation was computed. [2019-10-02 11:43:02,371 INFO L443 ceAbstractionStarter]: For program point L849(lines 849 861) no Hoare annotation was computed. [2019-10-02 11:43:02,371 INFO L443 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 839 863) no Hoare annotation was computed. [2019-10-02 11:43:02,371 INFO L443 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 839 863) no Hoare annotation was computed. [2019-10-02 11:43:02,371 INFO L439 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 839 863) the Hoare annotation is: (or (= ~myStatus~0 259) (= |old(~customIrp~0)| ~customIrp~0) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (or (not (= ~s~0 ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,371 INFO L446 ceAbstractionStarter]: At program point L852(lines 851 861) the Hoare annotation is: true [2019-10-02 11:43:02,371 INFO L446 ceAbstractionStarter]: At program point L850(lines 849 861) the Hoare annotation is: true [2019-10-02 11:43:02,371 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1052 1059) the Hoare annotation is: true [2019-10-02 11:43:02,371 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1052 1059) no Hoare annotation was computed. [2019-10-02 11:43:02,372 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1052 1059) no Hoare annotation was computed. [2019-10-02 11:43:02,372 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 653 665) no Hoare annotation was computed. [2019-10-02 11:43:02,372 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 653 665) the Hoare annotation is: (or (= ~myStatus~0 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~PagingReferenceCount~0 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 ~PagingReferenceCount~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0))) [2019-10-02 11:43:02,372 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 653 665) no Hoare annotation was computed. [2019-10-02 11:43:02,372 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 1622 1629) the Hoare annotation is: true [2019-10-02 11:43:02,372 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 1622 1629) no Hoare annotation was computed. [2019-10-02 11:43:02,372 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 1622 1629) no Hoare annotation was computed. [2019-10-02 11:43:02,373 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1626) no Hoare annotation was computed. [2019-10-02 11:43:02,373 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 135) no Hoare annotation was computed. [2019-10-02 11:43:02,373 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-10-02 11:43:02,373 INFO L439 ceAbstractionStarter]: At program point L153(line 153) the Hoare annotation is: (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (<= 6 ~MPR3~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse10 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= |old(~PagingReferenceCount~0)| 1)) (not (< 0 |old(~PagingReferenceCount~0)|)) .cse10 (not (= ~customIrp~0 0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~PagingReferenceCount~0)| 0)) .cse4 .cse5 (not (<= 0 |old(~PagingReferenceCount~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-10-02 11:43:02,373 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 122) no Hoare annotation was computed. [2019-10-02 11:43:02,373 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 149 155) no Hoare annotation was computed. [2019-10-02 11:43:02,373 INFO L439 ceAbstractionStarter]: At program point L120-2(lines 120 122) the Hoare annotation is: (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (<= 6 ~MPR3~0))) (.cse7 (= 0 ~pended~0)) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= |old(~PagingReferenceCount~0)| 1)) (not (< 0 |old(~PagingReferenceCount~0)|)) .cse11 (not (= ~customIrp~0 0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~PagingReferenceCount~0)| 0)) .cse4 (and .cse7 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse5 (not (<= 0 |old(~PagingReferenceCount~0)|)) .cse6 .cse8 .cse9 .cse10 .cse11))) [2019-10-02 11:43:02,374 INFO L443 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 96 158) no Hoare annotation was computed. [2019-10-02 11:43:02,374 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 145) no Hoare annotation was computed. [2019-10-02 11:43:02,374 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2019-10-02 11:43:02,374 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 133) no Hoare annotation was computed. [2019-10-02 11:43:02,374 INFO L439 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 96 158) the Hoare annotation is: (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (<= 6 ~MPR3~0))) (.cse10 (= 0 ~pended~0)) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~PagingReferenceCount~0)| 0)) .cse4 .cse5 (not (<= 0 |old(~PagingReferenceCount~0)|)) .cse6 .cse7 .cse8 .cse9 (and .cse10 (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse10 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= |old(~PagingReferenceCount~0)| 1)) (not (< 0 |old(~PagingReferenceCount~0)|)) .cse11 (not (= ~customIrp~0 0))))) [2019-10-02 11:43:02,374 INFO L443 ceAbstractionStarter]: For program point L131-2(lines 131 133) no Hoare annotation was computed. [2019-10-02 11:43:02,374 INFO L443 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 96 158) no Hoare annotation was computed. [2019-10-02 11:43:02,375 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 147) no Hoare annotation was computed. [2019-10-02 11:43:02,375 INFO L443 ceAbstractionStarter]: For program point L117-2(lines 109 157) no Hoare annotation was computed. [2019-10-02 11:43:02,375 INFO L439 ceAbstractionStarter]: At program point L140(line 140) the Hoare annotation is: (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse12 (= FlQueueIrpToThread_~status~0 0)) (.cse7 (= 0 ~pended~0)) (.cse8 (<= (+ FlQueueIrpToThread_~status~0 1073741823) 0)) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (<= 6 ~MPR3~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse9 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= 0 |old(~pended~0)|))) (.cse13 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8) .cse9 .cse10 .cse11 (not (<= |old(~PagingReferenceCount~0)| 1)) (not (< 0 |old(~PagingReferenceCount~0)|)) (and .cse7 .cse12) .cse13 (not (= ~customIrp~0 0))) (let ((.cse14 (<= ~PagingReferenceCount~0 1)) (.cse15 (< 0 ~PagingReferenceCount~0))) (or .cse0 .cse1 (and .cse7 .cse14 .cse12 .cse15) (and .cse7 .cse14 .cse8 .cse15) .cse2 .cse3 (not (<= |old(~PagingReferenceCount~0)| 0)) .cse4 .cse5 (not (<= 0 |old(~PagingReferenceCount~0)|)) .cse6 .cse9 .cse10 .cse11 .cse13)))) [2019-10-02 11:43:02,375 INFO L443 ceAbstractionStarter]: For program point L140-1(line 140) no Hoare annotation was computed. [2019-10-02 11:43:02,375 INFO L439 ceAbstractionStarter]: At program point L138(lines 138 139) the Hoare annotation is: (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse1 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (<= 6 ~MPR3~0))) (.cse5 (= 0 ~pended~0)) (.cse6 (not (= ~s~0 ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= |old(~PagingReferenceCount~0)| 1)) (not (< 0 |old(~PagingReferenceCount~0)|)) .cse11 (not (= ~customIrp~0 0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~PagingReferenceCount~0)| 0)) .cse4 (and .cse5 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse6 (not (<= 0 |old(~PagingReferenceCount~0)|)) .cse7 .cse8 .cse9 .cse10 .cse11))) [2019-10-02 11:43:02,376 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 138 139) no Hoare annotation was computed. [2019-10-02 11:43:02,376 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1010) no Hoare annotation was computed. [2019-10-02 11:43:02,376 INFO L439 ceAbstractionStarter]: At program point L989(lines 988 1011) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse5 (not (= 0 ~pended~0))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse9 (not (<= ~MPR3~0 6))) (.cse10 (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse5) .cse1 .cse2 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) .cse6 .cse7)) (.cse12 (not (<= ~PagingReferenceCount~0 1))) (.cse13 (not (<= 6 ~MPR3~0))) (.cse14 (not (< 0 ~PagingReferenceCount~0))) (.cse11 (let ((.cse15 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse15) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse15 1) 0) (= ~setEventCalled~0 1)))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse8 (= ~SKIP1~0 ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 (not (= ~customIrp~0 0))) (or (= ~myStatus~0 259) (not (<= ~MaximumInterfaceType~0 0)) (or .cse9 .cse10 .cse12 .cse13 .cse14) .cse11) (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7)))) [2019-10-02 11:43:02,376 INFO L439 ceAbstractionStarter]: At program point L981(line 981) the Hoare annotation is: (let ((.cse6 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse11 (not (= 0 ~pended~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse12 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse13 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse1 (not (<= ~MPR3~0 6))) (.cse2 (or .cse6 (or (not (= |old(~s~0)| ~NP~0)) .cse11) .cse7 .cse8 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) .cse12 .cse13)) (.cse3 (not (<= ~PagingReferenceCount~0 1))) (.cse0 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 |old(~s~0)|) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (= ~setEventCalled~0 1)))) (.cse4 (not (<= 6 ~MPR3~0))) (.cse5 (not (< 0 ~PagingReferenceCount~0))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 (= ~myStatus~0 259) (not (<= ~MaximumInterfaceType~0 0)) (or .cse1 .cse2 .cse3 .cse4 .cse5)) (or .cse1 .cse2 (not (= ~myStatus~0 0)) .cse3 .cse0 .cse4 .cse5 (not (= ~customIrp~0 0))) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse6 (not (= 1 ~pended~0)) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13)))) [2019-10-02 11:43:02,377 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 985) no Hoare annotation was computed. [2019-10-02 11:43:02,377 INFO L443 ceAbstractionStarter]: For program point L973-1(lines 973 985) no Hoare annotation was computed. [2019-10-02 11:43:02,377 INFO L439 ceAbstractionStarter]: At program point L994(lines 993 1010) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse5 (not (= 0 ~pended~0))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse9 (not (<= ~MPR3~0 6))) (.cse10 (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse5) .cse1 .cse2 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) .cse6 .cse7)) (.cse12 (not (<= ~PagingReferenceCount~0 1))) (.cse13 (not (<= 6 ~MPR3~0))) (.cse14 (not (< 0 ~PagingReferenceCount~0))) (.cse11 (let ((.cse15 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse15) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse15 1) 0) (= ~setEventCalled~0 1)))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse8 (= ~SKIP1~0 ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 (not (= ~customIrp~0 0))) (or (= ~myStatus~0 259) (not (<= ~MaximumInterfaceType~0 0)) (or .cse9 .cse10 .cse12 .cse13 .cse14) .cse11) (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7)))) [2019-10-02 11:43:02,377 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 965 1037) the Hoare annotation is: (let ((.cse6 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse11 (not (= 0 ~pended~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse12 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse13 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse1 (not (<= ~MPR3~0 6))) (.cse2 (or .cse6 (or (not (= |old(~s~0)| ~NP~0)) .cse11) .cse7 .cse8 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) .cse12 .cse13)) (.cse0 (= ~s~0 |old(~s~0)|)) (.cse3 (not (<= ~PagingReferenceCount~0 1))) (.cse4 (not (<= 6 ~MPR3~0))) (.cse5 (not (< 0 ~PagingReferenceCount~0))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse14 (= ~SKIP1~0 ~s~0))) (and (or (= ~myStatus~0 259) (not (<= ~MaximumInterfaceType~0 0)) .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse2 (not (= ~myStatus~0 0)) .cse0 .cse3 .cse4 .cse5 (not (= ~customIrp~0 0))) (or .cse6 (not (= 1 ~pended~0)) .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse13)))) [2019-10-02 11:43:02,378 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 965 1037) no Hoare annotation was computed. [2019-10-02 11:43:02,378 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1033) no Hoare annotation was computed. [2019-10-02 11:43:02,378 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 965 1037) no Hoare annotation was computed. [2019-10-02 11:43:02,378 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 983) no Hoare annotation was computed. [2019-10-02 11:43:02,378 INFO L439 ceAbstractionStarter]: At program point L1008(lines 972 1036) the Hoare annotation is: (let ((.cse19 (<= (+ ~DC~0 5) ~IPC~0)) (.cse22 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse18 (= 0 ~pended~0)) (.cse17 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse27 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse16 (= ~s~0 ~MPR1~0)) (.cse23 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse27) 3221225494))) (.cse24 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse25 (<= (+ .cse27 1) 0)) (.cse26 (= ~setEventCalled~0 1)) (.cse7 (not .cse17)) (.cse12 (not .cse18)) (.cse8 (not .cse22)) (.cse9 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse21 (<= 1 ~compRegistered~0)) (.cse13 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse14 (not .cse19))) (let ((.cse2 (not (<= ~MPR3~0 6))) (.cse3 (or .cse7 (or (not (= |old(~s~0)| ~NP~0)) .cse12) .cse8 .cse9 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not .cse21) .cse13 .cse14)) (.cse1 (and .cse16 (= 259 IofCallDriver_~returnVal2~0) .cse23 .cse24 .cse25 .cse26)) (.cse0 (and (let ((.cse20 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)))) (or (and .cse16 (and .cse17 .cse18 .cse19 .cse20 (= 0 IofCallDriver_~returnVal2~0) .cse21) .cse22) (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse21))) .cse23 .cse24 .cse25 .cse26)) (.cse4 (not (<= ~PagingReferenceCount~0 1))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (< 0 ~PagingReferenceCount~0))) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse15 (= ~SKIP1~0 ~s~0))) (and (or .cse0 (= ~myStatus~0 259) (not (<= ~MaximumInterfaceType~0 0)) .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6)) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse2 .cse3 .cse1 .cse0 (not (= ~myStatus~0 0)) .cse4 .cse5 .cse6 (not (= ~customIrp~0 0))) (or .cse7 (not (= 1 ~pended~0)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse14))))) [2019-10-02 11:43:02,379 INFO L439 ceAbstractionStarter]: At program point L975(line 975) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse5 (not (= 0 ~pended~0))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse9 (not (<= ~MPR3~0 6))) (.cse10 (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse5) .cse1 .cse2 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) .cse6 .cse7)) (.cse8 (= ~s~0 |old(~s~0)|)) (.cse11 (not (<= ~PagingReferenceCount~0 1))) (.cse12 (not (<= 6 ~MPR3~0))) (.cse13 (not (< 0 ~PagingReferenceCount~0))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (= ~myStatus~0 259) (not (<= ~MaximumInterfaceType~0 0)) .cse8 (or .cse9 .cse10 .cse11 .cse12 .cse13)) (or .cse9 .cse10 (not (= ~myStatus~0 0)) .cse8 .cse11 .cse12 .cse13 (not (= ~customIrp~0 0))) (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7)))) [2019-10-02 11:43:02,379 INFO L443 ceAbstractionStarter]: For program point L975-1(line 975) no Hoare annotation was computed. [2019-10-02 11:43:02,379 INFO L439 ceAbstractionStarter]: At program point L996(lines 995 1010) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse5 (not (= 0 ~pended~0))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse9 (not (<= ~MPR3~0 6))) (.cse10 (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse5) .cse1 .cse2 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) .cse6 .cse7)) (.cse12 (not (<= ~PagingReferenceCount~0 1))) (.cse13 (not (<= 6 ~MPR3~0))) (.cse14 (not (< 0 ~PagingReferenceCount~0))) (.cse11 (let ((.cse15 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse15) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse15 1) 0) (= ~setEventCalled~0 1)))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse8 (= ~SKIP1~0 ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11 (not (= ~myStatus~0 0)) .cse12 .cse13 .cse14 (not (= ~customIrp~0 0))) (or (= ~myStatus~0 259) (not (<= ~MaximumInterfaceType~0 0)) (or .cse9 .cse10 .cse12 .cse13 .cse14) .cse11) (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7)))) [2019-10-02 11:43:02,379 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1032) no Hoare annotation was computed. [2019-10-02 11:43:02,379 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1011) no Hoare annotation was computed. [2019-10-02 11:43:02,380 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1023) no Hoare annotation was computed. [2019-10-02 11:43:02,380 INFO L439 ceAbstractionStarter]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse5 (not (= 0 ~pended~0))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse8 (not (<= ~MPR3~0 6))) (.cse9 (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse5) .cse1 .cse2 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) .cse6 .cse7)) (.cse10 (not (<= ~PagingReferenceCount~0 1))) (.cse11 (not (<= 6 ~MPR3~0))) (.cse12 (not (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 (not (= ~myStatus~0 0)) .cse10 .cse11 .cse12 (not (= ~customIrp~0 0))) (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (or (= ~myStatus~0 259) (not (<= ~MaximumInterfaceType~0 0)) (or .cse8 .cse9 .cse10 .cse11 .cse12))))) [2019-10-02 11:43:02,380 INFO L443 ceAbstractionStarter]: For program point L1030-1(lines 1012 1034) no Hoare annotation was computed. [2019-10-02 11:43:02,380 INFO L439 ceAbstractionStarter]: At program point L1307(line 1307) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,380 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1286) no Hoare annotation was computed. [2019-10-02 11:43:02,380 INFO L443 ceAbstractionStarter]: For program point L1307-1(line 1307) no Hoare annotation was computed. [2019-10-02 11:43:02,380 INFO L443 ceAbstractionStarter]: For program point L1274-2(lines 1273 1562) no Hoare annotation was computed. [2019-10-02 11:43:02,381 INFO L439 ceAbstractionStarter]: At program point L1514(line 1514) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,381 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 1510 1516) no Hoare annotation was computed. [2019-10-02 11:43:02,381 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1531) no Hoare annotation was computed. [2019-10-02 11:43:02,381 INFO L439 ceAbstractionStarter]: At program point L1316(lines 1315 1549) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,381 INFO L439 ceAbstractionStarter]: At program point L1399(lines 1389 1529) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,381 INFO L443 ceAbstractionStarter]: For program point L1424(lines 1424 1427) no Hoare annotation was computed. [2019-10-02 11:43:02,382 INFO L439 ceAbstractionStarter]: At program point L1292(line 1292) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,382 INFO L443 ceAbstractionStarter]: For program point L1292-1(line 1292) no Hoare annotation was computed. [2019-10-02 11:43:02,382 INFO L439 ceAbstractionStarter]: At program point L1449(line 1449) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,382 INFO L443 ceAbstractionStarter]: For program point L1449-1(line 1449) no Hoare annotation was computed. [2019-10-02 11:43:02,382 INFO L439 ceAbstractionStarter]: At program point L1383(lines 1375 1533) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,382 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1533) no Hoare annotation was computed. [2019-10-02 11:43:02,383 INFO L443 ceAbstractionStarter]: For program point L1433(lines 1433 1437) no Hoare annotation was computed. [2019-10-02 11:43:02,383 INFO L439 ceAbstractionStarter]: At program point L1301(line 1301) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,383 INFO L439 ceAbstractionStarter]: At program point L1557(line 1557) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse1 (and .cse0 (= 0 ~pended~0) .cse2 .cse3))) (or (not (<= ~MPR3~0 6)) (not .cse0) (and .cse1 (<= (+ FloppyDeviceControl_~ntStatus~3 1073741811) 0)) (and (= 1 ~pended~0) .cse2) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not .cse3) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (and .cse1 (not (= FloppyDeviceControl_~ntStatus~3 259)) (= FloppyDeviceControl_~ntStatus~3 FloppyDeviceControl_~__cil_tmp91~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))))) [2019-10-02 11:43:02,383 INFO L443 ceAbstractionStarter]: For program point L1301-1(lines 1297 1303) no Hoare annotation was computed. [2019-10-02 11:43:02,383 INFO L443 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 1182 1563) no Hoare annotation was computed. [2019-10-02 11:43:02,383 INFO L439 ceAbstractionStarter]: At program point L1483(lines 1347 1541) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,383 INFO L443 ceAbstractionStarter]: For program point L1475(lines 1475 1478) no Hoare annotation was computed. [2019-10-02 11:43:02,384 INFO L443 ceAbstractionStarter]: For program point L1467(lines 1467 1480) no Hoare annotation was computed. [2019-10-02 11:43:02,384 INFO L443 ceAbstractionStarter]: For program point L1368(lines 1368 1535) no Hoare annotation was computed. [2019-10-02 11:43:02,384 INFO L439 ceAbstractionStarter]: At program point L1525(lines 1400 1526) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 1 ~pended~0) .cse0) (and (not (= FloppyDeviceControl_~ntStatus~3 259)) (= 0 ~pended~0) .cse0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)))) [2019-10-02 11:43:02,384 INFO L443 ceAbstractionStarter]: For program point L1451(lines 1451 1454) no Hoare annotation was computed. [2019-10-02 11:43:02,384 INFO L443 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 1182 1563) no Hoare annotation was computed. [2019-10-02 11:43:02,384 INFO L443 ceAbstractionStarter]: For program point L1410(lines 1410 1414) no Hoare annotation was computed. [2019-10-02 11:43:02,384 INFO L439 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 1182 1563) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,384 INFO L443 ceAbstractionStarter]: For program point L1361(lines 1361 1537) no Hoare annotation was computed. [2019-10-02 11:43:02,385 INFO L443 ceAbstractionStarter]: For program point L1320(lines 1320 1547) no Hoare annotation was computed. [2019-10-02 11:43:02,385 INFO L443 ceAbstractionStarter]: For program point L1279(lines 1279 1284) no Hoare annotation was computed. [2019-10-02 11:43:02,385 INFO L443 ceAbstractionStarter]: For program point L1502(lines 1502 1504) no Hoare annotation was computed. [2019-10-02 11:43:02,385 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1497) no Hoare annotation was computed. [2019-10-02 11:43:02,385 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1481) no Hoare annotation was computed. [2019-10-02 11:43:02,385 INFO L443 ceAbstractionStarter]: For program point L1329(lines 1329 1545) no Hoare annotation was computed. [2019-10-02 11:43:02,385 INFO L443 ceAbstractionStarter]: For program point L1296(lines 1296 1310) no Hoare annotation was computed. [2019-10-02 11:43:02,385 INFO L439 ceAbstractionStarter]: At program point L1321(lines 1320 1547) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,385 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1543) no Hoare annotation was computed. [2019-10-02 11:43:02,386 INFO L443 ceAbstractionStarter]: For program point L1462(lines 1462 1465) no Hoare annotation was computed. [2019-10-02 11:43:02,386 INFO L443 ceAbstractionStarter]: For program point L1396(lines 1396 1527) no Hoare annotation was computed. [2019-10-02 11:43:02,386 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1303) no Hoare annotation was computed. [2019-10-02 11:43:02,386 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1559) no Hoare annotation was computed. [2019-10-02 11:43:02,386 INFO L439 ceAbstractionStarter]: At program point L1520(lines 1520 1521) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,386 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 1553 1559) no Hoare annotation was computed. [2019-10-02 11:43:02,386 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 1520 1521) no Hoare annotation was computed. [2019-10-02 11:43:02,386 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1541) no Hoare annotation was computed. [2019-10-02 11:43:02,387 INFO L439 ceAbstractionStarter]: At program point L1281(line 1281) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,387 INFO L443 ceAbstractionStarter]: For program point L1281-1(line 1281) no Hoare annotation was computed. [2019-10-02 11:43:02,387 INFO L443 ceAbstractionStarter]: For program point L1471(lines 1471 1479) no Hoare annotation was computed. [2019-10-02 11:43:02,387 INFO L439 ceAbstractionStarter]: At program point L1339(lines 1329 1545) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,387 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-10-02 11:43:02,387 INFO L443 ceAbstractionStarter]: For program point L1389(lines 1389 1529) no Hoare annotation was computed. [2019-10-02 11:43:02,387 INFO L443 ceAbstractionStarter]: For program point L1356(lines 1356 1539) no Hoare annotation was computed. [2019-10-02 11:43:02,387 INFO L443 ceAbstractionStarter]: For program point L1315(lines 1315 1549) no Hoare annotation was computed. [2019-10-02 11:43:02,387 INFO L443 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 1564 1580) no Hoare annotation was computed. [2019-10-02 11:43:02,388 INFO L443 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 1564 1580) no Hoare annotation was computed. [2019-10-02 11:43:02,388 INFO L446 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 1564 1580) the Hoare annotation is: true [2019-10-02 11:43:02,388 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1577) no Hoare annotation was computed. [2019-10-02 11:43:02,388 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1578) no Hoare annotation was computed. [2019-10-02 11:43:02,388 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:43:02,388 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) [2019-10-02 11:43:02,388 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:43:02,388 INFO L439 ceAbstractionStarter]: At program point L1598(line 1598) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,388 INFO L443 ceAbstractionStarter]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2019-10-02 11:43:02,389 INFO L443 ceAbstractionStarter]: For program point L1590(lines 1590 1592) no Hoare annotation was computed. [2019-10-02 11:43:02,389 INFO L443 ceAbstractionStarter]: For program point L1590-2(lines 1588 1619) no Hoare annotation was computed. [2019-10-02 11:43:02,389 INFO L439 ceAbstractionStarter]: At program point L1613(line 1613) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,389 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 1609 1615) no Hoare annotation was computed. [2019-10-02 11:43:02,389 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1615) no Hoare annotation was computed. [2019-10-02 11:43:02,389 INFO L443 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 1581 1620) no Hoare annotation was computed. [2019-10-02 11:43:02,389 INFO L439 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 1581 1620) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-02 11:43:02,389 INFO L443 ceAbstractionStarter]: For program point L1601(lines 1601 1603) no Hoare annotation was computed. [2019-10-02 11:43:02,390 INFO L443 ceAbstractionStarter]: For program point L1601-2(lines 1601 1603) no Hoare annotation was computed. [2019-10-02 11:43:02,390 INFO L443 ceAbstractionStarter]: For program point L1593-1(lines 1593 1617) no Hoare annotation was computed. [2019-10-02 11:43:02,390 INFO L443 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 1581 1620) no Hoare annotation was computed. [2019-10-02 11:43:02,390 INFO L439 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: (let ((.cse1 (= ~setEventCalled~0 1)) (.cse0 (= FlFdcDeviceIo_~__cil_tmp11~0 259))) (or (= ~myStatus~0 259) (and .cse0 (= ~s~0 ~NP~0) .cse1) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse1) .cse0))) [2019-10-02 11:43:02,390 INFO L443 ceAbstractionStarter]: For program point L638-1(line 638) no Hoare annotation was computed. [2019-10-02 11:43:02,390 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 641) no Hoare annotation was computed. [2019-10-02 11:43:02,390 INFO L439 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 611 645) the Hoare annotation is: (or (= ~myStatus~0 259) (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,391 INFO L443 ceAbstractionStarter]: For program point L636-2(lines 636 641) no Hoare annotation was computed. [2019-10-02 11:43:02,391 INFO L439 ceAbstractionStarter]: At program point L632(line 632) the Hoare annotation is: (or (= ~s~0 |old(~s~0)|) (= ~myStatus~0 259) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,391 INFO L443 ceAbstractionStarter]: For program point L632-1(line 632) no Hoare annotation was computed. [2019-10-02 11:43:02,391 INFO L443 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 611 645) no Hoare annotation was computed. [2019-10-02 11:43:02,391 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 628) no Hoare annotation was computed. [2019-10-02 11:43:02,391 INFO L439 ceAbstractionStarter]: At program point L623(lines 623 624) the Hoare annotation is: (or (= ~myStatus~0 259) (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-02 11:43:02,391 INFO L443 ceAbstractionStarter]: For program point L623-1(lines 623 624) no Hoare annotation was computed. [2019-10-02 11:43:02,391 INFO L443 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 611 645) no Hoare annotation was computed. [2019-10-02 11:43:02,392 INFO L443 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 89 95) no Hoare annotation was computed. [2019-10-02 11:43:02,392 INFO L446 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 89 95) the Hoare annotation is: true [2019-10-02 11:43:02,392 INFO L443 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 89 95) no Hoare annotation was computed. [2019-10-02 11:43:02,392 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:43:02,392 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (= ~s~0 ~IPC~0) (= ~myStatus~0 0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~DC~0) (= 0 ~customIrp~0) (<= ~PagingReferenceCount~0 0) (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~s~0 ~SKIP2~0) (<= 0 ~PagingReferenceCount~0) (<= ~MaximumInterfaceType~0 0) (= ~SKIP1~0 ~s~0)) [2019-10-02 11:43:02,392 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:43:02,392 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:43:02,392 INFO L446 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 864 884) the Hoare annotation is: true [2019-10-02 11:43:02,393 INFO L443 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 864 884) no Hoare annotation was computed. [2019-10-02 11:43:02,393 INFO L446 ceAbstractionStarter]: At program point L873(lines 872 882) the Hoare annotation is: true [2019-10-02 11:43:02,393 INFO L443 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 864 884) no Hoare annotation was computed. [2019-10-02 11:43:02,393 INFO L446 ceAbstractionStarter]: At program point L871(lines 870 882) the Hoare annotation is: true [2019-10-02 11:43:02,393 INFO L443 ceAbstractionStarter]: For program point L870(lines 870 882) no Hoare annotation was computed. [2019-10-02 11:43:02,393 INFO L446 ceAbstractionStarter]: At program point L896(lines 895 905) the Hoare annotation is: true [2019-10-02 11:43:02,393 INFO L446 ceAbstractionStarter]: At program point L894(lines 893 905) the Hoare annotation is: true [2019-10-02 11:43:02,393 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 905) no Hoare annotation was computed. [2019-10-02 11:43:02,393 INFO L443 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 885 907) no Hoare annotation was computed. [2019-10-02 11:43:02,393 INFO L446 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 885 907) the Hoare annotation is: true [2019-10-02 11:43:02,394 INFO L443 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 885 907) no Hoare annotation was computed. [2019-10-02 11:43:02,394 INFO L446 ceAbstractionStarter]: At program point L1153(lines 1152 1164) the Hoare annotation is: true [2019-10-02 11:43:02,394 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1164) no Hoare annotation was computed. [2019-10-02 11:43:02,394 INFO L446 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1146 1166) the Hoare annotation is: true [2019-10-02 11:43:02,394 INFO L443 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1146 1166) no Hoare annotation was computed. [2019-10-02 11:43:02,394 INFO L446 ceAbstractionStarter]: At program point L1155(lines 1154 1164) the Hoare annotation is: true [2019-10-02 11:43:02,394 INFO L443 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1146 1166) no Hoare annotation was computed. [2019-10-02 11:43:02,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:43:02 BoogieIcfgContainer [2019-10-02 11:43:02,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:43:02,487 INFO L168 Benchmark]: Toolchain (without parser) took 66902.65 ms. Allocated memory was 140.0 MB in the beginning and 941.1 MB in the end (delta: 801.1 MB). Free memory was 86.0 MB in the beginning and 801.3 MB in the end (delta: -715.3 MB). Peak memory consumption was 794.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:43:02,487 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:43:02,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.60 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 85.7 MB in the beginning and 162.2 MB in the end (delta: -76.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:43:02,488 INFO L168 Benchmark]: Boogie Preprocessor took 138.60 ms. Allocated memory is still 200.3 MB. Free memory was 162.2 MB in the beginning and 157.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:43:02,489 INFO L168 Benchmark]: RCFGBuilder took 1684.78 ms. Allocated memory was 200.3 MB in the beginning and 224.9 MB in the end (delta: 24.6 MB). Free memory was 157.7 MB in the beginning and 156.8 MB in the end (delta: 954.5 kB). Peak memory consumption was 88.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:43:02,490 INFO L168 Benchmark]: TraceAbstraction took 64293.73 ms. Allocated memory was 224.9 MB in the beginning and 941.1 MB in the end (delta: 716.2 MB). Free memory was 156.8 MB in the beginning and 801.3 MB in the end (delta: -644.5 MB). Peak memory consumption was 780.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:43:02,492 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.24 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.60 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 85.7 MB in the beginning and 162.2 MB in the end (delta: -76.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.60 ms. Allocated memory is still 200.3 MB. Free memory was 162.2 MB in the beginning and 157.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1684.78 ms. Allocated memory was 200.3 MB in the beginning and 224.9 MB in the end (delta: 24.6 MB). Free memory was 157.7 MB in the beginning and 156.8 MB in the end (delta: 954.5 kB). Peak memory consumption was 88.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64293.73 ms. Allocated memory was 224.9 MB in the beginning and 941.1 MB in the end (delta: 716.2 MB). Free memory was 156.8 MB in the beginning and 801.3 MB in the end (delta: -644.5 MB). Peak memory consumption was 780.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1626]: 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: 744]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && !(259 == myStatus)) && PagingReferenceCount <= 0) && NP + 4 <= MPR1) && status == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= PagingReferenceCount) && MPR3 <= 6) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 1320]: Loop Invariant Derived loop invariant: ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || (0 == pended && s == NP)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) || \old(myStatus) == 259) || !(MaximumInterfaceType <= 0)) || ((((s == NP && 1 <= compRegistered) && !(ntStatus == 259)) && myStatus == \old(myStatus)) && 0 <= InterfaceType) - InvariantResult [Line: 729]: Loop Invariant Derived loop invariant: (((((((((((((((((status == 0 && 0 == pended) && s == NP) && 0 == compRegistered) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 938]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((\old(myStatus) == 259 || !(MaximumInterfaceType <= 0)) || (((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && s == \old(s)) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount)) || ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 917]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 797]: Loop Invariant Derived loop invariant: (((((((((((((((((((((SKIP2 <= s && (NP + DC + 7 <= IPC + SKIP1 && (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) || (DC + 5 <= IPC && (NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == DC))) && SKIP1 + 2 <= MPR1) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || ((DC + 5 <= IPC && (NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == DC) && !(status == 259))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) || (DC + 5 <= IPC && (NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == DC)) && status == 0)) || !(0 <= \old(PagingReferenceCount))) || (status == 0 && s == DC)) || !(\old(compRegistered) == 0)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) || (DC + 5 <= IPC && (NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == DC)) && NP + DC + 7 <= IPC + SKIP1) && !(status == 259))) || ((NP + DC + 7 <= IPC + SKIP1 && DC + 7 <= s) && (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) || (DC + 5 <= IPC && (NP + 5 <= MPR3 && DC + 2 <= SKIP2) && s == DC)))) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || (((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: ((((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || SKIP1 == s) && (((((((!(MPR3 <= 6) || ((((((!(NP + 5 <= MPR3) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || !(myStatus == 0)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(customIrp == 0))) && (((myStatus == 259 || !(MaximumInterfaceType <= 0)) || (((!(MPR3 <= 6) || ((((((!(NP + 5 <= MPR3) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1))) && ((((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || SKIP1 == s) || !(DC + 5 <= IPC)) - InvariantResult [Line: 851]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && setEventCalled == 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && setEventCalled == 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp)) || ((((((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || myStatus == 259) || !(MaximumInterfaceType <= 0)) && ((((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || s == \old(s)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC))) && ((((!(MPR3 <= 6) || (s == \old(s) && \old(customIrp) == customIrp)) || !(6 <= MPR3)) || (((((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) && ((((((((((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(NP + 5 <= MPR3)) || !(myStatus == 0)) || (((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && setEventCalled == 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) && (((((((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || !(6 <= MPR3)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(s) <= MPR3)) || (s == NP && \old(customIrp) == customIrp)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) || !(MPR3 <= \old(s)))) && ((((s == NP && \old(customIrp) == customIrp) || myStatus == 259) || (((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(s) <= MPR3)) || !(NP + 4 <= MPR1)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(MPR3 <= \old(s))) || !(MaximumInterfaceType <= 0)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((((s == NP && 1 <= compRegistered) && !(ntStatus == 259)) && myStatus == \old(myStatus)) || ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) || \old(myStatus) == 259) || !(MaximumInterfaceType <= 0) - InvariantResult [Line: 1347]: Loop Invariant Derived loop invariant: ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || (((0 == pended && s == \old(s)) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount)) || !(DC + 5 <= IPC) - InvariantResult [Line: 1131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1389]: Loop Invariant Derived loop invariant: ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || (0 == pended && s == \old(s))) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && s == \old(s)) && 0 == ntStatus) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) || \old(myStatus) == 259) || !(MaximumInterfaceType <= 0)) || ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 739]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && PagingReferenceCount <= 0) && NP + 4 <= MPR1) && status == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= PagingReferenceCount) && MPR3 <= 6) && 6 <= MPR3)) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 5 <= MPR3) || !(1 == pended)) || s == \old(s)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) && ((myStatus == 259 || (((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(s) <= MPR3)) || !(NP + 4 <= MPR1)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(MPR3 <= \old(s))) || !(MaximumInterfaceType <= 0))) && ((((((((((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(NP + 5 <= MPR3)) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || ((s == \old(s) && \old(customIrp) == customIrp) && setEventCalled == 1)) || !(\old(customIrp) == 0))) && ((((((((((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || myStatus == 259) || !(MaximumInterfaceType <= 0)) || ((s == \old(s) && \old(customIrp) == customIrp) && setEventCalled == 1))) && ((((!(MPR3 <= 6) || (s == \old(s) && \old(customIrp) == customIrp)) || !(6 <= MPR3)) || (((((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) && ((((((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || !(6 <= MPR3)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(s) <= MPR3)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) || !(MPR3 <= \old(s))) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((\old(myStatus) == 259 || ((0 == pended && 0 == compRegistered) && s == \old(s))) || !(MaximumInterfaceType <= 0)) || ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 872]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: ((((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || SKIP1 == s) && (((((((!(MPR3 <= 6) || ((((((!(NP + 5 <= MPR3) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || !(myStatus == 0)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(customIrp == 0))) && (((myStatus == 259 || !(MaximumInterfaceType <= 0)) || (((!(MPR3 <= 6) || ((((((!(NP + 5 <= MPR3) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1))) && ((((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || SKIP1 == s) || !(DC + 5 <= IPC)) - InvariantResult [Line: 746]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || !(\old(s) == \old(NP))) || 0 <= status) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 221]: Loop Invariant Derived loop invariant: ((\old(myStatus) == 259 || ((0 == pended && 0 == compRegistered) && s == \old(s))) || !(MaximumInterfaceType <= 0)) || ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((((((s == MPR1 && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && 0 == returnVal2) && 1 <= compRegistered) && SKIP1 + 2 <= MPR1) || (((((((s == MPR1 && NP + 5 <= MPR3) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1) || myStatus == 259) || !(MaximumInterfaceType <= 0)) || (((((s == MPR1 && 259 == returnVal2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || (((!(MPR3 <= 6) || ((((((!(NP + 5 <= MPR3) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) && ((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || SKIP1 == s)) && ((((((((!(MPR3 <= 6) || ((((((!(NP + 5 <= MPR3) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || (((((s == MPR1 && 259 == returnVal2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || (((((((s == MPR1 && ((((NP + 5 <= MPR3 && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && 0 == returnVal2) && 1 <= compRegistered) && SKIP1 + 2 <= MPR1) || (((((((s == MPR1 && NP + 5 <= MPR3) && 0 == pended) && DC + 5 <= IPC) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered)) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || !(myStatus == 0)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(customIrp == 0))) && ((((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || SKIP1 == s) || !(DC + 5 <= IPC)) - InvariantResult [Line: 1152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 787]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || ((s == SKIP2 && NP + DC + 7 <= IPC + SKIP1 && (((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) && SKIP1 + 2 <= MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (1 == pended && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || (status == 0 && s == DC)) || !(\old(compRegistered) == 0)) || ((((((status == lowerDriverReturn && s == IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && compRegistered <= 0)) || ((((((status == lowerDriverReturn && s == IPC) && status == 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) && !(status == 259))) || (((status == lowerDriverReturn && s == SKIP2) && SKIP1 + 2 <= MPR1) && (((DC + 5 <= IPC && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && compRegistered <= 0)) || (((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || (((((((status == lowerDriverReturn && s == IPC) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && !(status == 259)) && compRegistered <= 0)) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 915]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1315]: Loop Invariant Derived loop invariant: ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || (0 == pended && s == NP)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || (((((((status == lowerDriverReturn && s == IPC) && status == 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s == DC)) || (((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || (((((((1 == pended && s == SKIP2) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && s == IPC) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && !(status == 259)) && compRegistered <= 0)) || ((((((((status == lowerDriverReturn && s == SKIP2) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((status == lowerDriverReturn && s == IPC) && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s == DC) && !(status == 259))) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || ((status == 0 && 0 == pended) && s == DC)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 936]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 734]: Loop Invariant Derived loop invariant: (((((((((((((((((status == 0 && 0 == pended) && s == NP) && 0 == compRegistered) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 895]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 779]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((1 == pended && s == SKIP2) && NP + 5 <= MPR3) && DC + 5 <= IPC) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || (((((((status == lowerDriverReturn && s == IPC) && status == 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s == DC)) || !(\old(s) == \old(DC))) || (((((s == IPC && 1 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2)) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && s == IPC) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && !(status == 259)) && compRegistered <= 0)) || ((((((((status == lowerDriverReturn && s == SKIP2) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((status == lowerDriverReturn && s == IPC) && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s == DC) && !(status == 259))) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || ((status == 0 && 0 == pended) && s == DC)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 1400]: Loop Invariant Derived loop invariant: (((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || (1 == pended && s == NP)) || ((!(ntStatus == 259) && 0 == pended) && s == NP)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: ((((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || SKIP1 == s) && (((((((!(MPR3 <= 6) || ((((((!(NP + 5 <= MPR3) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || !(myStatus == 0)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(customIrp == 0))) && (((myStatus == 259 || !(MaximumInterfaceType <= 0)) || (((!(MPR3 <= 6) || ((((((!(NP + 5 <= MPR3) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1))) && ((((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || SKIP1 == s) || !(DC + 5 <= IPC)) - InvariantResult [Line: 849]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1089]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && setEventCalled == 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && setEventCalled == 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp)) || ((((((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || myStatus == 259) || !(MaximumInterfaceType <= 0)) && ((((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || s == \old(s)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC))) && ((((!(MPR3 <= 6) || (s == \old(s) && \old(customIrp) == customIrp)) || !(6 <= MPR3)) || (((((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) && ((((((((((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(NP + 5 <= MPR3)) || !(myStatus == 0)) || (((((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && setEventCalled == 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) && (((((((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || !(6 <= MPR3)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(s) <= MPR3)) || (s == NP && \old(customIrp) == customIrp)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) || !(MPR3 <= \old(s)))) && ((((s == NP && \old(customIrp) == customIrp) || myStatus == 259) || (((((((((!(\old(setEventCalled) == 1) || !(MPR3 <= 6)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(s) <= MPR3)) || !(NP + 4 <= MPR1)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(MPR3 <= \old(s))) || !(MaximumInterfaceType <= 0)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((myStatus == 0 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && s == \old(s)) && 0 == ntStatus) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) || \old(myStatus) == 259) || !(MaximumInterfaceType <= 0)) || ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ((\old(myStatus) == 259 || ((0 == pended && 0 == compRegistered) && s == \old(s))) || !(MaximumInterfaceType <= 0)) || ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1329]: Loop Invariant Derived loop invariant: ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || (((0 == pended && s == \old(s)) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount)) || !(DC + 5 <= IPC) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((((((((s == IPC && 0 == pended) && lowerDriverReturn == ntStatus) && IPC + SKIP1 <= s + \old(s)) && compRegistered <= 0) || ((1 == pended && s == NP) && 0 == compRegistered)) || !(MaximumInterfaceType <= 0)) || ((1 == pended && 0 == compRegistered) && s == DC)) || ((s == IPC && 1 == pended) && 0 == compRegistered)) || \old(myStatus) == 259) || (ntStatus + 1073741823 <= 0 && (((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s == DC)) || ((1 == pended && s == SKIP2) && 0 == compRegistered)) || (((s == SKIP2 && 0 == pended) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) || (!(259 == ntStatus) && (PagingReferenceCount <= 1 && (((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s == DC) && 0 < PagingReferenceCount) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1375]: Loop Invariant Derived loop invariant: ((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || (0 == pended && s == NP)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: (((((((((((((((!(MPR3 <= 6) || !(NP + 5 <= MPR3)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) || \old(myStatus) == 259) || !(MaximumInterfaceType <= 0)) || (((0 < ntStatus + 1 && (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && ntStatus == \old(myStatus)) && myStatus == \old(myStatus)) || ((ntStatus == 0 && (((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && NP + DC + 7 <= IPC + SKIP1) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && myStatus == \old(myStatus)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 392 locations, 1 error locations. SAFE Result, 64.1s OverallTime, 66 OverallIterations, 2 TraceHistogramMax, 20.9s AutomataDifference, 0.0s DeadEndRemovalTime, 31.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 26659 SDtfs, 13185 SDslu, 88808 SDs, 0 SdLazy, 15454 SolverSat, 2181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 942 GetRequests, 466 SyntacticMatches, 11 SemanticMatches, 465 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=915occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 66 MinimizatonAttempts, 2201 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 142 LocationsWithAnnotation, 2292 PreInvPairs, 2571 NumberOfFragments, 15765 HoareAnnotationTreeSize, 2292 FomulaSimplifications, 790288 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 142 FomulaSimplificationsInter, 310092 FormulaSimplificationTreeSizeReductionInter, 29.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 5010 NumberOfCodeBlocks, 5010 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 4942 ConstructedInterpolants, 0 QuantifiedInterpolants, 777502 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2489 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 68 InterpolantComputations, 66 PerfectInterpolantSequences, 329/335 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...