./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c23505adeafc05501dae695d01ba5b7f16426196 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:34:29,512 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:34:29,513 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:34:29,521 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:34:29,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:34:29,521 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:34:29,522 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:34:29,524 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:34:29,525 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:34:29,525 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:34:29,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:34:29,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:34:29,527 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:34:29,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:34:29,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:34:29,529 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:34:29,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:34:29,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:34:29,533 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:34:29,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:34:29,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:34:29,536 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:34:29,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:34:29,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:34:29,538 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:34:29,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:34:29,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:34:29,540 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:34:29,541 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:34:29,542 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:34:29,542 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:34:29,543 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:34:29,543 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:34:29,543 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:34:29,544 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:34:29,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:34:29,545 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 13:34:29,553 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:34:29,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:34:29,554 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:34:29,554 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 13:34:29,554 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:34:29,555 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:34:29,555 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:34:29,555 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:34:29,555 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:34:29,555 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:34:29,555 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:34:29,555 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:34:29,556 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:34:29,556 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:34:29,556 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:34:29,556 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:34:29,556 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:34:29,556 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:34:29,556 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:34:29,557 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:34:29,557 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:34:29,557 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:34:29,557 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:34:29,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:34:29,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:34:29,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:34:29,558 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:34:29,558 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:34:29,558 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:34:29,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:34:29,558 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c23505adeafc05501dae695d01ba5b7f16426196 [2018-11-18 13:34:29,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:34:29,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:34:29,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:34:29,593 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:34:29,593 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:34:29,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 13:34:29,629 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/data/c4a863851/00f8f8dac14d4c2eae5865f126601825/FLAG01f9c1d7c [2018-11-18 13:34:30,086 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:34:30,087 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 13:34:30,095 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/data/c4a863851/00f8f8dac14d4c2eae5865f126601825/FLAG01f9c1d7c [2018-11-18 13:34:30,105 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/data/c4a863851/00f8f8dac14d4c2eae5865f126601825 [2018-11-18 13:34:30,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:34:30,108 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 13:34:30,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:34:30,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:34:30,111 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:34:30,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:34:30" (1/1) ... [2018-11-18 13:34:30,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d699e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:30, skipping insertion in model container [2018-11-18 13:34:30,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:34:30" (1/1) ... [2018-11-18 13:34:30,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:34:30,151 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:34:30,346 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:34:30,350 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:34:30,410 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:34:30,424 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:34:30,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:30 WrapperNode [2018-11-18 13:34:30,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:34:30,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:34:30,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:34:30,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:34:30,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:30" (1/1) ... [2018-11-18 13:34:30,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:30" (1/1) ... [2018-11-18 13:34:30,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:30" (1/1) ... [2018-11-18 13:34:30,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:30" (1/1) ... [2018-11-18 13:34:30,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:30" (1/1) ... [2018-11-18 13:34:30,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:30" (1/1) ... [2018-11-18 13:34:30,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:30" (1/1) ... [2018-11-18 13:34:30,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:34:30,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:34:30,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:34:30,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:34:30,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/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 [2018-11-18 13:34:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:34:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:34:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 13:34:30,573 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 13:34:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-18 13:34:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-18 13:34:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-18 13:34:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-18 13:34:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-18 13:34:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-18 13:34:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2018-11-18 13:34:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 13:34:30,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:34:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-18 13:34:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-18 13:34:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-18 13:34:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-18 13:34:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-18 13:34:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 13:34:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 13:34:30,575 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 13:34:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 13:34:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 13:34:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-18 13:34:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-18 13:34:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-18 13:34:30,576 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-11-18 13:34:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 13:34:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-18 13:34:30,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 13:34:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-18 13:34:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-18 13:34:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-18 13:34:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-18 13:34:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-18 13:34:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-18 13:34:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-18 13:34:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-18 13:34:30,577 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-18 13:34:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-18 13:34:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-18 13:34:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-18 13:34:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-18 13:34:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 13:34:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 13:34:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 13:34:30,578 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-18 13:34:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-18 13:34:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-18 13:34:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 13:34:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 13:34:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 13:34:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2018-11-18 13:34:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 13:34:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:34:30,579 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 13:34:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-11-18 13:34:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:34:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:34:30,722 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:30,723 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:30,766 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:30,766 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:30,786 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:30,786 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:30,930 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:30,931 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:30,997 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:30,998 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:31,060 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:31,060 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:31,064 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:31,065 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:31,071 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:31,071 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:31,125 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:31,126 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:31,155 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:31,155 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:31,158 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:31,159 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:31,182 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 13:34:31,182 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 13:34:31,192 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:34:31,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:34:31 BoogieIcfgContainer [2018-11-18 13:34:31,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:34:31,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:34:31,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:34:31,196 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:34:31,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:34:30" (1/3) ... [2018-11-18 13:34:31,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333c7864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:34:31, skipping insertion in model container [2018-11-18 13:34:31,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:34:30" (2/3) ... [2018-11-18 13:34:31,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333c7864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:34:31, skipping insertion in model container [2018-11-18 13:34:31,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:34:31" (3/3) ... [2018-11-18 13:34:31,199 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl3_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 13:34:31,206 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:34:31,211 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 13:34:31,221 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 13:34:31,244 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:34:31,244 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:34:31,244 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:34:31,244 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:34:31,244 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:34:31,245 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:34:31,245 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:34:31,245 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:34:31,245 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:34:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states. [2018-11-18 13:34:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 13:34:31,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:31,269 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:34:31,271 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:31,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash 389940294, now seen corresponding path program 1 times [2018-11-18 13:34:31,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:31,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:31,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:31,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:31,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:31,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:31,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:31,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:31,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:31,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:31,442 INFO L87 Difference]: Start difference. First operand 305 states. Second operand 3 states. [2018-11-18 13:34:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:31,505 INFO L93 Difference]: Finished difference Result 510 states and 729 transitions. [2018-11-18 13:34:31,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:31,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 13:34:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:31,516 INFO L225 Difference]: With dead ends: 510 [2018-11-18 13:34:31,517 INFO L226 Difference]: Without dead ends: 293 [2018-11-18 13:34:31,520 INFO L604 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 [2018-11-18 13:34:31,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-18 13:34:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-11-18 13:34:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-18 13:34:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 386 transitions. [2018-11-18 13:34:31,564 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 386 transitions. Word has length 20 [2018-11-18 13:34:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:31,565 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 386 transitions. [2018-11-18 13:34:31,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 386 transitions. [2018-11-18 13:34:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 13:34:31,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:31,567 INFO L375 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] [2018-11-18 13:34:31,568 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:31,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:31,568 INFO L82 PathProgramCache]: Analyzing trace with hash -623477071, now seen corresponding path program 1 times [2018-11-18 13:34:31,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:31,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:31,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:31,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:31,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:31,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:31,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:34:31,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:34:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:34:31,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:34:31,690 INFO L87 Difference]: Start difference. First operand 293 states and 386 transitions. Second operand 4 states. [2018-11-18 13:34:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:31,917 INFO L93 Difference]: Finished difference Result 768 states and 1007 transitions. [2018-11-18 13:34:31,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:34:31,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-18 13:34:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:31,921 INFO L225 Difference]: With dead ends: 768 [2018-11-18 13:34:31,921 INFO L226 Difference]: Without dead ends: 496 [2018-11-18 13:34:31,923 INFO L604 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 [2018-11-18 13:34:31,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-11-18 13:34:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 382. [2018-11-18 13:34:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-18 13:34:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 498 transitions. [2018-11-18 13:34:31,958 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 498 transitions. Word has length 28 [2018-11-18 13:34:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:31,959 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 498 transitions. [2018-11-18 13:34:31,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:34:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 498 transitions. [2018-11-18 13:34:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 13:34:31,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:31,960 INFO L375 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] [2018-11-18 13:34:31,960 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:31,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:31,960 INFO L82 PathProgramCache]: Analyzing trace with hash 185869555, now seen corresponding path program 1 times [2018-11-18 13:34:31,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:31,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:31,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:31,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:31,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:32,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:32,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:32,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:32,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:32,046 INFO L87 Difference]: Start difference. First operand 382 states and 498 transitions. Second operand 3 states. [2018-11-18 13:34:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:32,142 INFO L93 Difference]: Finished difference Result 699 states and 920 transitions. [2018-11-18 13:34:32,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:32,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 13:34:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:32,145 INFO L225 Difference]: With dead ends: 699 [2018-11-18 13:34:32,145 INFO L226 Difference]: Without dead ends: 537 [2018-11-18 13:34:32,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-11-18 13:34:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 520. [2018-11-18 13:34:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-18 13:34:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 678 transitions. [2018-11-18 13:34:32,173 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 678 transitions. Word has length 28 [2018-11-18 13:34:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:32,173 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 678 transitions. [2018-11-18 13:34:32,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 678 transitions. [2018-11-18 13:34:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 13:34:32,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:32,175 INFO L375 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] [2018-11-18 13:34:32,175 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:32,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1014591332, now seen corresponding path program 1 times [2018-11-18 13:34:32,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:32,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:32,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:32,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:32,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:32,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:32,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:32,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:32,240 INFO L87 Difference]: Start difference. First operand 520 states and 678 transitions. Second operand 3 states. [2018-11-18 13:34:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:32,292 INFO L93 Difference]: Finished difference Result 1036 states and 1364 transitions. [2018-11-18 13:34:32,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:32,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 13:34:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:32,308 INFO L225 Difference]: With dead ends: 1036 [2018-11-18 13:34:32,308 INFO L226 Difference]: Without dead ends: 735 [2018-11-18 13:34:32,309 INFO L604 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 [2018-11-18 13:34:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-11-18 13:34:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 704. [2018-11-18 13:34:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-11-18 13:34:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 930 transitions. [2018-11-18 13:34:32,350 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 930 transitions. Word has length 30 [2018-11-18 13:34:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:32,350 INFO L480 AbstractCegarLoop]: Abstraction has 704 states and 930 transitions. [2018-11-18 13:34:32,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 930 transitions. [2018-11-18 13:34:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 13:34:32,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:32,351 INFO L375 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] [2018-11-18 13:34:32,351 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:32,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:32,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2072536077, now seen corresponding path program 1 times [2018-11-18 13:34:32,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:32,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:32,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:32,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:32,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:32,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:32,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:32,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:32,411 INFO L87 Difference]: Start difference. First operand 704 states and 930 transitions. Second operand 3 states. [2018-11-18 13:34:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:32,464 INFO L93 Difference]: Finished difference Result 850 states and 1113 transitions. [2018-11-18 13:34:32,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:32,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 13:34:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:32,468 INFO L225 Difference]: With dead ends: 850 [2018-11-18 13:34:32,468 INFO L226 Difference]: Without dead ends: 832 [2018-11-18 13:34:32,468 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2018-11-18 13:34:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 787. [2018-11-18 13:34:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-11-18 13:34:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1036 transitions. [2018-11-18 13:34:32,504 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1036 transitions. Word has length 34 [2018-11-18 13:34:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:32,504 INFO L480 AbstractCegarLoop]: Abstraction has 787 states and 1036 transitions. [2018-11-18 13:34:32,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1036 transitions. [2018-11-18 13:34:32,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 13:34:32,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:32,507 INFO L375 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] [2018-11-18 13:34:32,507 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:32,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1100436901, now seen corresponding path program 1 times [2018-11-18 13:34:32,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:32,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:32,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:32,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:32,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:32,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:32,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:32,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:32,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:32,544 INFO L87 Difference]: Start difference. First operand 787 states and 1036 transitions. Second operand 3 states. [2018-11-18 13:34:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:32,646 INFO L93 Difference]: Finished difference Result 1186 states and 1587 transitions. [2018-11-18 13:34:32,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:32,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-18 13:34:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:32,651 INFO L225 Difference]: With dead ends: 1186 [2018-11-18 13:34:32,652 INFO L226 Difference]: Without dead ends: 1183 [2018-11-18 13:34:32,652 INFO L604 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 [2018-11-18 13:34:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-11-18 13:34:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 916. [2018-11-18 13:34:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-11-18 13:34:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1213 transitions. [2018-11-18 13:34:32,698 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1213 transitions. Word has length 41 [2018-11-18 13:34:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:32,698 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1213 transitions. [2018-11-18 13:34:32,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1213 transitions. [2018-11-18 13:34:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:34:32,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:32,700 INFO L375 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] [2018-11-18 13:34:32,700 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:32,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:32,700 INFO L82 PathProgramCache]: Analyzing trace with hash -857484701, now seen corresponding path program 1 times [2018-11-18 13:34:32,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:32,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:32,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:32,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:32,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:32,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:32,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:32,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:32,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:32,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:32,757 INFO L87 Difference]: Start difference. First operand 916 states and 1213 transitions. Second operand 3 states. [2018-11-18 13:34:32,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:32,851 INFO L93 Difference]: Finished difference Result 931 states and 1233 transitions. [2018-11-18 13:34:32,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:32,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 13:34:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:32,856 INFO L225 Difference]: With dead ends: 931 [2018-11-18 13:34:32,856 INFO L226 Difference]: Without dead ends: 928 [2018-11-18 13:34:32,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-11-18 13:34:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 927. [2018-11-18 13:34:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-11-18 13:34:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1225 transitions. [2018-11-18 13:34:32,902 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1225 transitions. Word has length 40 [2018-11-18 13:34:32,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:32,902 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 1225 transitions. [2018-11-18 13:34:32,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1225 transitions. [2018-11-18 13:34:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 13:34:32,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:32,904 INFO L375 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] [2018-11-18 13:34:32,904 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:32,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:32,905 INFO L82 PathProgramCache]: Analyzing trace with hash -620618778, now seen corresponding path program 1 times [2018-11-18 13:34:32,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:32,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:32,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:32,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:32,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:32,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:32,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:32,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:32,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:32,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:32,950 INFO L87 Difference]: Start difference. First operand 927 states and 1225 transitions. Second operand 3 states. [2018-11-18 13:34:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:33,038 INFO L93 Difference]: Finished difference Result 963 states and 1267 transitions. [2018-11-18 13:34:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:33,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-18 13:34:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:33,042 INFO L225 Difference]: With dead ends: 963 [2018-11-18 13:34:33,043 INFO L226 Difference]: Without dead ends: 958 [2018-11-18 13:34:33,043 INFO L604 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 [2018-11-18 13:34:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2018-11-18 13:34:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 956. [2018-11-18 13:34:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2018-11-18 13:34:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1260 transitions. [2018-11-18 13:34:33,084 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1260 transitions. Word has length 41 [2018-11-18 13:34:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:33,084 INFO L480 AbstractCegarLoop]: Abstraction has 956 states and 1260 transitions. [2018-11-18 13:34:33,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1260 transitions. [2018-11-18 13:34:33,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 13:34:33,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:33,086 INFO L375 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] [2018-11-18 13:34:33,086 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:33,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:33,086 INFO L82 PathProgramCache]: Analyzing trace with hash 8364565, now seen corresponding path program 1 times [2018-11-18 13:34:33,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:33,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:33,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:33,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:33,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:33,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:33,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:34:33,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:34:33,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:34:33,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:34:33,154 INFO L87 Difference]: Start difference. First operand 956 states and 1260 transitions. Second operand 5 states. [2018-11-18 13:34:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:33,560 INFO L93 Difference]: Finished difference Result 1754 states and 2297 transitions. [2018-11-18 13:34:33,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:34:33,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-18 13:34:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:33,564 INFO L225 Difference]: With dead ends: 1754 [2018-11-18 13:34:33,564 INFO L226 Difference]: Without dead ends: 1125 [2018-11-18 13:34:33,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:34:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-11-18 13:34:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 941. [2018-11-18 13:34:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-11-18 13:34:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1225 transitions. [2018-11-18 13:34:33,595 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1225 transitions. Word has length 42 [2018-11-18 13:34:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:33,596 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 1225 transitions. [2018-11-18 13:34:33,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:34:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1225 transitions. [2018-11-18 13:34:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 13:34:33,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:33,597 INFO L375 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] [2018-11-18 13:34:33,597 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:33,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:33,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1607436299, now seen corresponding path program 1 times [2018-11-18 13:34:33,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:33,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:33,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:33,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:33,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:33,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:33,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:34:33,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:34:33,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:34:33,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:34:33,650 INFO L87 Difference]: Start difference. First operand 941 states and 1225 transitions. Second operand 5 states. [2018-11-18 13:34:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:33,845 INFO L93 Difference]: Finished difference Result 949 states and 1231 transitions. [2018-11-18 13:34:33,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:34:33,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-18 13:34:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:33,848 INFO L225 Difference]: With dead ends: 949 [2018-11-18 13:34:33,848 INFO L226 Difference]: Without dead ends: 943 [2018-11-18 13:34:33,849 INFO L604 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 [2018-11-18 13:34:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-11-18 13:34:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2018-11-18 13:34:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-11-18 13:34:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1224 transitions. [2018-11-18 13:34:33,880 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1224 transitions. Word has length 42 [2018-11-18 13:34:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:33,881 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 1224 transitions. [2018-11-18 13:34:33,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:34:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1224 transitions. [2018-11-18 13:34:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 13:34:33,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:33,882 INFO L375 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] [2018-11-18 13:34:33,882 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:33,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash 848689715, now seen corresponding path program 1 times [2018-11-18 13:34:33,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:33,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:33,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:33,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:33,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:33,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:33,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:34:33,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:34:33,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:34:33,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:34:33,935 INFO L87 Difference]: Start difference. First operand 941 states and 1224 transitions. Second operand 5 states. [2018-11-18 13:34:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:34,127 INFO L93 Difference]: Finished difference Result 949 states and 1230 transitions. [2018-11-18 13:34:34,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:34:34,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-18 13:34:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:34,131 INFO L225 Difference]: With dead ends: 949 [2018-11-18 13:34:34,131 INFO L226 Difference]: Without dead ends: 943 [2018-11-18 13:34:34,131 INFO L604 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 [2018-11-18 13:34:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-11-18 13:34:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2018-11-18 13:34:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-11-18 13:34:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1223 transitions. [2018-11-18 13:34:34,165 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1223 transitions. Word has length 43 [2018-11-18 13:34:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:34,165 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 1223 transitions. [2018-11-18 13:34:34,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:34:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1223 transitions. [2018-11-18 13:34:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 13:34:34,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:34,167 INFO L375 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] [2018-11-18 13:34:34,167 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:34,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash 623352158, now seen corresponding path program 1 times [2018-11-18 13:34:34,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:34,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:34,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:34,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:34,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:34,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:34:34,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:34:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:34:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:34:34,209 INFO L87 Difference]: Start difference. First operand 941 states and 1223 transitions. Second operand 5 states. [2018-11-18 13:34:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:34,276 INFO L93 Difference]: Finished difference Result 957 states and 1238 transitions. [2018-11-18 13:34:34,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:34:34,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 13:34:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:34,279 INFO L225 Difference]: With dead ends: 957 [2018-11-18 13:34:34,279 INFO L226 Difference]: Without dead ends: 939 [2018-11-18 13:34:34,279 INFO L604 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 [2018-11-18 13:34:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-11-18 13:34:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2018-11-18 13:34:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-11-18 13:34:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1219 transitions. [2018-11-18 13:34:34,314 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1219 transitions. Word has length 44 [2018-11-18 13:34:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:34,314 INFO L480 AbstractCegarLoop]: Abstraction has 939 states and 1219 transitions. [2018-11-18 13:34:34,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:34:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1219 transitions. [2018-11-18 13:34:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 13:34:34,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:34,315 INFO L375 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] [2018-11-18 13:34:34,316 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:34,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash 813408991, now seen corresponding path program 1 times [2018-11-18 13:34:34,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:34,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:34,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:34,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:34:34,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:34:34,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:34:34,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:34:34,373 INFO L87 Difference]: Start difference. First operand 939 states and 1219 transitions. Second operand 4 states. [2018-11-18 13:34:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:34,482 INFO L93 Difference]: Finished difference Result 1023 states and 1300 transitions. [2018-11-18 13:34:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:34:34,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-18 13:34:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:34,485 INFO L225 Difference]: With dead ends: 1023 [2018-11-18 13:34:34,485 INFO L226 Difference]: Without dead ends: 686 [2018-11-18 13:34:34,486 INFO L604 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 [2018-11-18 13:34:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-11-18 13:34:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 649. [2018-11-18 13:34:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-11-18 13:34:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 810 transitions. [2018-11-18 13:34:34,509 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 810 transitions. Word has length 49 [2018-11-18 13:34:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:34,509 INFO L480 AbstractCegarLoop]: Abstraction has 649 states and 810 transitions. [2018-11-18 13:34:34,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:34:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 810 transitions. [2018-11-18 13:34:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 13:34:34,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:34,510 INFO L375 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] [2018-11-18 13:34:34,510 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:34,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1482929009, now seen corresponding path program 1 times [2018-11-18 13:34:34,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:34,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:34,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:34,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:34,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:34,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:34,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:34,544 INFO L87 Difference]: Start difference. First operand 649 states and 810 transitions. Second operand 3 states. [2018-11-18 13:34:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:34,605 INFO L93 Difference]: Finished difference Result 920 states and 1160 transitions. [2018-11-18 13:34:34,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:34,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-18 13:34:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:34,607 INFO L225 Difference]: With dead ends: 920 [2018-11-18 13:34:34,607 INFO L226 Difference]: Without dead ends: 657 [2018-11-18 13:34:34,608 INFO L604 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 [2018-11-18 13:34:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-18 13:34:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2018-11-18 13:34:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-18 13:34:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 821 transitions. [2018-11-18 13:34:34,631 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 821 transitions. Word has length 55 [2018-11-18 13:34:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:34,631 INFO L480 AbstractCegarLoop]: Abstraction has 657 states and 821 transitions. [2018-11-18 13:34:34,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 821 transitions. [2018-11-18 13:34:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 13:34:34,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:34,632 INFO L375 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] [2018-11-18 13:34:34,632 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:34,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash 304104361, now seen corresponding path program 1 times [2018-11-18 13:34:34,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:34,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:34,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:34,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:34,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:34,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:34,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:34,657 INFO L87 Difference]: Start difference. First operand 657 states and 821 transitions. Second operand 3 states. [2018-11-18 13:34:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:34,754 INFO L93 Difference]: Finished difference Result 862 states and 1092 transitions. [2018-11-18 13:34:34,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:34,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-18 13:34:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:34,757 INFO L225 Difference]: With dead ends: 862 [2018-11-18 13:34:34,757 INFO L226 Difference]: Without dead ends: 854 [2018-11-18 13:34:34,757 INFO L604 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 [2018-11-18 13:34:34,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-18 13:34:34,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 723. [2018-11-18 13:34:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-11-18 13:34:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 901 transitions. [2018-11-18 13:34:34,785 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 901 transitions. Word has length 52 [2018-11-18 13:34:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:34,785 INFO L480 AbstractCegarLoop]: Abstraction has 723 states and 901 transitions. [2018-11-18 13:34:34,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 901 transitions. [2018-11-18 13:34:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 13:34:34,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:34,786 INFO L375 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] [2018-11-18 13:34:34,787 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:34,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:34,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1289177234, now seen corresponding path program 1 times [2018-11-18 13:34:34,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:34,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:34,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:34,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:34,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:34,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 13:34:34,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 13:34:34,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:34:34,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:34:34,840 INFO L87 Difference]: Start difference. First operand 723 states and 901 transitions. Second operand 8 states. [2018-11-18 13:34:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:34,912 INFO L93 Difference]: Finished difference Result 1155 states and 1466 transitions. [2018-11-18 13:34:34,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:34:34,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-18 13:34:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:34,915 INFO L225 Difference]: With dead ends: 1155 [2018-11-18 13:34:34,915 INFO L226 Difference]: Without dead ends: 809 [2018-11-18 13:34:34,916 INFO L604 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 [2018-11-18 13:34:34,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-11-18 13:34:34,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 770. [2018-11-18 13:34:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-11-18 13:34:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 972 transitions. [2018-11-18 13:34:34,943 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 972 transitions. Word has length 53 [2018-11-18 13:34:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:34,944 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 972 transitions. [2018-11-18 13:34:34,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 13:34:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 972 transitions. [2018-11-18 13:34:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 13:34:34,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:34,945 INFO L375 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] [2018-11-18 13:34:34,945 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:34,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1289454064, now seen corresponding path program 1 times [2018-11-18 13:34:34,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:34,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:34,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:34,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:34,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:34,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 13:34:34,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 13:34:34,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:34:34,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:34:34,997 INFO L87 Difference]: Start difference. First operand 770 states and 972 transitions. Second operand 8 states. [2018-11-18 13:34:35,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:35,116 INFO L93 Difference]: Finished difference Result 800 states and 1006 transitions. [2018-11-18 13:34:35,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:34:35,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-18 13:34:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:35,119 INFO L225 Difference]: With dead ends: 800 [2018-11-18 13:34:35,119 INFO L226 Difference]: Without dead ends: 784 [2018-11-18 13:34:35,120 INFO L604 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 [2018-11-18 13:34:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-11-18 13:34:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 776. [2018-11-18 13:34:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-18 13:34:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 977 transitions. [2018-11-18 13:34:35,146 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 977 transitions. Word has length 53 [2018-11-18 13:34:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:35,147 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 977 transitions. [2018-11-18 13:34:35,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 13:34:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 977 transitions. [2018-11-18 13:34:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 13:34:35,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:35,148 INFO L375 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] [2018-11-18 13:34:35,148 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:35,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash 590651548, now seen corresponding path program 1 times [2018-11-18 13:34:35,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:35,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:35,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:35,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:35,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:35,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:35,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:34:35,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:34:35,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:34:35,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:34:35,254 INFO L87 Difference]: Start difference. First operand 776 states and 977 transitions. Second operand 5 states. [2018-11-18 13:34:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:35,286 INFO L93 Difference]: Finished difference Result 1033 states and 1307 transitions. [2018-11-18 13:34:35,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:34:35,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-18 13:34:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:35,288 INFO L225 Difference]: With dead ends: 1033 [2018-11-18 13:34:35,289 INFO L226 Difference]: Without dead ends: 757 [2018-11-18 13:34:35,289 INFO L604 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 [2018-11-18 13:34:35,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-11-18 13:34:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2018-11-18 13:34:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-11-18 13:34:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 947 transitions. [2018-11-18 13:34:35,316 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 947 transitions. Word has length 61 [2018-11-18 13:34:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:35,316 INFO L480 AbstractCegarLoop]: Abstraction has 757 states and 947 transitions. [2018-11-18 13:34:35,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:34:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 947 transitions. [2018-11-18 13:34:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 13:34:35,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:35,317 INFO L375 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] [2018-11-18 13:34:35,317 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:35,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:35,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1122241232, now seen corresponding path program 1 times [2018-11-18 13:34:35,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:35,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:35,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:35,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:35,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:34:35,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 13:34:35,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:34:35,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:34:35,374 INFO L87 Difference]: Start difference. First operand 757 states and 947 transitions. Second operand 7 states. [2018-11-18 13:34:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:35,761 INFO L93 Difference]: Finished difference Result 902 states and 1123 transitions. [2018-11-18 13:34:35,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:34:35,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-18 13:34:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:35,764 INFO L225 Difference]: With dead ends: 902 [2018-11-18 13:34:35,764 INFO L226 Difference]: Without dead ends: 776 [2018-11-18 13:34:35,765 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:34:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-11-18 13:34:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 730. [2018-11-18 13:34:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-18 13:34:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 904 transitions. [2018-11-18 13:34:35,797 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 904 transitions. Word has length 54 [2018-11-18 13:34:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:35,797 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 904 transitions. [2018-11-18 13:34:35,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 13:34:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 904 transitions. [2018-11-18 13:34:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 13:34:35,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:35,798 INFO L375 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] [2018-11-18 13:34:35,799 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:35,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash -978961874, now seen corresponding path program 1 times [2018-11-18 13:34:35,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:35,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:35,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:35,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:35,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:35,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:35,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:35,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:35,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:35,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:35,824 INFO L87 Difference]: Start difference. First operand 730 states and 904 transitions. Second operand 3 states. [2018-11-18 13:34:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:35,891 INFO L93 Difference]: Finished difference Result 750 states and 924 transitions. [2018-11-18 13:34:35,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:35,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-18 13:34:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:35,894 INFO L225 Difference]: With dead ends: 750 [2018-11-18 13:34:35,894 INFO L226 Difference]: Without dead ends: 725 [2018-11-18 13:34:35,894 INFO L604 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 [2018-11-18 13:34:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-11-18 13:34:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 715. [2018-11-18 13:34:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-11-18 13:34:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 883 transitions. [2018-11-18 13:34:35,928 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 883 transitions. Word has length 54 [2018-11-18 13:34:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:35,929 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 883 transitions. [2018-11-18 13:34:35,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 883 transitions. [2018-11-18 13:34:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 13:34:35,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:35,930 INFO L375 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] [2018-11-18 13:34:35,930 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:35,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:35,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1138330026, now seen corresponding path program 1 times [2018-11-18 13:34:35,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:35,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:35,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:35,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:36,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:36,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:34:36,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:34:36,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:34:36,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:34:36,003 INFO L87 Difference]: Start difference. First operand 715 states and 883 transitions. Second operand 9 states. [2018-11-18 13:34:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:37,011 INFO L93 Difference]: Finished difference Result 975 states and 1200 transitions. [2018-11-18 13:34:37,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 13:34:37,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-18 13:34:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:37,016 INFO L225 Difference]: With dead ends: 975 [2018-11-18 13:34:37,017 INFO L226 Difference]: Without dead ends: 887 [2018-11-18 13:34:37,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-18 13:34:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-11-18 13:34:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 764. [2018-11-18 13:34:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-11-18 13:34:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 936 transitions. [2018-11-18 13:34:37,069 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 936 transitions. Word has length 54 [2018-11-18 13:34:37,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:37,070 INFO L480 AbstractCegarLoop]: Abstraction has 764 states and 936 transitions. [2018-11-18 13:34:37,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:34:37,070 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 936 transitions. [2018-11-18 13:34:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 13:34:37,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:37,071 INFO L375 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] [2018-11-18 13:34:37,071 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:37,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash -347220682, now seen corresponding path program 1 times [2018-11-18 13:34:37,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:37,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:37,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:37,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:37,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:37,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:37,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:34:37,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:34:37,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:34:37,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:34:37,131 INFO L87 Difference]: Start difference. First operand 764 states and 936 transitions. Second operand 6 states. [2018-11-18 13:34:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:37,204 INFO L93 Difference]: Finished difference Result 783 states and 954 transitions. [2018-11-18 13:34:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:34:37,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-18 13:34:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:37,209 INFO L225 Difference]: With dead ends: 783 [2018-11-18 13:34:37,209 INFO L226 Difference]: Without dead ends: 730 [2018-11-18 13:34:37,209 INFO L604 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 [2018-11-18 13:34:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-11-18 13:34:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2018-11-18 13:34:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-18 13:34:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 894 transitions. [2018-11-18 13:34:37,257 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 894 transitions. Word has length 57 [2018-11-18 13:34:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:37,257 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 894 transitions. [2018-11-18 13:34:37,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:34:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 894 transitions. [2018-11-18 13:34:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 13:34:37,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:37,258 INFO L375 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] [2018-11-18 13:34:37,259 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:37,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:37,259 INFO L82 PathProgramCache]: Analyzing trace with hash -498405519, now seen corresponding path program 1 times [2018-11-18 13:34:37,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:37,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:37,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:37,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:37,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:37,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:37,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:34:37,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:34:37,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:34:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:34:37,311 INFO L87 Difference]: Start difference. First operand 730 states and 894 transitions. Second operand 5 states. [2018-11-18 13:34:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:37,631 INFO L93 Difference]: Finished difference Result 742 states and 905 transitions. [2018-11-18 13:34:37,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:34:37,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-11-18 13:34:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:37,633 INFO L225 Difference]: With dead ends: 742 [2018-11-18 13:34:37,633 INFO L226 Difference]: Without dead ends: 724 [2018-11-18 13:34:37,634 INFO L604 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 [2018-11-18 13:34:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-11-18 13:34:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 713. [2018-11-18 13:34:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 13:34:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 869 transitions. [2018-11-18 13:34:37,663 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 869 transitions. Word has length 56 [2018-11-18 13:34:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:37,663 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 869 transitions. [2018-11-18 13:34:37,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:34:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 869 transitions. [2018-11-18 13:34:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 13:34:37,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:37,664 INFO L375 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] [2018-11-18 13:34:37,664 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:37,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:37,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1271479197, now seen corresponding path program 1 times [2018-11-18 13:34:37,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:37,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:37,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:37,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:37,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:37,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:37,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:34:37,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:34:37,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:34:37,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:34:37,717 INFO L87 Difference]: Start difference. First operand 713 states and 869 transitions. Second operand 5 states. [2018-11-18 13:34:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:37,895 INFO L93 Difference]: Finished difference Result 974 states and 1199 transitions. [2018-11-18 13:34:37,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:34:37,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-18 13:34:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:37,898 INFO L225 Difference]: With dead ends: 974 [2018-11-18 13:34:37,898 INFO L226 Difference]: Without dead ends: 713 [2018-11-18 13:34:37,899 INFO L604 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 [2018-11-18 13:34:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-11-18 13:34:37,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2018-11-18 13:34:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 13:34:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 867 transitions. [2018-11-18 13:34:37,928 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 867 transitions. Word has length 65 [2018-11-18 13:34:37,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:37,928 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 867 transitions. [2018-11-18 13:34:37,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:34:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 867 transitions. [2018-11-18 13:34:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 13:34:37,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:37,930 INFO L375 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] [2018-11-18 13:34:37,930 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:37,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:37,931 INFO L82 PathProgramCache]: Analyzing trace with hash 378535424, now seen corresponding path program 1 times [2018-11-18 13:34:37,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:37,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:37,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:37,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:37,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:37,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:37,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:37,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:37,956 INFO L87 Difference]: Start difference. First operand 713 states and 867 transitions. Second operand 3 states. [2018-11-18 13:34:38,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:38,002 INFO L93 Difference]: Finished difference Result 1020 states and 1257 transitions. [2018-11-18 13:34:38,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:38,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-18 13:34:38,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:38,005 INFO L225 Difference]: With dead ends: 1020 [2018-11-18 13:34:38,005 INFO L226 Difference]: Without dead ends: 759 [2018-11-18 13:34:38,006 INFO L604 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 [2018-11-18 13:34:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-11-18 13:34:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 713. [2018-11-18 13:34:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 13:34:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 867 transitions. [2018-11-18 13:34:38,035 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 867 transitions. Word has length 68 [2018-11-18 13:34:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:38,036 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 867 transitions. [2018-11-18 13:34:38,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 867 transitions. [2018-11-18 13:34:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 13:34:38,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:38,037 INFO L375 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] [2018-11-18 13:34:38,037 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:38,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:38,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1922396608, now seen corresponding path program 1 times [2018-11-18 13:34:38,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:38,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:38,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:38,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:38,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:38,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:38,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:34:38,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:34:38,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:34:38,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:34:38,100 INFO L87 Difference]: Start difference. First operand 713 states and 867 transitions. Second operand 6 states. [2018-11-18 13:34:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:38,160 INFO L93 Difference]: Finished difference Result 988 states and 1210 transitions. [2018-11-18 13:34:38,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:34:38,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-18 13:34:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:38,163 INFO L225 Difference]: With dead ends: 988 [2018-11-18 13:34:38,163 INFO L226 Difference]: Without dead ends: 760 [2018-11-18 13:34:38,164 INFO L604 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 [2018-11-18 13:34:38,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-11-18 13:34:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 713. [2018-11-18 13:34:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 13:34:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 865 transitions. [2018-11-18 13:34:38,194 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 865 transitions. Word has length 68 [2018-11-18 13:34:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:38,195 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 865 transitions. [2018-11-18 13:34:38,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:34:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 865 transitions. [2018-11-18 13:34:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 13:34:38,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:38,196 INFO L375 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] [2018-11-18 13:34:38,196 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:38,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:38,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1912744495, now seen corresponding path program 1 times [2018-11-18 13:34:38,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:38,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:38,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:38,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:38,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:38,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:38,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:34:38,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:34:38,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:34:38,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:34:38,255 INFO L87 Difference]: Start difference. First operand 713 states and 865 transitions. Second operand 9 states. [2018-11-18 13:34:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:38,369 INFO L93 Difference]: Finished difference Result 730 states and 881 transitions. [2018-11-18 13:34:38,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:34:38,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-11-18 13:34:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:38,372 INFO L225 Difference]: With dead ends: 730 [2018-11-18 13:34:38,372 INFO L226 Difference]: Without dead ends: 709 [2018-11-18 13:34:38,373 INFO L604 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 [2018-11-18 13:34:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-11-18 13:34:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2018-11-18 13:34:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2018-11-18 13:34:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 859 transitions. [2018-11-18 13:34:38,401 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 859 transitions. Word has length 60 [2018-11-18 13:34:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:38,402 INFO L480 AbstractCegarLoop]: Abstraction has 709 states and 859 transitions. [2018-11-18 13:34:38,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:34:38,403 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 859 transitions. [2018-11-18 13:34:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 13:34:38,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:38,404 INFO L375 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] [2018-11-18 13:34:38,404 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:38,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:38,404 INFO L82 PathProgramCache]: Analyzing trace with hash -987867067, now seen corresponding path program 1 times [2018-11-18 13:34:38,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:38,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:38,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:38,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:38,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:34:38,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:34:38,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:34:38,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:34:38,458 INFO L87 Difference]: Start difference. First operand 709 states and 859 transitions. Second operand 9 states. [2018-11-18 13:34:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:38,590 INFO L93 Difference]: Finished difference Result 726 states and 875 transitions. [2018-11-18 13:34:38,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:34:38,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-18 13:34:38,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:38,592 INFO L225 Difference]: With dead ends: 726 [2018-11-18 13:34:38,592 INFO L226 Difference]: Without dead ends: 704 [2018-11-18 13:34:38,593 INFO L604 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 [2018-11-18 13:34:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-11-18 13:34:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2018-11-18 13:34:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-11-18 13:34:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 852 transitions. [2018-11-18 13:34:38,622 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 852 transitions. Word has length 61 [2018-11-18 13:34:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:38,622 INFO L480 AbstractCegarLoop]: Abstraction has 704 states and 852 transitions. [2018-11-18 13:34:38,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:34:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 852 transitions. [2018-11-18 13:34:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 13:34:38,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:38,624 INFO L375 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] [2018-11-18 13:34:38,624 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:38,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:38,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1917978537, now seen corresponding path program 1 times [2018-11-18 13:34:38,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:38,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:38,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:38,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:38,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:38,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:38,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:34:38,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:34:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:34:38,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:34:38,683 INFO L87 Difference]: Start difference. First operand 704 states and 852 transitions. Second operand 9 states. [2018-11-18 13:34:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:38,814 INFO L93 Difference]: Finished difference Result 721 states and 868 transitions. [2018-11-18 13:34:38,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:34:38,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-18 13:34:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:38,818 INFO L225 Difference]: With dead ends: 721 [2018-11-18 13:34:38,818 INFO L226 Difference]: Without dead ends: 700 [2018-11-18 13:34:38,819 INFO L604 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 [2018-11-18 13:34:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-11-18 13:34:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2018-11-18 13:34:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-11-18 13:34:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 846 transitions. [2018-11-18 13:34:38,856 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 846 transitions. Word has length 61 [2018-11-18 13:34:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:38,856 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 846 transitions. [2018-11-18 13:34:38,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:34:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 846 transitions. [2018-11-18 13:34:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 13:34:38,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:38,858 INFO L375 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] [2018-11-18 13:34:38,858 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:38,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash -348698255, now seen corresponding path program 1 times [2018-11-18 13:34:38,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:38,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:38,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:38,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:38,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:38,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:38,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:34:38,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:34:38,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:34:38,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:38,896 INFO L87 Difference]: Start difference. First operand 700 states and 846 transitions. Second operand 3 states. [2018-11-18 13:34:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:38,955 INFO L93 Difference]: Finished difference Result 1060 states and 1294 transitions. [2018-11-18 13:34:38,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:34:38,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-18 13:34:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:38,957 INFO L225 Difference]: With dead ends: 1060 [2018-11-18 13:34:38,957 INFO L226 Difference]: Without dead ends: 805 [2018-11-18 13:34:38,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:34:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-11-18 13:34:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 775. [2018-11-18 13:34:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2018-11-18 13:34:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 941 transitions. [2018-11-18 13:34:38,991 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 941 transitions. Word has length 70 [2018-11-18 13:34:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:38,992 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 941 transitions. [2018-11-18 13:34:38,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:34:38,992 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 941 transitions. [2018-11-18 13:34:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 13:34:38,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:38,993 INFO L375 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] [2018-11-18 13:34:38,993 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:38,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:38,994 INFO L82 PathProgramCache]: Analyzing trace with hash 26388614, now seen corresponding path program 1 times [2018-11-18 13:34:38,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:38,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:38,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:38,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:38,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:39,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:39,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:34:39,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:34:39,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:34:39,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:34:39,056 INFO L87 Difference]: Start difference. First operand 775 states and 941 transitions. Second operand 9 states. [2018-11-18 13:34:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:39,245 INFO L93 Difference]: Finished difference Result 792 states and 957 transitions. [2018-11-18 13:34:39,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:34:39,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-11-18 13:34:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:39,247 INFO L225 Difference]: With dead ends: 792 [2018-11-18 13:34:39,248 INFO L226 Difference]: Without dead ends: 749 [2018-11-18 13:34:39,248 INFO L604 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 [2018-11-18 13:34:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-11-18 13:34:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2018-11-18 13:34:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-11-18 13:34:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 909 transitions. [2018-11-18 13:34:39,279 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 909 transitions. Word has length 65 [2018-11-18 13:34:39,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:39,280 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 909 transitions. [2018-11-18 13:34:39,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:34:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 909 transitions. [2018-11-18 13:34:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 13:34:39,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:39,281 INFO L375 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] [2018-11-18 13:34:39,282 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:39,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:39,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1660667000, now seen corresponding path program 1 times [2018-11-18 13:34:39,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:39,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:39,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:39,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:39,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:39,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:39,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:34:39,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:34:39,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:34:39,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:34:39,345 INFO L87 Difference]: Start difference. First operand 749 states and 909 transitions. Second operand 6 states. [2018-11-18 13:34:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:39,726 INFO L93 Difference]: Finished difference Result 1056 states and 1289 transitions. [2018-11-18 13:34:39,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:34:39,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-18 13:34:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:39,729 INFO L225 Difference]: With dead ends: 1056 [2018-11-18 13:34:39,729 INFO L226 Difference]: Without dead ends: 744 [2018-11-18 13:34:39,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:34:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-11-18 13:34:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 733. [2018-11-18 13:34:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-18 13:34:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 884 transitions. [2018-11-18 13:34:39,766 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 884 transitions. Word has length 79 [2018-11-18 13:34:39,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:39,767 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 884 transitions. [2018-11-18 13:34:39,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:34:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 884 transitions. [2018-11-18 13:34:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 13:34:39,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:39,768 INFO L375 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] [2018-11-18 13:34:39,769 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:39,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1744246246, now seen corresponding path program 1 times [2018-11-18 13:34:39,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:39,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:39,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:39,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:39,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:39,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:39,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:34:39,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:34:39,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:34:39,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:34:39,836 INFO L87 Difference]: Start difference. First operand 733 states and 884 transitions. Second operand 6 states. [2018-11-18 13:34:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:39,893 INFO L93 Difference]: Finished difference Result 1076 states and 1325 transitions. [2018-11-18 13:34:39,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:34:39,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-18 13:34:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:39,896 INFO L225 Difference]: With dead ends: 1076 [2018-11-18 13:34:39,896 INFO L226 Difference]: Without dead ends: 819 [2018-11-18 13:34:39,897 INFO L604 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 [2018-11-18 13:34:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-18 13:34:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 699. [2018-11-18 13:34:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-11-18 13:34:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 840 transitions. [2018-11-18 13:34:39,934 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 840 transitions. Word has length 80 [2018-11-18 13:34:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:39,935 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 840 transitions. [2018-11-18 13:34:39,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:34:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 840 transitions. [2018-11-18 13:34:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 13:34:39,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:39,936 INFO L375 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] [2018-11-18 13:34:39,936 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:39,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:39,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1224419065, now seen corresponding path program 1 times [2018-11-18 13:34:39,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:39,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:39,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:39,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:39,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:39,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:39,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:34:39,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:34:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:34:39,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:34:39,977 INFO L87 Difference]: Start difference. First operand 699 states and 840 transitions. Second operand 5 states. [2018-11-18 13:34:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:40,269 INFO L93 Difference]: Finished difference Result 1155 states and 1362 transitions. [2018-11-18 13:34:40,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:34:40,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-18 13:34:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:40,272 INFO L225 Difference]: With dead ends: 1155 [2018-11-18 13:34:40,272 INFO L226 Difference]: Without dead ends: 712 [2018-11-18 13:34:40,273 INFO L604 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 [2018-11-18 13:34:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-11-18 13:34:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 689. [2018-11-18 13:34:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2018-11-18 13:34:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 810 transitions. [2018-11-18 13:34:40,309 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 810 transitions. Word has length 75 [2018-11-18 13:34:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:40,309 INFO L480 AbstractCegarLoop]: Abstraction has 689 states and 810 transitions. [2018-11-18 13:34:40,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:34:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 810 transitions. [2018-11-18 13:34:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 13:34:40,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:40,311 INFO L375 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] [2018-11-18 13:34:40,311 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:40,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:40,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1407798833, now seen corresponding path program 1 times [2018-11-18 13:34:40,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:40,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:40,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:40,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:40,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:40,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:40,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:34:40,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:34:40,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:34:40,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:34:40,367 INFO L87 Difference]: Start difference. First operand 689 states and 810 transitions. Second operand 9 states. [2018-11-18 13:34:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:40,481 INFO L93 Difference]: Finished difference Result 691 states and 811 transitions. [2018-11-18 13:34:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:34:40,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2018-11-18 13:34:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:40,483 INFO L225 Difference]: With dead ends: 691 [2018-11-18 13:34:40,484 INFO L226 Difference]: Without dead ends: 450 [2018-11-18 13:34:40,484 INFO L604 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 [2018-11-18 13:34:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-18 13:34:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2018-11-18 13:34:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-18 13:34:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 534 transitions. [2018-11-18 13:34:40,511 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 534 transitions. Word has length 78 [2018-11-18 13:34:40,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:40,511 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 534 transitions. [2018-11-18 13:34:40,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:34:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 534 transitions. [2018-11-18 13:34:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 13:34:40,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:40,512 INFO L375 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] [2018-11-18 13:34:40,512 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:40,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:40,513 INFO L82 PathProgramCache]: Analyzing trace with hash -883103969, now seen corresponding path program 1 times [2018-11-18 13:34:40,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:40,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:40,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:40,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:40,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:34:40,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:34:40,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:34:40,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:34:40,574 INFO L87 Difference]: Start difference. First operand 450 states and 534 transitions. Second operand 9 states. [2018-11-18 13:34:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:40,656 INFO L93 Difference]: Finished difference Result 471 states and 555 transitions. [2018-11-18 13:34:40,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:34:40,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-11-18 13:34:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:40,658 INFO L225 Difference]: With dead ends: 471 [2018-11-18 13:34:40,658 INFO L226 Difference]: Without dead ends: 450 [2018-11-18 13:34:40,659 INFO L604 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 [2018-11-18 13:34:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-18 13:34:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2018-11-18 13:34:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-18 13:34:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 533 transitions. [2018-11-18 13:34:40,685 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 533 transitions. Word has length 85 [2018-11-18 13:34:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:40,685 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 533 transitions. [2018-11-18 13:34:40,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:34:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 533 transitions. [2018-11-18 13:34:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 13:34:40,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:40,687 INFO L375 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] [2018-11-18 13:34:40,687 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:40,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash -904477969, now seen corresponding path program 1 times [2018-11-18 13:34:40,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:40,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:40,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:40,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:40,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:34:40,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:34:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:34:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:34:40,735 INFO L87 Difference]: Start difference. First operand 450 states and 533 transitions. Second operand 6 states. [2018-11-18 13:34:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:40,772 INFO L93 Difference]: Finished difference Result 483 states and 564 transitions. [2018-11-18 13:34:40,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:34:40,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-18 13:34:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:40,774 INFO L225 Difference]: With dead ends: 483 [2018-11-18 13:34:40,774 INFO L226 Difference]: Without dead ends: 444 [2018-11-18 13:34:40,775 INFO L604 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 [2018-11-18 13:34:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-11-18 13:34:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 390. [2018-11-18 13:34:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-18 13:34:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 456 transitions. [2018-11-18 13:34:40,800 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 456 transitions. Word has length 96 [2018-11-18 13:34:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:40,800 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 456 transitions. [2018-11-18 13:34:40,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:34:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 456 transitions. [2018-11-18 13:34:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 13:34:40,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:40,801 INFO L375 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] [2018-11-18 13:34:40,802 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:40,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1742142347, now seen corresponding path program 1 times [2018-11-18 13:34:40,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:40,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:40,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:40,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:40,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:40,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:40,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:34:40,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 13:34:40,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:34:40,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:34:40,859 INFO L87 Difference]: Start difference. First operand 390 states and 456 transitions. Second operand 7 states. [2018-11-18 13:34:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:40,964 INFO L93 Difference]: Finished difference Result 736 states and 866 transitions. [2018-11-18 13:34:40,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:34:40,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-18 13:34:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:40,967 INFO L225 Difference]: With dead ends: 736 [2018-11-18 13:34:40,967 INFO L226 Difference]: Without dead ends: 691 [2018-11-18 13:34:40,968 INFO L604 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 [2018-11-18 13:34:40,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-11-18 13:34:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 370. [2018-11-18 13:34:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-18 13:34:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 431 transitions. [2018-11-18 13:34:40,993 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 431 transitions. Word has length 96 [2018-11-18 13:34:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:40,993 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 431 transitions. [2018-11-18 13:34:40,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 13:34:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 431 transitions. [2018-11-18 13:34:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 13:34:40,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:40,994 INFO L375 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] [2018-11-18 13:34:40,995 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:40,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1220083171, now seen corresponding path program 1 times [2018-11-18 13:34:40,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:40,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:40,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:40,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:40,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:34:41,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:41,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 13:34:41,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:34:41,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:34:41,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:34:41,075 INFO L87 Difference]: Start difference. First operand 370 states and 431 transitions. Second operand 11 states. [2018-11-18 13:34:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:41,149 INFO L93 Difference]: Finished difference Result 517 states and 605 transitions. [2018-11-18 13:34:41,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:34:41,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-11-18 13:34:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:41,151 INFO L225 Difference]: With dead ends: 517 [2018-11-18 13:34:41,151 INFO L226 Difference]: Without dead ends: 366 [2018-11-18 13:34:41,152 INFO L604 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 [2018-11-18 13:34:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-18 13:34:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2018-11-18 13:34:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-11-18 13:34:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 408 transitions. [2018-11-18 13:34:41,175 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 408 transitions. Word has length 101 [2018-11-18 13:34:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:41,175 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 408 transitions. [2018-11-18 13:34:41,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:34:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 408 transitions. [2018-11-18 13:34:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 13:34:41,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:41,176 INFO L375 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] [2018-11-18 13:34:41,176 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:41,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,177 INFO L82 PathProgramCache]: Analyzing trace with hash -769121507, now seen corresponding path program 1 times [2018-11-18 13:34:41,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 13:34:41,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:41,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:34:41,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:34:41,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:34:41,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:34:41,226 INFO L87 Difference]: Start difference. First operand 353 states and 408 transitions. Second operand 6 states. [2018-11-18 13:34:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:41,267 INFO L93 Difference]: Finished difference Result 381 states and 434 transitions. [2018-11-18 13:34:41,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:34:41,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-11-18 13:34:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:41,269 INFO L225 Difference]: With dead ends: 381 [2018-11-18 13:34:41,269 INFO L226 Difference]: Without dead ends: 304 [2018-11-18 13:34:41,270 INFO L604 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 [2018-11-18 13:34:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-18 13:34:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 241. [2018-11-18 13:34:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-18 13:34:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 266 transitions. [2018-11-18 13:34:41,290 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 266 transitions. Word has length 110 [2018-11-18 13:34:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:41,290 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 266 transitions. [2018-11-18 13:34:41,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:34:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 266 transitions. [2018-11-18 13:34:41,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 13:34:41,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:41,292 INFO L375 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] [2018-11-18 13:34:41,292 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:41,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash -158582420, now seen corresponding path program 1 times [2018-11-18 13:34:41,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 13:34:41,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:41,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:34:41,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:34:41,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:34:41,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:34:41,390 INFO L87 Difference]: Start difference. First operand 241 states and 266 transitions. Second operand 9 states. [2018-11-18 13:34:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:41,477 INFO L93 Difference]: Finished difference Result 315 states and 354 transitions. [2018-11-18 13:34:41,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:34:41,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-11-18 13:34:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:41,479 INFO L225 Difference]: With dead ends: 315 [2018-11-18 13:34:41,479 INFO L226 Difference]: Without dead ends: 286 [2018-11-18 13:34:41,479 INFO L604 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 [2018-11-18 13:34:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-18 13:34:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 262. [2018-11-18 13:34:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-18 13:34:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 292 transitions. [2018-11-18 13:34:41,497 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 292 transitions. Word has length 131 [2018-11-18 13:34:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:41,497 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 292 transitions. [2018-11-18 13:34:41,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:34:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 292 transitions. [2018-11-18 13:34:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 13:34:41,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:41,498 INFO L375 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] [2018-11-18 13:34:41,498 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:41,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,499 INFO L82 PathProgramCache]: Analyzing trace with hash 472743354, now seen corresponding path program 1 times [2018-11-18 13:34:41,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 13:34:41,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:41,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 13:34:41,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 13:34:41,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 13:34:41,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:34:41,596 INFO L87 Difference]: Start difference. First operand 262 states and 292 transitions. Second operand 13 states. [2018-11-18 13:34:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:41,726 INFO L93 Difference]: Finished difference Result 311 states and 353 transitions. [2018-11-18 13:34:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 13:34:41,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2018-11-18 13:34:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:41,728 INFO L225 Difference]: With dead ends: 311 [2018-11-18 13:34:41,728 INFO L226 Difference]: Without dead ends: 277 [2018-11-18 13:34:41,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-11-18 13:34:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-18 13:34:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 253. [2018-11-18 13:34:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-18 13:34:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 279 transitions. [2018-11-18 13:34:41,745 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 279 transitions. Word has length 132 [2018-11-18 13:34:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:41,745 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 279 transitions. [2018-11-18 13:34:41,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 13:34:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions. [2018-11-18 13:34:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 13:34:41,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:41,747 INFO L375 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] [2018-11-18 13:34:41,747 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:41,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1018673562, now seen corresponding path program 1 times [2018-11-18 13:34:41,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 13:34:41,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:41,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:34:41,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:34:41,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:34:41,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:34:41,804 INFO L87 Difference]: Start difference. First operand 253 states and 279 transitions. Second operand 5 states. [2018-11-18 13:34:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:41,829 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2018-11-18 13:34:41,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:34:41,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-11-18 13:34:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:41,831 INFO L225 Difference]: With dead ends: 289 [2018-11-18 13:34:41,831 INFO L226 Difference]: Without dead ends: 259 [2018-11-18 13:34:41,831 INFO L604 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 [2018-11-18 13:34:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-18 13:34:41,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-11-18 13:34:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-18 13:34:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 283 transitions. [2018-11-18 13:34:41,848 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 283 transitions. Word has length 150 [2018-11-18 13:34:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:41,848 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 283 transitions. [2018-11-18 13:34:41,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:34:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 283 transitions. [2018-11-18 13:34:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-18 13:34:41,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:41,850 INFO L375 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] [2018-11-18 13:34:41,850 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:41,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash -837187065, now seen corresponding path program 1 times [2018-11-18 13:34:41,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:41,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:41,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:41,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 13:34:41,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:34:41,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/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 [2018-11-18 13:34:41,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:42,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 13:34:42,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:34:42,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-11-18 13:34:42,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 13:34:42,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 13:34:42,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-18 13:34:42,221 INFO L87 Difference]: Start difference. First operand 257 states and 283 transitions. Second operand 21 states. [2018-11-18 13:34:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:42,357 INFO L93 Difference]: Finished difference Result 309 states and 341 transitions. [2018-11-18 13:34:42,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:34:42,358 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 150 [2018-11-18 13:34:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:42,359 INFO L225 Difference]: With dead ends: 309 [2018-11-18 13:34:42,359 INFO L226 Difference]: Without dead ends: 268 [2018-11-18 13:34:42,360 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-11-18 13:34:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-18 13:34:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 251. [2018-11-18 13:34:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-18 13:34:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 274 transitions. [2018-11-18 13:34:42,381 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 274 transitions. Word has length 150 [2018-11-18 13:34:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:42,381 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 274 transitions. [2018-11-18 13:34:42,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 13:34:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 274 transitions. [2018-11-18 13:34:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 13:34:42,383 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:42,383 INFO L375 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] [2018-11-18 13:34:42,383 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:42,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:42,383 INFO L82 PathProgramCache]: Analyzing trace with hash 140118689, now seen corresponding path program 1 times [2018-11-18 13:34:42,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:42,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:42,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:42,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 13:34:42,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:34:42,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/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 [2018-11-18 13:34:42,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:42,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 13:34:42,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:34:42,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-11-18 13:34:42,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 13:34:42,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 13:34:42,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:34:42,666 INFO L87 Difference]: Start difference. First operand 251 states and 274 transitions. Second operand 14 states. [2018-11-18 13:34:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:42,825 INFO L93 Difference]: Finished difference Result 319 states and 345 transitions. [2018-11-18 13:34:42,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:34:42,826 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 156 [2018-11-18 13:34:42,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:42,827 INFO L225 Difference]: With dead ends: 319 [2018-11-18 13:34:42,828 INFO L226 Difference]: Without dead ends: 242 [2018-11-18 13:34:42,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-18 13:34:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-18 13:34:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 230. [2018-11-18 13:34:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-18 13:34:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 247 transitions. [2018-11-18 13:34:42,849 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 247 transitions. Word has length 156 [2018-11-18 13:34:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:42,849 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 247 transitions. [2018-11-18 13:34:42,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 13:34:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 247 transitions. [2018-11-18 13:34:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-18 13:34:42,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:42,851 INFO L375 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] [2018-11-18 13:34:42,851 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:42,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:42,851 INFO L82 PathProgramCache]: Analyzing trace with hash 895857929, now seen corresponding path program 1 times [2018-11-18 13:34:42,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:42,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:42,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:42,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 13:34:42,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:42,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:34:42,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:34:42,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:34:42,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:34:42,917 INFO L87 Difference]: Start difference. First operand 230 states and 247 transitions. Second operand 6 states. [2018-11-18 13:34:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:42,950 INFO L93 Difference]: Finished difference Result 321 states and 345 transitions. [2018-11-18 13:34:42,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:34:42,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-11-18 13:34:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:42,952 INFO L225 Difference]: With dead ends: 321 [2018-11-18 13:34:42,952 INFO L226 Difference]: Without dead ends: 235 [2018-11-18 13:34:42,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:34:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-18 13:34:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 229. [2018-11-18 13:34:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-18 13:34:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 245 transitions. [2018-11-18 13:34:42,970 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 245 transitions. Word has length 158 [2018-11-18 13:34:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:42,970 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 245 transitions. [2018-11-18 13:34:42,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:34:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 245 transitions. [2018-11-18 13:34:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-18 13:34:42,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:42,972 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:34:42,972 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:42,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2026516475, now seen corresponding path program 1 times [2018-11-18 13:34:42,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:42,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 13:34:43,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:34:43,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 13:34:43,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:34:43,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:34:43,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:34:43,093 INFO L87 Difference]: Start difference. First operand 229 states and 245 transitions. Second operand 10 states. [2018-11-18 13:34:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:43,506 INFO L93 Difference]: Finished difference Result 452 states and 485 transitions. [2018-11-18 13:34:43,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 13:34:43,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2018-11-18 13:34:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:43,508 INFO L225 Difference]: With dead ends: 452 [2018-11-18 13:34:43,508 INFO L226 Difference]: Without dead ends: 232 [2018-11-18 13:34:43,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-11-18 13:34:43,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-18 13:34:43,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2018-11-18 13:34:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-18 13:34:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 244 transitions. [2018-11-18 13:34:43,526 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 244 transitions. Word has length 159 [2018-11-18 13:34:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:43,527 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 244 transitions. [2018-11-18 13:34:43,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:34:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 244 transitions. [2018-11-18 13:34:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-18 13:34:43,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:34:43,528 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:34:43,528 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:34:43,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:34:43,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1761868985, now seen corresponding path program 1 times [2018-11-18 13:34:43,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:34:43,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:34:43,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:43,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:43,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:34:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 13:34:43,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:34:43,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:34:43,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:34:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:34:43,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:34:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 13:34:43,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:34:43,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2018-11-18 13:34:43,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 13:34:43,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 13:34:43,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-18 13:34:43,843 INFO L87 Difference]: Start difference. First operand 229 states and 244 transitions. Second operand 19 states. [2018-11-18 13:34:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:34:45,160 INFO L93 Difference]: Finished difference Result 301 states and 324 transitions. [2018-11-18 13:34:45,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 13:34:45,161 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 159 [2018-11-18 13:34:45,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:34:45,161 INFO L225 Difference]: With dead ends: 301 [2018-11-18 13:34:45,162 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 13:34:45,163 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 13:34:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 13:34:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 13:34:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 13:34:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:34:45,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-11-18 13:34:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:34:45,164 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:34:45,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 13:34:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:34:45,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 13:34:45,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 13:34:45,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:45,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:34:46,967 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 91 [2018-11-18 13:34:47,431 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 101 [2018-11-18 13:34:47,659 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 77 [2018-11-18 13:34:47,912 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 98 [2018-11-18 13:34:48,147 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 61 [2018-11-18 13:34:48,358 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2018-11-18 13:34:48,611 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 74 [2018-11-18 13:34:48,993 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 92 [2018-11-18 13:34:49,298 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2018-11-18 13:34:49,449 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 90 [2018-11-18 13:34:49,656 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 74 [2018-11-18 13:34:49,836 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 74 [2018-11-18 13:34:50,349 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 82 [2018-11-18 13:34:51,071 WARN L180 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 112 [2018-11-18 13:34:51,272 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 99 [2018-11-18 13:34:51,405 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2018-11-18 13:34:51,566 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2018-11-18 13:34:51,738 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-11-18 13:34:52,007 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 98 [2018-11-18 13:34:52,136 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2018-11-18 13:34:52,395 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 74 [2018-11-18 13:34:52,499 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2018-11-18 13:34:52,951 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 99 [2018-11-18 13:34:53,158 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2018-11-18 13:34:53,396 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 85 [2018-11-18 13:34:54,011 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 92 [2018-11-18 13:34:54,491 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 96 [2018-11-18 13:34:54,718 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2018-11-18 13:34:54,858 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2018-11-18 13:34:55,495 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 71 [2018-11-18 13:34:55,779 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2018-11-18 13:34:55,936 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 74 [2018-11-18 13:34:56,396 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 96 [2018-11-18 13:34:56,715 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2018-11-18 13:34:57,056 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 98 [2018-11-18 13:34:57,207 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2018-11-18 13:34:58,010 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 66 [2018-11-18 13:34:58,312 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 83 [2018-11-18 13:34:58,499 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 90 [2018-11-18 13:34:58,915 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2018-11-18 13:34:59,034 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2018-11-18 13:34:59,389 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 69 [2018-11-18 13:34:59,732 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2018-11-18 13:34:59,842 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-11-18 13:35:00,000 INFO L425 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 878 899) no Hoare annotation was computed. [2018-11-18 13:35:00,000 INFO L425 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 878 899) no Hoare annotation was computed. [2018-11-18 13:35:00,001 INFO L428 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 878 899) the Hoare annotation is: true [2018-11-18 13:35:00,001 INFO L428 ceAbstractionStarter]: At program point L888(lines 887 897) the Hoare annotation is: true [2018-11-18 13:35:00,001 INFO L428 ceAbstractionStarter]: At program point L886(lines 885 897) the Hoare annotation is: true [2018-11-18 13:35:00,001 INFO L425 ceAbstractionStarter]: For program point L885(lines 885 897) no Hoare annotation was computed. [2018-11-18 13:35:00,001 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 889 896) no Hoare annotation was computed. [2018-11-18 13:35:00,001 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 889 896) no Hoare annotation was computed. [2018-11-18 13:35:00,001 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 69 89) no Hoare annotation was computed. [2018-11-18 13:35:00,001 INFO L421 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 69 89) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (< 0 ~MaximumInterfaceType~0) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 ~PagingReferenceCount~0) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< ~PagingReferenceCount~0 0) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 13:35:00,001 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 69 89) no Hoare annotation was computed. [2018-11-18 13:35:00,001 INFO L425 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 900 920) no Hoare annotation was computed. [2018-11-18 13:35:00,001 INFO L428 ceAbstractionStarter]: At program point L909(lines 908 918) the Hoare annotation is: true [2018-11-18 13:35:00,001 INFO L428 ceAbstractionStarter]: At program point L907(lines 906 918) the Hoare annotation is: true [2018-11-18 13:35:00,001 INFO L425 ceAbstractionStarter]: For program point L906(lines 906 918) no Hoare annotation was computed. [2018-11-18 13:35:00,002 INFO L428 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 900 920) the Hoare annotation is: true [2018-11-18 13:35:00,002 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 910 917) no Hoare annotation was computed. [2018-11-18 13:35:00,002 INFO L425 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 900 920) no Hoare annotation was computed. [2018-11-18 13:35:00,002 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 910 917) no Hoare annotation was computed. [2018-11-18 13:35:00,002 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 649 655) no Hoare annotation was computed. [2018-11-18 13:35:00,002 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsENTRY(lines 649 655) no Hoare annotation was computed. [2018-11-18 13:35:00,002 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsFINAL(lines 649 655) no Hoare annotation was computed. [2018-11-18 13:35:00,002 INFO L421 ceAbstractionStarter]: At program point L225(lines 224 423) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= .cse6 ~MPR3~0) (<= .cse7 ~SKIP2~0) (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,002 INFO L425 ceAbstractionStarter]: For program point L258-1(line 258) no Hoare annotation was computed. [2018-11-18 13:35:00,002 INFO L421 ceAbstractionStarter]: At program point L283(line 283) the Hoare annotation is: (let ((.cse0 (and (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2) (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2))) [2018-11-18 13:35:00,003 INFO L425 ceAbstractionStarter]: For program point L283-1(line 283) no Hoare annotation was computed. [2018-11-18 13:35:00,003 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 248) no Hoare annotation was computed. [2018-11-18 13:35:00,003 INFO L425 ceAbstractionStarter]: For program point L209(lines 209 428) no Hoare annotation was computed. [2018-11-18 13:35:00,003 INFO L421 ceAbstractionStarter]: At program point L366(line 366) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1))) [2018-11-18 13:35:00,003 INFO L425 ceAbstractionStarter]: For program point L399-1(lines 399 403) no Hoare annotation was computed. [2018-11-18 13:35:00,003 INFO L425 ceAbstractionStarter]: For program point L366-1(lines 362 368) no Hoare annotation was computed. [2018-11-18 13:35:00,003 INFO L425 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2018-11-18 13:35:00,003 INFO L425 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2018-11-18 13:35:00,003 INFO L425 ceAbstractionStarter]: For program point L267-2(lines 267 269) no Hoare annotation was computed. [2018-11-18 13:35:00,003 INFO L421 ceAbstractionStarter]: At program point L391(line 391) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~s~0 ~SKIP1~0) (< 0 ~PagingReferenceCount~0))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2))) [2018-11-18 13:35:00,003 INFO L425 ceAbstractionStarter]: For program point L391-1(line 391) no Hoare annotation was computed. [2018-11-18 13:35:00,003 INFO L421 ceAbstractionStarter]: At program point L383(line 383) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1))) [2018-11-18 13:35:00,004 INFO L425 ceAbstractionStarter]: For program point L383-1(lines 379 385) no Hoare annotation was computed. [2018-11-18 13:35:00,004 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 425) no Hoare annotation was computed. [2018-11-18 13:35:00,004 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 347) no Hoare annotation was computed. [2018-11-18 13:35:00,004 INFO L425 ceAbstractionStarter]: For program point L342-2(lines 342 347) no Hoare annotation was computed. [2018-11-18 13:35:00,004 INFO L421 ceAbstractionStarter]: At program point L210(lines 209 428) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= ~PagingReferenceCount~0 1)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (= |old(~s~0)| ~s~0)) (.cse7 (= 0 FloppyPnp_~ntStatus~0)) (.cse8 (< 0 ~PagingReferenceCount~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 (and .cse2 .cse3 .cse4 (= 0 ~myStatus~0) .cse5 .cse6 .cse7 .cse8)) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and .cse2 .cse3 .cse4 (= |old(~myStatus~0)| ~myStatus~0) .cse5 .cse6 .cse7 .cse8)))) [2018-11-18 13:35:00,004 INFO L425 ceAbstractionStarter]: For program point $Ultimate##21(lines 231 421) no Hoare annotation was computed. [2018-11-18 13:35:00,004 INFO L425 ceAbstractionStarter]: For program point $Ultimate##20(lines 231 421) no Hoare annotation was computed. [2018-11-18 13:35:00,004 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 332) no Hoare annotation was computed. [2018-11-18 13:35:00,004 INFO L425 ceAbstractionStarter]: For program point L326-1(lines 321 333) no Hoare annotation was computed. [2018-11-18 13:35:00,004 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 422) no Hoare annotation was computed. [2018-11-18 13:35:00,004 INFO L421 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~s~0 ~SKIP1~0) (< 0 ~PagingReferenceCount~0))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2))) [2018-11-18 13:35:00,004 INFO L425 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2018-11-18 13:35:00,005 INFO L421 ceAbstractionStarter]: At program point L252(line 252) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse7 (+ ~NP~0 5)) (.cse8 (+ ~DC~0 2)) (.cse5 (= |old(~s~0)| ~NP~0)) (.cse6 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse7) (< ~SKIP2~0 .cse8) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not .cse5) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) .cse5 (<= .cse6 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= .cse7 ~MPR3~0) (<= .cse8 ~SKIP2~0) (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 13:35:00,005 INFO L425 ceAbstractionStarter]: For program point L252-1(line 252) no Hoare annotation was computed. [2018-11-18 13:35:00,005 INFO L421 ceAbstractionStarter]: At program point L277(line 277) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1))) [2018-11-18 13:35:00,005 INFO L425 ceAbstractionStarter]: For program point L277-1(lines 273 279) no Hoare annotation was computed. [2018-11-18 13:35:00,005 INFO L421 ceAbstractionStarter]: At program point L401(line 401) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (<= .cse5 ~MPR1~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0) (<= .cse6 ~MPR3~0) (<= .cse7 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 13:35:00,005 INFO L425 ceAbstractionStarter]: For program point L401-1(line 401) no Hoare annotation was computed. [2018-11-18 13:35:00,005 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 398) no Hoare annotation was computed. [2018-11-18 13:35:00,005 INFO L425 ceAbstractionStarter]: For program point L393-2(lines 231 419) no Hoare annotation was computed. [2018-11-18 13:35:00,005 INFO L421 ceAbstractionStarter]: At program point L228(lines 227 422) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= .cse6 ~MPR3~0) (<= .cse7 ~SKIP2~0) (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,006 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 197) no Hoare annotation was computed. [2018-11-18 13:35:00,006 INFO L425 ceAbstractionStarter]: For program point L195-2(lines 195 197) no Hoare annotation was computed. [2018-11-18 13:35:00,006 INFO L421 ceAbstractionStarter]: At program point L344(line 344) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= FloppyPnp_~__cil_tmp30~0 259) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= .cse5 ~MPR1~0) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= 259 FloppyPnp_~__cil_tmp30~0) (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) (<= .cse6 ~MPR3~0) (<= .cse7 ~SKIP2~0) (= 0 ~myStatus~0) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (= 1 ~setEventCalled~0) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,006 INFO L425 ceAbstractionStarter]: For program point L344-1(line 344) no Hoare annotation was computed. [2018-11-18 13:35:00,006 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 427) no Hoare annotation was computed. [2018-11-18 13:35:00,006 INFO L425 ceAbstractionStarter]: For program point L303(lines 303 309) no Hoare annotation was computed. [2018-11-18 13:35:00,006 INFO L421 ceAbstractionStarter]: At program point L328(line 328) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1))) [2018-11-18 13:35:00,006 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 293) no Hoare annotation was computed. [2018-11-18 13:35:00,006 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 424) no Hoare annotation was computed. [2018-11-18 13:35:00,006 INFO L421 ceAbstractionStarter]: At program point L411(line 411) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1))) [2018-11-18 13:35:00,007 INFO L425 ceAbstractionStarter]: For program point L411-1(lines 407 413) no Hoare annotation was computed. [2018-11-18 13:35:00,007 INFO L421 ceAbstractionStarter]: At program point L246(line 246) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1))) [2018-11-18 13:35:00,007 INFO L425 ceAbstractionStarter]: For program point L246-1(lines 242 248) no Hoare annotation was computed. [2018-11-18 13:35:00,007 INFO L421 ceAbstractionStarter]: At program point L205(line 205) the Hoare annotation is: (let ((.cse4 (+ ~NP~0 5)) (.cse5 (+ ~DC~0 2)) (.cse3 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 .cse4) (< ~SKIP2~0 .cse5) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse3) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~IPC~0) (= 0 ~pended~0) (<= .cse4 ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= .cse5 ~SKIP2~0) (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,007 INFO L425 ceAbstractionStarter]: For program point L238-1(lines 231 419) no Hoare annotation was computed. [2018-11-18 13:35:00,007 INFO L425 ceAbstractionStarter]: For program point L205-1(line 205) no Hoare annotation was computed. [2018-11-18 13:35:00,007 INFO L421 ceAbstractionStarter]: At program point L395(lines 395 396) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~SKIP2~0 ~s~0) (<= .cse5 ~MPR1~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0) (<= .cse6 ~MPR3~0) (<= .cse7 ~SKIP2~0) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,007 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 368) no Hoare annotation was computed. [2018-11-18 13:35:00,007 INFO L425 ceAbstractionStarter]: For program point L395-1(lines 395 396) no Hoare annotation was computed. [2018-11-18 13:35:00,008 INFO L421 ceAbstractionStarter]: At program point L230(lines 229 422) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= .cse6 ~MPR3~0) (<= .cse7 ~SKIP2~0) (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,008 INFO L421 ceAbstractionStarter]: At program point L420(lines 231 421) the Hoare annotation is: (let ((.cse31 (+ ~SKIP1~0 2)) (.cse30 (+ ~DC~0 2)) (.cse32 (+ ~DC~0 5)) (.cse29 (+ ~NP~0 5)) (.cse28 (+ ~NP~0 2))) (let ((.cse13 (= 0 ~customIrp~0)) (.cse15 (not (= ~MPR3~0 |old(~s~0)|))) (.cse18 (<= ~MPR3~0 6)) (.cse19 (= |old(~customIrp~0)| ~customIrp~0)) (.cse22 (<= 6 ~MPR3~0)) (.cse26 (= 0 ~compRegistered~0)) (.cse23 (= ~DC~0 ~s~0)) (.cse27 (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0)) (.cse25 (= ~NP~0 |old(~s~0)|)) (.cse8 (<= .cse28 ~SKIP1~0)) (.cse16 (<= .cse29 ~MPR3~0)) (.cse24 (= 0 ~pended~0)) (.cse10 (<= ~PagingReferenceCount~0 1)) (.cse20 (< 0 ~PagingReferenceCount~0)) (.cse9 (<= .cse32 ~IPC~0)) (.cse17 (<= .cse30 ~SKIP2~0)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse12 (<= .cse31 ~MPR1~0)) (.cse21 (<= ~compRegistered~0 0)) (.cse14 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0))) (let ((.cse0 (or (< ~SKIP1~0 .cse28) (< 6 ~MPR3~0) (< ~MPR3~0 .cse29) (< ~SKIP2~0 .cse30) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse31) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse32) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (and .cse8 (and .cse16 .cse24 .cse10 .cse20) .cse9 .cse17 .cse11 .cse12 .cse21) .cse14)) (.cse3 (and .cse8 .cse23 .cse27 .cse9 .cse16 .cse17 .cse10 .cse12 .cse25 .cse20 .cse21)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse4 (and .cse8 .cse23 .cse27 .cse9 .cse16 .cse26 .cse17 .cse12 .cse25)) (.cse5 (and .cse8 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22)) (.cse6 (and (and .cse18 (and .cse8 (and .cse23 .cse9 .cse16 .cse24 .cse17 .cse10 .cse20) .cse12 .cse25) .cse22) (not (= 259 FloppyPnp_~ntStatus~0)))) (.cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse3 .cse2 .cse4 .cse5 .cse6 .cse7))))) [2018-11-18 13:35:00,008 INFO L421 ceAbstractionStarter]: At program point L354(line 354) the Hoare annotation is: (let ((.cse9 (+ ~NP~0 2)) (.cse13 (+ ~DC~0 5)) (.cse10 (+ ~NP~0 5)) (.cse11 (+ ~DC~0 2)) (.cse12 (+ ~SKIP1~0 2))) (let ((.cse4 (and (<= .cse9 ~SKIP1~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (<= .cse13 ~IPC~0) (<= .cse10 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (<= .cse11 ~SKIP2~0) (<= .cse12 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0))) (.cse5 (<= ~MPR3~0 6)) (.cse6 (= 0 ~customIrp~0)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (<= 6 ~MPR3~0))) (let ((.cse0 (or (< ~SKIP1~0 .cse9) (< 6 ~MPR3~0) (< ~MPR3~0 .cse10) (< ~SKIP2~0 .cse11) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse12) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse13) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and .cse4 (not (= 259 FloppyPnp_~ntStatus~0)) .cse5 .cse6 (= 1 ~setEventCalled~0) .cse7 .cse8)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and (= 0 FloppyPnp_~ntStatus~0) .cse4 (= 0 ~myStatus~0) .cse5 .cse6 .cse7 .cse8))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3))))) [2018-11-18 13:35:00,008 INFO L425 ceAbstractionStarter]: For program point L321(lines 321 333) no Hoare annotation was computed. [2018-11-18 13:35:00,008 INFO L421 ceAbstractionStarter]: At program point L222(lines 218 425) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= .cse6 ~MPR3~0) (= 0 FloppyPnp_~ntStatus~0) (<= .cse7 ~SKIP2~0) (= 0 ~myStatus~0) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,008 INFO L425 ceAbstractionStarter]: For program point L379(lines 379 385) no Hoare annotation was computed. [2018-11-18 13:35:00,009 INFO L421 ceAbstractionStarter]: At program point L313(line 313) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~s~0 ~SKIP1~0) (< 0 ~PagingReferenceCount~0))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2))) [2018-11-18 13:35:00,009 INFO L425 ceAbstractionStarter]: For program point L313-1(line 313) no Hoare annotation was computed. [2018-11-18 13:35:00,009 INFO L421 ceAbstractionStarter]: At program point L338(line 338) the Hoare annotation is: (let ((.cse5 (+ ~NP~0 5)) (.cse6 (+ ~DC~0 2)) (.cse4 (+ ~SKIP1~0 2)) (.cse3 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 .cse5) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse4) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse3) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= .cse4 ~MPR1~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= 0 ~customIrp~0) (<= .cse5 ~MPR3~0) (= 0 FloppyPnp_~ntStatus~0) (<= .cse6 ~SKIP2~0) (= 0 ~myStatus~0) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= (+ ~s~0 2) ~SKIP1~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,009 INFO L425 ceAbstractionStarter]: For program point L338-1(line 338) no Hoare annotation was computed. [2018-11-18 13:35:00,009 INFO L421 ceAbstractionStarter]: At program point L264(lines 264 265) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= .cse6 ~MPR3~0) (<= .cse7 ~SKIP2~0) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,009 INFO L425 ceAbstractionStarter]: For program point L297-1(lines 231 419) no Hoare annotation was computed. [2018-11-18 13:35:00,009 INFO L425 ceAbstractionStarter]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2018-11-18 13:35:00,009 INFO L425 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 162 435) no Hoare annotation was computed. [2018-11-18 13:35:00,009 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 426) no Hoare annotation was computed. [2018-11-18 13:35:00,010 INFO L421 ceAbstractionStarter]: At program point L372(line 372) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~s~0 ~SKIP1~0) (< 0 ~PagingReferenceCount~0))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2))) [2018-11-18 13:35:00,010 INFO L425 ceAbstractionStarter]: For program point L372-1(line 372) no Hoare annotation was computed. [2018-11-18 13:35:00,010 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 279) no Hoare annotation was computed. [2018-11-18 13:35:00,010 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-11-18 13:35:00,010 INFO L425 ceAbstractionStarter]: For program point L430-2(lines 430 432) no Hoare annotation was computed. [2018-11-18 13:35:00,010 INFO L421 ceAbstractionStarter]: At program point L323(line 323) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1))) [2018-11-18 13:35:00,010 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 423) no Hoare annotation was computed. [2018-11-18 13:35:00,010 INFO L421 ceAbstractionStarter]: At program point L216(lines 212 427) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= .cse6 ~MPR3~0) (<= .cse7 ~SKIP2~0) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,010 INFO L421 ceAbstractionStarter]: At program point L307(line 307) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1))) [2018-11-18 13:35:00,011 INFO L425 ceAbstractionStarter]: For program point L307-1(lines 303 309) no Hoare annotation was computed. [2018-11-18 13:35:00,011 INFO L425 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 162 435) no Hoare annotation was computed. [2018-11-18 13:35:00,011 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 208) no Hoare annotation was computed. [2018-11-18 13:35:00,011 INFO L421 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 162 435) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~s~0 |old(~s~0)|)) (.cse4 (<= ~PagingReferenceCount~0 0)) (.cse5 (<= 0 ~PagingReferenceCount~0)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) (and .cse1 .cse2 .cse3 (= |old(~myStatus~0)| ~myStatus~0) .cse4 .cse5 .cse6) .cse7) (or .cse0 (not (= |old(~myStatus~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 (= 0 ~myStatus~0) .cse5 .cse6) .cse7))) [2018-11-18 13:35:00,011 INFO L421 ceAbstractionStarter]: At program point L291(line 291) the Hoare annotation is: (let ((.cse0 (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2) (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2))) [2018-11-18 13:35:00,011 INFO L421 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 .cse4) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (<= .cse5 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= .cse6 ~MPR3~0) (<= .cse7 ~SKIP2~0) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,011 INFO L421 ceAbstractionStarter]: At program point L795(line 795) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~PagingReferenceCount~0)| 0) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 13:35:00,011 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 669 808) no Hoare annotation was computed. [2018-11-18 13:35:00,011 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. [2018-11-18 13:35:00,012 INFO L421 ceAbstractionStarter]: At program point L771(line 771) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~PagingReferenceCount~0)| 0) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 13:35:00,012 INFO L421 ceAbstractionStarter]: At program point L780(lines 767 800) the Hoare annotation is: (let ((.cse10 (= ~DC~0 ~s~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (and .cse10 .cse4 .cse3 .cse5)) (.cse2 (= main_~status~1 ~lowerDriverReturn~0)) (.cse7 (<= ~compRegistered~0 0))) (let ((.cse1 (and .cse8 (or .cse9 (and .cse2 .cse3 .cse4 .cse5 .cse7)))) (.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse6 (= 0 main_~status~1))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (<= (+ main_~status~1 1073741823) 0) .cse1) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (and (and (<= ~MPR3~0 6) (and .cse0 .cse1) (<= 6 ~MPR3~0)) (not (= 259 main_~status~1))) (and .cse2 .cse0 (and .cse3 .cse4 .cse5 .cse8 .cse7) (<= ~SKIP2~0 ~s~0)) (and .cse9 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (and .cse10 .cse4 .cse3 .cse5 (<= (+ main_~status~1 1073741738) 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))))) [2018-11-18 13:35:00,012 INFO L425 ceAbstractionStarter]: For program point L739(line 739) no Hoare annotation was computed. [2018-11-18 13:35:00,012 INFO L421 ceAbstractionStarter]: At program point L764(lines 757 803) the Hoare annotation is: (let ((.cse6 (= ~SKIP2~0 ~s~0)) (.cse5 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= 0 main_~status~1)) (.cse8 (<= ~compRegistered~0 0))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (and .cse0 .cse1 .cse2 .cse3 (<= (+ main_~status~1 1073741738) 0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (and .cse4 .cse5 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse4 .cse1 .cse2 .cse3 .cse6 .cse7 .cse9 .cse8) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (and (and .cse5 (and .cse0 .cse1 .cse2 .cse3) .cse7) (<= ~MPR3~0 6) (<= 6 ~MPR3~0)) (not (= 259 main_~status~1))) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|) (and .cse4 .cse1 .cse2 .cse3 .cse9 (= ~IPC~0 ~s~0) .cse8))) [2018-11-18 13:35:00,012 INFO L421 ceAbstractionStarter]: At program point L789(line 789) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~PagingReferenceCount~0)| 0) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 13:35:00,012 INFO L421 ceAbstractionStarter]: At program point L756(lines 749 804) the Hoare annotation is: (let ((.cse7 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse10 (<= ~MPR3~0 6)) (.cse11 (<= 6 ~MPR3~0)) (.cse12 (= ~DC~0 ~s~0)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= 0 main_~status~1)) (.cse6 (<= ~compRegistered~0 0))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse0 .cse7 .cse1 .cse8 .cse9 .cse3 .cse4 .cse10 (= |old(~customIrp~0)| ~customIrp~0) .cse11 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (and .cse7 .cse12 .cse1 .cse3 .cse4 (<= (+ main_~status~1 1073741823) 0) .cse9 .cse6) (and (and (and .cse7 .cse9 (and .cse12 .cse1 .cse2 .cse3 .cse4)) .cse10 .cse11) (not (= 259 main_~status~1))) (and .cse12 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~1 1073741738) 0)) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 .cse5 .cse6) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 13:35:00,013 INFO L425 ceAbstractionStarter]: For program point L723(lines 709 748) no Hoare annotation was computed. [2018-11-18 13:35:00,013 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 669 808) no Hoare annotation was computed. [2018-11-18 13:35:00,013 INFO L425 ceAbstractionStarter]: For program point $Ultimate##10(lines 736 746) no Hoare annotation was computed. [2018-11-18 13:35:00,013 INFO L421 ceAbstractionStarter]: At program point L707(line 707) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~PagingReferenceCount~0)| 0) (< |old(~MPR3~0)| |old(~s~0)|) (and (= main_~status~1 ~lowerDriverReturn~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~myStatus~0) (<= 0 ~PagingReferenceCount~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 main_~status~1) (<= ~PagingReferenceCount~0 0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 13:35:00,013 INFO L425 ceAbstractionStarter]: For program point L707-1(lines 703 807) no Hoare annotation was computed. [2018-11-18 13:35:00,013 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 736 746) no Hoare annotation was computed. [2018-11-18 13:35:00,013 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 669 808) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~myStatus~0) (<= 0 ~PagingReferenceCount~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (<= ~PagingReferenceCount~0 0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~PagingReferenceCount~0)| 0) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 13:35:00,013 INFO L425 ceAbstractionStarter]: For program point L765(lines 749 804) no Hoare annotation was computed. [2018-11-18 13:35:00,013 INFO L425 ceAbstractionStarter]: For program point L732(lines 732 747) no Hoare annotation was computed. [2018-11-18 13:35:00,013 INFO L425 ceAbstractionStarter]: For program point L782(lines 782 784) no Hoare annotation was computed. [2018-11-18 13:35:00,013 INFO L425 ceAbstractionStarter]: For program point L766(lines 766 801) no Hoare annotation was computed. [2018-11-18 13:35:00,014 INFO L421 ceAbstractionStarter]: At program point L733(lines 732 747) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= 0 main_~status~1)) (.cse7 (<= ~PagingReferenceCount~0 0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= 0 ~PagingReferenceCount~0)) (.cse11 (<= ~MPR3~0 6)) (.cse12 (= |old(~customIrp~0)| ~customIrp~0)) (.cse13 (<= ~MaximumInterfaceType~0 0)) (.cse14 (<= 6 ~MPR3~0))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ ~myStatus~0 1073741637) 0) .cse12 .cse13 .cse14) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 13:35:00,014 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 762) no Hoare annotation was computed. [2018-11-18 13:35:00,014 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 754) no Hoare annotation was computed. [2018-11-18 13:35:00,014 INFO L421 ceAbstractionStarter]: At program point L709(lines 703 807) the Hoare annotation is: (let ((.cse5 (= 0 main_~status~1)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (= ~DC~0 ~s~0)) (.cse1 (= 0 ~pended~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (<= ~MPR3~0 6)) (.cse12 (<= 6 ~MPR3~0))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse6) (not (= |old(~compRegistered~0)| 0)) (and .cse7 .cse1 .cse3 .cse2 .cse4 (<= (+ main_~status~1 1073741738) 0)) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse0 .cse8 .cse3 .cse9 .cse10 .cse2 .cse4 .cse11 (= |old(~customIrp~0)| ~customIrp~0) .cse12 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (and .cse8 .cse7 .cse3 .cse2 .cse4 (<= (+ main_~status~1 1073741823) 0) .cse10 .cse6) (not (= 0 |old(~pended~0)|)) (and (and (and .cse8 (and .cse7 .cse1 .cse3 .cse2 .cse4) .cse10) .cse11 .cse12) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 13:35:00,014 INFO L425 ceAbstractionStarter]: For program point L767(lines 767 800) no Hoare annotation was computed. [2018-11-18 13:35:00,014 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 721) no Hoare annotation was computed. [2018-11-18 13:35:00,014 INFO L421 ceAbstractionStarter]: At program point L718-2(lines 718 721) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (= ~s~0 ~NP~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= 0 main_~status~1)) (.cse7 (<= ~PagingReferenceCount~0 0)) (.cse8 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (<= 0 ~PagingReferenceCount~0)) (.cse11 (<= ~MPR3~0 6)) (.cse12 (= |old(~customIrp~0)| ~customIrp~0)) (.cse13 (<= ~MaximumInterfaceType~0 0)) (.cse14 (<= 6 ~MPR3~0))) (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ ~myStatus~0 1073741637) 0) .cse12 .cse13 .cse14) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~myStatus~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-18 13:35:00,014 INFO L425 ceAbstractionStarter]: For program point L768(lines 768 778) no Hoare annotation was computed. [2018-11-18 13:35:00,015 INFO L421 ceAbstractionStarter]: At program point L735(lines 734 747) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~PagingReferenceCount~0)| 0) (<= 0 main_~status~1) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-18 13:35:00,015 INFO L425 ceAbstractionStarter]: For program point L793(lines 793 797) no Hoare annotation was computed. [2018-11-18 13:35:00,015 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 775) no Hoare annotation was computed. [2018-11-18 13:35:00,015 INFO L425 ceAbstractionStarter]: For program point L786(lines 786 798) no Hoare annotation was computed. [2018-11-18 13:35:00,015 INFO L425 ceAbstractionStarter]: For program point L1146(line 1146) no Hoare annotation was computed. [2018-11-18 13:35:00,015 INFO L425 ceAbstractionStarter]: For program point L1146-1(line 1146) no Hoare annotation was computed. [2018-11-18 13:35:00,015 INFO L425 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 1137 1150) no Hoare annotation was computed. [2018-11-18 13:35:00,015 INFO L425 ceAbstractionStarter]: For program point FloppyCreateCloseENTRY(lines 1137 1150) no Hoare annotation was computed. [2018-11-18 13:35:00,015 INFO L425 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 1137 1150) no Hoare annotation was computed. [2018-11-18 13:35:00,015 INFO L421 ceAbstractionStarter]: At program point L929(line 929) the Hoare annotation is: (let ((.cse0 (or (not (= ~setEventCalled~0 1)) (< 6 ~MPR3~0) (or (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1) (or .cse0 (not (= ~myStatus~0 0)) .cse1))) [2018-11-18 13:35:00,015 INFO L425 ceAbstractionStarter]: For program point L929-1(lines 921 934) no Hoare annotation was computed. [2018-11-18 13:35:00,015 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 921 934) the Hoare annotation is: (let ((.cse0 (= |old(~s~0)| ~s~0)) (.cse1 (or (not (= ~setEventCalled~0 1)) (< 6 ~MPR3~0) (or (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2))) [2018-11-18 13:35:00,015 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 921 934) no Hoare annotation was computed. [2018-11-18 13:35:00,016 INFO L428 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: true [2018-11-18 13:35:00,016 INFO L425 ceAbstractionStarter]: For program point L609-1(line 609) no Hoare annotation was computed. [2018-11-18 13:35:00,016 INFO L428 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 604 613) the Hoare annotation is: true [2018-11-18 13:35:00,016 INFO L425 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 604 613) no Hoare annotation was computed. [2018-11-18 13:35:00,016 INFO L425 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 604 613) no Hoare annotation was computed. [2018-11-18 13:35:00,016 INFO L425 ceAbstractionStarter]: For program point L1057(lines 1057 1069) no Hoare annotation was computed. [2018-11-18 13:35:00,016 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1030 1071) no Hoare annotation was computed. [2018-11-18 13:35:00,016 INFO L421 ceAbstractionStarter]: At program point L1043(lines 1035 1054) the Hoare annotation is: (let ((.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse8 (not (= 0 ~pended~0))) (.cse9 (< 1 ~PagingReferenceCount~0)) (.cse11 (< ~compRegistered~0 1)) (.cse10 (<= ~PagingReferenceCount~0 0)) (.cse12 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse18 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< 6 ~MPR3~0)) (.cse19 (or .cse2 .cse8 .cse9 .cse11 .cse10 .cse12)) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse20 (< ~MPR3~0 |old(~s~0)|)) (.cse5 (< ~MPR3~0 6)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse21 (< |old(~s~0)| ~MPR3~0))) (let ((.cse13 (not (= |old(~customIrp~0)| 0))) (.cse14 (not (= ~myStatus~0 0))) (.cse23 (or .cse0 .cse18 .cse1 .cse19 .cse7 .cse20 .cse5 .cse4 .cse21)) (.cse22 (= ~s~0 |old(~s~0)|)) (.cse16 (= 1 ~setEventCalled~0)) (.cse17 (= |old(~customIrp~0)| ~customIrp~0)) (.cse24 (< 0 (+ ~myStatus~0 1073741637))) (.cse15 (< 0 ~MaximumInterfaceType~0)) (.cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse6 (not (= |old(~s~0)| ~NP~0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 (and .cse16 .cse17 (= |old(~s~0)| ~s~0))) (or .cse0 .cse18 .cse1 .cse19 .cse7 .cse14 .cse20 .cse5 .cse4 .cse13 .cse21) (or .cse18 .cse1 .cse2 (and .cse22 .cse17) .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 0)) .cse12 .cse13) (or .cse14 .cse15 .cse23) (or .cse24 .cse15 .cse23) (or (and .cse22 .cse16 .cse17) .cse24 .cse15 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))))) [2018-11-18 13:35:00,016 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 1061 1068) no Hoare annotation was computed. [2018-11-18 13:35:00,016 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 1061 1068) no Hoare annotation was computed. [2018-11-18 13:35:00,016 INFO L425 ceAbstractionStarter]: For program point L1035(lines 1035 1054) no Hoare annotation was computed. [2018-11-18 13:35:00,017 INFO L421 ceAbstractionStarter]: At program point L1060(lines 1059 1069) the Hoare annotation is: (let ((.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (not (= 0 ~pended~0))) (.cse10 (< 1 ~PagingReferenceCount~0)) (.cse12 (< ~compRegistered~0 1)) (.cse11 (<= ~PagingReferenceCount~0 0)) (.cse13 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse1 (not (= |old(~setEventCalled~0)| 1))) (.cse22 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< 6 ~MPR3~0)) (.cse23 (or .cse3 .cse9 .cse10 .cse12 .cse11 .cse13)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse24 (< ~MPR3~0 |old(~s~0)|)) (.cse6 (< ~MPR3~0 6)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse25 (< |old(~s~0)| ~MPR3~0)) (.cse20 (= |old(~s~0)| ~s~0)) (.cse21 (= 1 ~setEventCalled~0)) (.cse26 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse0 (and .cse20 .cse21 .cse26)) (.cse17 (< 0 (+ ~myStatus~0 1073741637))) (.cse4 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse16 (< 0 ~MaximumInterfaceType~0)) (.cse19 (or .cse1 .cse22 .cse2 .cse23 .cse8 .cse24 .cse6 .cse5 .cse25)) (.cse15 (not (= ~myStatus~0 0))) (.cse18 (and (= ~s~0 ~NP~0) .cse26)) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse14 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (or .cse17 .cse16 .cse18 .cse19) (or (or (and .cse20 (= 0 ~customIrp~0) (= |old(~customIrp~0)| 1) .cse21) .cse0) .cse17 .cse16 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (or .cse15 .cse16 .cse18 .cse19) (or .cse1 .cse22 .cse2 .cse23 .cse15 .cse6 .cse5 .cse18 .cse8 .cse24 .cse14 .cse25) (or .cse22 .cse2 .cse3 .cse5 .cse6 (and (= ~s~0 |old(~s~0)|) .cse26) .cse7 .cse8 (not (= ~compRegistered~0 0)) .cse13 .cse14))))) [2018-11-18 13:35:00,022 INFO L421 ceAbstractionStarter]: At program point L1058(lines 1057 1069) the Hoare annotation is: (let ((.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (not (= 0 ~pended~0))) (.cse10 (< 1 ~PagingReferenceCount~0)) (.cse12 (< ~compRegistered~0 1)) (.cse11 (<= ~PagingReferenceCount~0 0)) (.cse13 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse1 (not (= |old(~setEventCalled~0)| 1))) (.cse22 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< 6 ~MPR3~0)) (.cse23 (or .cse3 .cse9 .cse10 .cse12 .cse11 .cse13)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse24 (< ~MPR3~0 |old(~s~0)|)) (.cse6 (< ~MPR3~0 6)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse25 (< |old(~s~0)| ~MPR3~0)) (.cse20 (= |old(~s~0)| ~s~0)) (.cse21 (= 1 ~setEventCalled~0)) (.cse26 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse0 (and .cse20 .cse21 .cse26)) (.cse17 (< 0 (+ ~myStatus~0 1073741637))) (.cse4 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse16 (< 0 ~MaximumInterfaceType~0)) (.cse19 (or .cse1 .cse22 .cse2 .cse23 .cse8 .cse24 .cse6 .cse5 .cse25)) (.cse15 (not (= ~myStatus~0 0))) (.cse18 (and (= ~s~0 ~NP~0) .cse26)) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse14 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (or .cse17 .cse16 .cse18 .cse19) (or (or (and .cse20 (= 0 ~customIrp~0) (= |old(~customIrp~0)| 1) .cse21) .cse0) .cse17 .cse16 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (or .cse15 .cse16 .cse18 .cse19) (or .cse1 .cse22 .cse2 .cse23 .cse15 .cse6 .cse5 .cse18 .cse8 .cse24 .cse14 .cse25) (or .cse22 .cse2 .cse3 .cse5 .cse6 (and (= ~s~0 |old(~s~0)|) .cse26) .cse7 .cse8 (not (= ~compRegistered~0 0)) .cse13 .cse14))))) [2018-11-18 13:35:00,022 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1030 1071) no Hoare annotation was computed. [2018-11-18 13:35:00,022 INFO L421 ceAbstractionStarter]: At program point L1050(line 1050) the Hoare annotation is: (let ((.cse2 (< ~MPR3~0 (+ ~NP~0 5))) (.cse17 (not (= 0 ~pended~0))) (.cse18 (< 1 ~PagingReferenceCount~0)) (.cse20 (< ~compRegistered~0 1)) (.cse19 (<= ~PagingReferenceCount~0 0)) (.cse7 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse9 (not (= |old(~setEventCalled~0)| 1))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< 6 ~MPR3~0)) (.cse10 (or .cse2 .cse17 .cse18 .cse20 .cse19 .cse7)) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (< ~MPR3~0 |old(~s~0)|)) (.cse4 (< ~MPR3~0 6)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (< |old(~s~0)| ~MPR3~0))) (let ((.cse8 (not (= |old(~customIrp~0)| 0))) (.cse11 (not (= ~myStatus~0 0))) (.cse16 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse21 (< 0 (+ ~myStatus~0 1073741637))) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse15 (or .cse9 .cse0 .cse1 .cse10 .cse6 .cse12 .cse4 .cse3 .cse13))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~compRegistered~0 0)) .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse10 .cse6 .cse11 .cse12 .cse4 .cse3 .cse8 .cse13) (or .cse11 .cse14 .cse15) (or (or .cse9 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse6 .cse17 .cse18 .cse19 .cse20 .cse7 .cse8) .cse11 .cse14) (or .cse21 .cse14 (or .cse9 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse6 .cse17 .cse18 .cse19 .cse20 .cse7)) (or .cse21 .cse14 .cse15))))) [2018-11-18 13:35:00,025 INFO L425 ceAbstractionStarter]: For program point L1048(lines 1048 1052) no Hoare annotation was computed. [2018-11-18 13:35:00,025 INFO L425 ceAbstractionStarter]: For program point L1048-1(lines 1035 1054) no Hoare annotation was computed. [2018-11-18 13:35:00,025 INFO L425 ceAbstractionStarter]: For program point L1036(lines 1036 1041) no Hoare annotation was computed. [2018-11-18 13:35:00,025 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1030 1071) the Hoare annotation is: (let ((.cse15 (< ~MPR3~0 (+ ~NP~0 5))) (.cse18 (not (= 0 ~pended~0))) (.cse19 (< 1 ~PagingReferenceCount~0)) (.cse21 (< ~compRegistered~0 1)) (.cse20 (<= ~PagingReferenceCount~0 0)) (.cse22 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< 6 ~MPR3~0)) (.cse3 (or .cse15 .cse18 .cse19 .cse21 .cse20 .cse22)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (< ~MPR3~0 |old(~s~0)|)) (.cse5 (< ~MPR3~0 6)) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse11 (< |old(~s~0)| ~MPR3~0)) (.cse24 (= ~s~0 |old(~s~0)|)) (.cse26 (= 1 ~setEventCalled~0)) (.cse25 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse4 (not (= ~myStatus~0 0))) (.cse14 (and .cse24 .cse26 .cse25)) (.cse16 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse23 (< 0 (+ ~myStatus~0 1073741637))) (.cse12 (< 0 ~MaximumInterfaceType~0)) (.cse7 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse26 .cse25)) (.cse13 (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse9 .cse5 .cse6 .cse11)) (.cse17 (not (= |old(~s~0)| ~NP~0))) (.cse10 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse7 .cse4 .cse12 .cse13) (or .cse14 (or .cse0 .cse2 .cse15 .cse16 .cse6 .cse5 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse10) .cse4 .cse12) (or .cse23 .cse14 .cse12 (or .cse0 .cse2 .cse15 .cse16 .cse6 .cse5 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22)) (or .cse23 .cse12 .cse7 .cse13) (or .cse1 .cse2 .cse15 .cse6 .cse5 (and .cse24 .cse25) .cse17 .cse8 (not (= ~compRegistered~0 0)) .cse22 .cse10))))) [2018-11-18 13:35:00,025 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1008 1021) the Hoare annotation is: (let ((.cse6 (= |old(~s~0)| ~s~0)) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (= ~compRegistered~0 0))) (.cse7 (not (= 0 ~pended~0))) (.cse8 (< 1 ~PagingReferenceCount~0)) (.cse9 (<= ~PagingReferenceCount~0 0))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse6 (or (< 6 ~MPR3~0) (or .cse0 (or .cse1 .cse7 .cse8 .cse9) .cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse5) (< ~MPR3~0 6) .cse4)) (or .cse0 (= ~s~0 ~NP~0) .cse4 .cse5 (or .cse1 .cse3 .cse7 .cse8 .cse9)))) [2018-11-18 13:35:00,029 INFO L421 ceAbstractionStarter]: At program point L1016(line 1016) the Hoare annotation is: (let ((.cse2 (not (= 0 ~pended~0))) (.cse3 (< 1 ~PagingReferenceCount~0)) (.cse4 (<= ~PagingReferenceCount~0 0)) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= ~compRegistered~0 0))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (< 6 ~MPR3~0) (or .cse0 (or .cse1 .cse2 .cse3 .cse4) .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~MPR3~0 6) .cse7) (or .cse0 .cse7 .cse6 (or .cse1 .cse8 .cse2 .cse3 .cse4)) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse5 .cse8 .cse7 .cse6))) [2018-11-18 13:35:00,029 INFO L425 ceAbstractionStarter]: For program point L1016-1(lines 1008 1021) no Hoare annotation was computed. [2018-11-18 13:35:00,029 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1008 1021) no Hoare annotation was computed. [2018-11-18 13:35:00,029 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1018) no Hoare annotation was computed. [2018-11-18 13:35:00,029 INFO L425 ceAbstractionStarter]: For program point L514-2(lines 514 519) no Hoare annotation was computed. [2018-11-18 13:35:00,029 INFO L425 ceAbstractionStarter]: For program point L564(lines 564 566) no Hoare annotation was computed. [2018-11-18 13:35:00,029 INFO L425 ceAbstractionStarter]: For program point L498(lines 498 504) no Hoare annotation was computed. [2018-11-18 13:35:00,029 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 493 505) no Hoare annotation was computed. [2018-11-18 13:35:00,029 INFO L425 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 436 603) no Hoare annotation was computed. [2018-11-18 13:35:00,029 INFO L421 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 436 603) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ~s~0 |old(~s~0)|)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3) (not (= |old(~myStatus~0)| 0)) .cse4) (or .cse0 (and .cse1 (= |old(~myStatus~0)| ~myStatus~0) .cse2 .cse3) (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse4))) [2018-11-18 13:35:00,029 INFO L425 ceAbstractionStarter]: For program point L532(lines 532 572) no Hoare annotation was computed. [2018-11-18 13:35:00,030 INFO L421 ceAbstractionStarter]: At program point L516(line 516) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (= |old(~s~0)| ~s~0)) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse9 (<= ~MPR3~0 ~s~0)) (.cse10 (<= ~s~0 ~MPR3~0)) (.cse5 (<= FloppyStartDevice_~__cil_tmp42~0 259)) (.cse6 (= 1 ~setEventCalled~0)) (.cse7 (< 258 FloppyStartDevice_~__cil_tmp42~0)) (.cse8 (= |old(~customIrp~0)| ~customIrp~0))) (and (let ((.cse3 (= |old(~myStatus~0)| ~myStatus~0))) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7 .cse8))) (let ((.cse11 (= 0 ~myStatus~0))) (or .cse0 (and .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8) (not (= |old(~myStatus~0)| 0)) .cse1 (and .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7 .cse8))))) [2018-11-18 13:35:00,034 INFO L425 ceAbstractionStarter]: For program point L516-1(line 516) no Hoare annotation was computed. [2018-11-18 13:35:00,034 INFO L425 ceAbstractionStarter]: For program point L574(lines 574 581) no Hoare annotation was computed. [2018-11-18 13:35:00,035 INFO L421 ceAbstractionStarter]: At program point L574-2(lines 574 581) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse8 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse5 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse8) (not (= |old(~compRegistered~0)| 0)) (not .cse4) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 .cse5) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (<= ~MPR3~0 6) (and (<= .cse3 ~SKIP1~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~IPC~0) (<= .cse6 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (<= .cse7 ~SKIP2~0) (<= .cse8 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0)) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse1)))) [2018-11-18 13:35:00,035 INFO L421 ceAbstractionStarter]: At program point L599(line 599) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse8 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse5 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse8) (not (= |old(~compRegistered~0)| 0)) (not .cse4) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 .cse5) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (and (<= ~MPR3~0 6) (and (<= .cse3 ~SKIP1~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~IPC~0) (<= .cse6 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (<= .cse7 ~SKIP2~0) (<= .cse8 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0)) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,035 INFO L425 ceAbstractionStarter]: For program point L599-1(line 599) no Hoare annotation was computed. [2018-11-18 13:35:00,035 INFO L425 ceAbstractionStarter]: For program point L533(lines 533 543) no Hoare annotation was computed. [2018-11-18 13:35:00,035 INFO L421 ceAbstractionStarter]: At program point L500(line 500) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 13:35:00,040 INFO L425 ceAbstractionStarter]: For program point L583(lines 583 584) no Hoare annotation was computed. [2018-11-18 13:35:00,040 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 505) no Hoare annotation was computed. [2018-11-18 13:35:00,040 INFO L421 ceAbstractionStarter]: At program point L510(line 510) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse4 (< 0 ~MaximumInterfaceType~0)) (.cse1 (= ~s~0 |old(~s~0)|)) (.cse2 (<= 1 ~compRegistered~0)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0))) (and (or .cse0 (and (= |old(~myStatus~0)| ~myStatus~0) .cse1 .cse2 .cse3) (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse4) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse4 (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3)))) [2018-11-18 13:35:00,040 INFO L425 ceAbstractionStarter]: For program point L510-1(line 510) no Hoare annotation was computed. [2018-11-18 13:35:00,040 INFO L421 ceAbstractionStarter]: At program point L535(line 535) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse8 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse5 (+ ~DC~0 5))) (let ((.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse8) (not (= |old(~compRegistered~0)| 0)) (not .cse4) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 .cse5) (not (= |old(~customIrp~0)| 0)))) (.cse0 (and (<= ~MPR3~0 6) (and (<= .cse3 ~SKIP1~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~IPC~0) (<= .cse6 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (<= .cse7 ~SKIP2~0) (<= .cse8 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0)) (<= 6 ~MPR3~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2) (or .cse1 .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2)))) [2018-11-18 13:35:00,040 INFO L425 ceAbstractionStarter]: For program point L535-1(line 535) no Hoare annotation was computed. [2018-11-18 13:35:00,040 INFO L421 ceAbstractionStarter]: At program point L560(lines 560 562) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 13:35:00,040 INFO L425 ceAbstractionStarter]: For program point L560-1(lines 560 562) no Hoare annotation was computed. [2018-11-18 13:35:00,041 INFO L425 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 436 603) no Hoare annotation was computed. [2018-11-18 13:35:00,041 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 552 568) no Hoare annotation was computed. [2018-11-18 13:35:00,041 INFO L421 ceAbstractionStarter]: At program point L552-3(lines 552 568) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse8 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse5 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse8) (not (= |old(~compRegistered~0)| 0)) (not .cse4) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 .cse5) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= 0 FloppyStartDevice_~InterfaceType~0) (and (and (<= ~MPR3~0 6) (and (<= .cse3 ~SKIP1~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~IPC~0) (<= .cse6 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (<= .cse7 ~SKIP2~0) (<= .cse8 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0)) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))) (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-18 13:35:00,042 INFO L421 ceAbstractionStarter]: At program point L569(lines 530 595) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse8 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse5 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse8) (not (= |old(~compRegistered~0)| 0)) (not .cse4) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 .cse5) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (and (<= ~MPR3~0 6) (and (<= .cse3 ~SKIP1~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~IPC~0) (<= .cse6 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (<= .cse7 ~SKIP2~0) (<= .cse8 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0)) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,042 INFO L421 ceAbstractionStarter]: At program point L528(line 528) the Hoare annotation is: (let ((.cse8 (+ ~NP~0 2)) (.cse11 (+ ~NP~0 5)) (.cse12 (+ ~DC~0 2)) (.cse13 (+ ~SKIP1~0 2)) (.cse9 (= 0 ~pended~0)) (.cse10 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse8) (< 6 ~MPR3~0) (< ~MPR3~0 .cse11) (< ~SKIP2~0 .cse12) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse13) (not (= |old(~compRegistered~0)| 0)) (not .cse9) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 .cse10) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (let ((.cse3 (<= ~MPR3~0 6)) (.cse5 (and (<= .cse8 ~SKIP1~0) .cse9 (= ~s~0 ~NP~0) (<= .cse10 ~IPC~0) (<= .cse11 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (<= .cse12 ~SKIP2~0) (<= .cse13 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0))) (.cse7 (<= 6 ~MPR3~0)) (.cse4 (= 0 ~customIrp~0)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0))) (or (and (<= FloppyStartDevice_~__cil_tmp42~0 259) .cse3 .cse4 .cse5 (< 258 FloppyStartDevice_~__cil_tmp42~0) .cse6 .cse7) (and (and .cse3 .cse5 (= 1 ~setEventCalled~0) .cse7) .cse4 .cse6))) (= |old(~myStatus~0)| ~myStatus~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2)))) [2018-11-18 13:35:00,042 INFO L421 ceAbstractionStarter]: At program point L495(line 495) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-18 13:35:00,045 INFO L425 ceAbstractionStarter]: For program point L528-1(line 528) no Hoare annotation was computed. [2018-11-18 13:35:00,045 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 591) no Hoare annotation was computed. [2018-11-18 13:35:00,045 INFO L425 ceAbstractionStarter]: For program point L553(lines 552 568) no Hoare annotation was computed. [2018-11-18 13:35:00,045 INFO L425 ceAbstractionStarter]: For program point L586-2(lines 586 591) no Hoare annotation was computed. [2018-11-18 13:35:00,046 INFO L421 ceAbstractionStarter]: At program point L545(lines 532 572) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse8 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse5 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse8) (not (= |old(~compRegistered~0)| 0)) (not .cse4) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 .cse5) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (and (<= ~MPR3~0 6) (and (<= .cse3 ~SKIP1~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~IPC~0) (<= .cse6 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (<= .cse7 ~SKIP2~0) (<= .cse8 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0)) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2)))) [2018-11-18 13:35:00,046 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 540) no Hoare annotation was computed. [2018-11-18 13:35:00,046 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 546 549) no Hoare annotation was computed. [2018-11-18 13:35:00,046 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 595) no Hoare annotation was computed. [2018-11-18 13:35:00,046 INFO L425 ceAbstractionStarter]: For program point L530-1(lines 530 595) no Hoare annotation was computed. [2018-11-18 13:35:00,046 INFO L421 ceAbstractionStarter]: At program point L588(lines 588 589) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~NP~0 5)) (.cse7 (+ ~DC~0 2)) (.cse8 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse5 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~MPR3~0 .cse6) (< ~SKIP2~0 .cse7) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 .cse8) (not (= |old(~compRegistered~0)| 0)) (not .cse4) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~IPC~0 .cse5) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (<= ~MPR3~0 6) (and (<= .cse3 ~SKIP1~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~IPC~0) (<= .cse6 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (<= .cse7 ~SKIP2~0) (<= .cse8 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (< 0 ~PagingReferenceCount~0)) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse1)))) [2018-11-18 13:35:00,046 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 588 589) no Hoare annotation was computed. [2018-11-18 13:35:00,046 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 519) no Hoare annotation was computed. [2018-11-18 13:35:00,046 INFO L428 ceAbstractionStarter]: At program point L1104(lines 1103 1113) the Hoare annotation is: true [2018-11-18 13:35:00,050 INFO L428 ceAbstractionStarter]: At program point L1102(lines 1101 1113) the Hoare annotation is: true [2018-11-18 13:35:00,050 INFO L425 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1094 1115) no Hoare annotation was computed. [2018-11-18 13:35:00,050 INFO L425 ceAbstractionStarter]: For program point L1101(lines 1101 1113) no Hoare annotation was computed. [2018-11-18 13:35:00,050 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 1105 1112) no Hoare annotation was computed. [2018-11-18 13:35:00,050 INFO L428 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1094 1115) the Hoare annotation is: true [2018-11-18 13:35:00,050 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 1105 1112) no Hoare annotation was computed. [2018-11-18 13:35:00,050 INFO L425 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1094 1115) no Hoare annotation was computed. [2018-11-18 13:35:00,051 INFO L425 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1072 1093) no Hoare annotation was computed. [2018-11-18 13:35:00,051 INFO L428 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1072 1093) the Hoare annotation is: true [2018-11-18 13:35:00,051 INFO L425 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1072 1093) no Hoare annotation was computed. [2018-11-18 13:35:00,051 INFO L428 ceAbstractionStarter]: At program point L1082(lines 1081 1091) the Hoare annotation is: true [2018-11-18 13:35:00,051 INFO L428 ceAbstractionStarter]: At program point L1080(lines 1079 1091) the Hoare annotation is: true [2018-11-18 13:35:00,051 INFO L425 ceAbstractionStarter]: For program point L1079(lines 1079 1091) no Hoare annotation was computed. [2018-11-18 13:35:00,051 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 1083 1090) no Hoare annotation was computed. [2018-11-18 13:35:00,051 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 1083 1090) no Hoare annotation was computed. [2018-11-18 13:35:00,051 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 809 833) no Hoare annotation was computed. [2018-11-18 13:35:00,051 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 809 833) no Hoare annotation was computed. [2018-11-18 13:35:00,051 INFO L428 ceAbstractionStarter]: At program point L822(lines 821 831) the Hoare annotation is: true [2018-11-18 13:35:00,052 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 823 830) no Hoare annotation was computed. [2018-11-18 13:35:00,052 INFO L421 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 809 833) the Hoare annotation is: (let ((.cse7 (+ ~NP~0 5)) (.cse5 (= ~s~0 ~NP~0)) (.cse4 (= 0 ~pended~0)) (.cse8 (+ ~SKIP1~0 2)) (.cse6 (+ ~DC~0 5)) (.cse3 (+ ~DC~0 2))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~MPR3~0 .cse7) (or (not .cse5) (not .cse4) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)) (< ~MPR1~0 .cse8) (< ~SKIP1~0 (+ ~s~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse6)) (< ~MPR3~0 6) (< ~SKIP2~0 .cse3) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP2~0) (<= ~MPR3~0 6) (= 0 ~customIrp~0) (and (<= (+ ~NP~0 2) ~SKIP1~0) .cse4 .cse5 (<= .cse6 ~IPC~0) (<= .cse7 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (<= .cse8 ~MPR1~0) (<= 1 ~compRegistered~0) (< 0 ~PagingReferenceCount~0)) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2)))) [2018-11-18 13:35:00,052 INFO L428 ceAbstractionStarter]: At program point L820(lines 819 831) the Hoare annotation is: true [2018-11-18 13:35:00,055 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 831) no Hoare annotation was computed. [2018-11-18 13:35:00,055 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 823 830) no Hoare annotation was computed. [2018-11-18 13:35:00,055 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1022 1029) the Hoare annotation is: true [2018-11-18 13:35:00,055 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1022 1029) no Hoare annotation was computed. [2018-11-18 13:35:00,055 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1022 1029) no Hoare annotation was computed. [2018-11-18 13:35:00,055 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 656 668) no Hoare annotation was computed. [2018-11-18 13:35:00,055 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 656 668) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 ~PagingReferenceCount~0) (< ~MPR3~0 6) (not (= |old(~s~0)| ~NP~0)) (< ~PagingReferenceCount~0 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2))) [2018-11-18 13:35:00,055 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 656 668) no Hoare annotation was computed. [2018-11-18 13:35:00,055 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 60 67) the Hoare annotation is: true [2018-11-18 13:35:00,055 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 60 67) no Hoare annotation was computed. [2018-11-18 13:35:00,055 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 60 67) no Hoare annotation was computed. [2018-11-18 13:35:00,056 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 64) no Hoare annotation was computed. [2018-11-18 13:35:00,056 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 150) no Hoare annotation was computed. [2018-11-18 13:35:00,056 INFO L425 ceAbstractionStarter]: For program point L120-2(lines 112 160) no Hoare annotation was computed. [2018-11-18 13:35:00,056 INFO L425 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 99 161) no Hoare annotation was computed. [2018-11-18 13:35:00,056 INFO L421 ceAbstractionStarter]: At program point L143(line 143) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (= 0 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-11-18 13:35:00,056 INFO L425 ceAbstractionStarter]: For program point L143-1(line 143) no Hoare annotation was computed. [2018-11-18 13:35:00,056 INFO L421 ceAbstractionStarter]: At program point L141(lines 141 142) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (= 0 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-11-18 13:35:00,056 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 141 142) no Hoare annotation was computed. [2018-11-18 13:35:00,059 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 138) no Hoare annotation was computed. [2018-11-18 13:35:00,059 INFO L421 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 99 161) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-11-18 13:35:00,059 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 128) no Hoare annotation was computed. [2018-11-18 13:35:00,060 INFO L425 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 99 161) no Hoare annotation was computed. [2018-11-18 13:35:00,060 INFO L421 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-11-18 13:35:00,060 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 125) no Hoare annotation was computed. [2018-11-18 13:35:00,060 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 152 158) no Hoare annotation was computed. [2018-11-18 13:35:00,060 INFO L421 ceAbstractionStarter]: At program point L123-2(lines 123 125) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~MPR3~0 (+ ~NP~0 5)) (= 0 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) (< ~IPC~0 (+ ~DC~0 5)) (not (= ~customIrp~0 0))) [2018-11-18 13:35:00,060 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-11-18 13:35:00,060 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 118) no Hoare annotation was computed. [2018-11-18 13:35:00,060 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 136) no Hoare annotation was computed. [2018-11-18 13:35:00,060 INFO L425 ceAbstractionStarter]: For program point L134-2(lines 134 136) no Hoare annotation was computed. [2018-11-18 13:35:00,060 INFO L425 ceAbstractionStarter]: For program point L986(lines 986 1003) no Hoare annotation was computed. [2018-11-18 13:35:00,060 INFO L425 ceAbstractionStarter]: For program point L949(lines 949 953) no Hoare annotation was computed. [2018-11-18 13:35:00,061 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 935 1007) the Hoare annotation is: (let ((.cse7 (< ~MPR3~0 (+ ~NP~0 5))) (.cse10 (not (= 0 ~pended~0))) (.cse11 (< 1 ~PagingReferenceCount~0)) (.cse12 (<= ~PagingReferenceCount~0 0)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (< ~IPC~0 (+ ~DC~0 5))) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse3 (or (or .cse7 (or (not (= |old(~s~0)| ~NP~0)) .cse10 .cse11 .cse12) .cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse14) .cse13)) (.cse4 (< ~MPR3~0 6))) (let ((.cse6 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse15 (= ~s~0 ~SKIP1~0)) (.cse9 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~customIrp~0 0))) (.cse1 (not (= ~myStatus~0 0))) (.cse16 (< 0 ~MaximumInterfaceType~0)) (.cse2 (= ~s~0 |old(~s~0)|)) (.cse17 (or .cse0 .cse3 .cse4))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 (or .cse9 .cse10 .cse11 .cse12) (not (= ~SKIP1~0 |old(~s~0)|)) .cse13 .cse14 .cse15) (or (< 0 (+ ~myStatus~0 1073741637)) .cse16 .cse2 .cse17) (or .cse6 .cse0 .cse7 .cse15 .cse13 .cse4 (< ~SKIP1~0 |old(~s~0)|) .cse8 (< |old(~s~0)| ~SKIP1~0) .cse9 .cse14 .cse5) (or .cse1 .cse16 .cse2 .cse17))))) [2018-11-18 13:35:00,062 INFO L421 ceAbstractionStarter]: At program point L978(lines 942 1006) the Hoare annotation is: (let ((.cse40 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse36 (+ ~DC~0 2)) (.cse39 (+ ~DC~0 5)) (.cse38 (+ ~SKIP1~0 2)) (.cse27 (= 0 ~pended~0)) (.cse37 (+ ~NP~0 5))) (let ((.cse6 (< ~MPR3~0 .cse37)) (.cse9 (not .cse27)) (.cse10 (< 1 ~PagingReferenceCount~0)) (.cse11 (<= ~PagingReferenceCount~0 0)) (.cse7 (< ~MPR1~0 .cse38)) (.cse14 (< ~IPC~0 .cse39)) (.cse13 (< ~SKIP2~0 .cse36)) (.cse21 (= ~MPR1~0 ~s~0)) (.cse22 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse40) 3221225494))) (.cse23 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse24 (<= (+ .cse40 1) 0)) (.cse25 (+ ~NP~0 2))) (let ((.cse19 (let ((.cse26 (<= .cse25 ~SKIP1~0)) (.cse28 (<= .cse39 ~IPC~0)) (.cse29 (<= ~PagingReferenceCount~0 1)) (.cse30 (<= .cse38 ~MPR1~0)) (.cse31 (<= 1 ~compRegistered~0)) (.cse32 (<= .cse37 ~MPR3~0)) (.cse33 (<= .cse36 ~SKIP2~0)) (.cse34 (= ~NP~0 |old(~s~0)|)) (.cse35 (< 0 ~PagingReferenceCount~0))) (or (and .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse21 .cse33 .cse22 (= 0 IofCallDriver_~returnVal2~0) .cse23 .cse24 .cse34 .cse35) (and .cse26 .cse27 .cse28 .cse29 .cse30 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse31 .cse32 .cse21 .cse33 .cse22 .cse23 .cse24 .cse34 .cse35)))) (.cse20 (= 1 ~setEventCalled~0)) (.cse15 (< 6 ~MPR3~0)) (.cse18 (or (or .cse6 (or (not (= |old(~s~0)| ~NP~0)) .cse9 .cse10 .cse11) .cse7 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse14) .cse13)) (.cse16 (< ~MPR3~0 6))) (let ((.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse4 (or .cse15 .cse18 .cse16)) (.cse0 (and (and .cse19 (<= ~MPR3~0 6) .cse20 (<= 6 ~MPR3~0)) (<= ~MaximumInterfaceType~0 0))) (.cse5 (< ~SKIP1~0 .cse25)) (.cse12 (= ~s~0 ~SKIP1~0)) (.cse8 (not (= ~compRegistered~0 0))) (.cse1 (not (= ~myStatus~0 0))) (.cse3 (and .cse21 .cse22 .cse23 .cse24 .cse20 (= IofCallDriver_~returnVal2~0 259))) (.cse17 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (< 0 (+ ~myStatus~0 1073741637)) .cse2 .cse3 .cse4 .cse0) (or .cse5 .cse6 .cse7 (or .cse8 .cse9 .cse10 .cse11) (not (= ~SKIP1~0 |old(~s~0)|)) .cse12 .cse13 .cse14) (or .cse5 .cse15 .cse6 .cse12 .cse13 .cse16 (< ~SKIP1~0 |old(~s~0)|) .cse7 (< |old(~s~0)| ~SKIP1~0) .cse8 .cse14 .cse17) (or .cse15 .cse1 .cse3 .cse18 .cse16 (and .cse19 .cse20) .cse17)))))) [2018-11-18 13:35:00,063 INFO L421 ceAbstractionStarter]: At program point L945(line 945) the Hoare annotation is: (let ((.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< 1 ~PagingReferenceCount~0)) (.cse6 (<= ~PagingReferenceCount~0 0)) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~DC~0 5))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse9 (< 6 ~MPR3~0)) (.cse12 (or (or .cse1 (or (not (= |old(~s~0)| ~NP~0)) .cse4 .cse5 .cse6) .cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse8) .cse7)) (.cse13 (< ~MPR3~0 6))) (let ((.cse10 (not (= ~myStatus~0 0))) (.cse15 (< 0 ~MaximumInterfaceType~0)) (.cse11 (= ~s~0 |old(~s~0)|)) (.cse16 (or .cse9 .cse12 .cse13)) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (not (= ~compRegistered~0 0))) (.cse14 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 (or .cse3 .cse4 .cse5 .cse6) (not (= ~SKIP1~0 |old(~s~0)|)) .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (< 0 (+ ~myStatus~0 1073741637)) .cse15 .cse11 .cse16) (or .cse10 .cse15 .cse11 .cse16) (or .cse0 .cse9 .cse1 .cse7 .cse13 (< ~SKIP1~0 |old(~s~0)|) .cse2 (< |old(~s~0)| ~SKIP1~0) .cse3 .cse8 .cse14))))) [2018-11-18 13:35:00,066 INFO L425 ceAbstractionStarter]: For program point L945-1(line 945) no Hoare annotation was computed. [2018-11-18 13:35:00,066 INFO L421 ceAbstractionStarter]: At program point L966(lines 965 980) the Hoare annotation is: (let ((.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse8 (not (= 0 ~pended~0))) (.cse9 (< 1 ~PagingReferenceCount~0)) (.cse10 (<= ~PagingReferenceCount~0 0)) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse14 (< 6 ~MPR3~0)) (.cse15 (or (or .cse5 (or (not (= |old(~s~0)| ~NP~0)) .cse8 .cse9 .cse10) .cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse12) .cse11)) (.cse16 (< ~MPR3~0 6))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or .cse14 .cse15 .cse16)) (.cse3 (not (= ~myStatus~0 0))) (.cse1 (let ((.cse18 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse18 1) 0) (= 1 ~setEventCalled~0)))) (.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse13 (= ~s~0 ~SKIP1~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse17 (not (= ~customIrp~0 0)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse3 .cse0 .cse1 .cse2) (or .cse4 .cse5 .cse6 (or .cse7 .cse8 .cse9 .cse10) (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse12 .cse13) (or .cse14 .cse3 .cse1 .cse15 .cse16 .cse17) (or .cse4 .cse14 .cse5 .cse13 .cse11 .cse16 (< ~SKIP1~0 |old(~s~0)|) .cse6 (< |old(~s~0)| ~SKIP1~0) .cse7 .cse12 .cse17))))) [2018-11-18 13:35:00,066 INFO L425 ceAbstractionStarter]: For program point L995(lines 995 1002) no Hoare annotation was computed. [2018-11-18 13:35:00,066 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 935 1007) no Hoare annotation was computed. [2018-11-18 13:35:00,066 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 981) no Hoare annotation was computed. [2018-11-18 13:35:00,067 INFO L425 ceAbstractionStarter]: For program point L987(lines 987 993) no Hoare annotation was computed. [2018-11-18 13:35:00,067 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 935 1007) no Hoare annotation was computed. [2018-11-18 13:35:00,067 INFO L421 ceAbstractionStarter]: At program point L1000(line 1000) the Hoare annotation is: (let ((.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (not (= 0 ~pended~0))) (.cse5 (< 1 ~PagingReferenceCount~0)) (.cse6 (<= ~PagingReferenceCount~0 0)) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~IPC~0 (+ ~DC~0 5))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse12 (< 6 ~MPR3~0)) (.cse13 (or (or .cse1 (or (not (= |old(~s~0)| ~NP~0)) .cse4 .cse5 .cse6) .cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse8) .cse7)) (.cse14 (< ~MPR3~0 6))) (let ((.cse10 (< 0 ~MaximumInterfaceType~0)) (.cse11 (or .cse12 .cse13 .cse14)) (.cse9 (not (= ~myStatus~0 0))) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (not (= ~compRegistered~0 0))) (.cse15 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 (or .cse3 .cse4 .cse5 .cse6) (not (= ~SKIP1~0 |old(~s~0)|)) .cse7 .cse8) (or .cse9 .cse10 .cse11) (or (< 0 (+ ~myStatus~0 1073741637)) .cse10 .cse11) (or .cse12 .cse9 .cse13 .cse14 .cse15) (or .cse0 .cse12 .cse1 .cse7 .cse14 (< ~SKIP1~0 |old(~s~0)|) .cse2 (< |old(~s~0)| ~SKIP1~0) .cse3 .cse8 .cse15))))) [2018-11-18 13:35:00,071 INFO L425 ceAbstractionStarter]: For program point L1000-1(lines 982 1004) no Hoare annotation was computed. [2018-11-18 13:35:00,071 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 980) no Hoare annotation was computed. [2018-11-18 13:35:00,071 INFO L425 ceAbstractionStarter]: For program point $Ultimate##12(lines 967 979) no Hoare annotation was computed. [2018-11-18 13:35:00,071 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 967 979) no Hoare annotation was computed. [2018-11-18 13:35:00,071 INFO L421 ceAbstractionStarter]: At program point L959(lines 958 981) the Hoare annotation is: (let ((.cse6 (< ~MPR3~0 (+ ~NP~0 5))) (.cse15 (not (= 0 ~pended~0))) (.cse16 (< 1 ~PagingReferenceCount~0)) (.cse17 (<= ~PagingReferenceCount~0 0)) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse8 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse5 (< 6 ~MPR3~0)) (.cse14 (or (or .cse6 (or (not (= |old(~s~0)| ~NP~0)) .cse15 .cse16 .cse17) .cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse12) .cse8)) (.cse9 (< ~MPR3~0 6))) (let ((.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or .cse5 .cse14 .cse9)) (.cse0 (let ((.cse18 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse18 1) 0) (= 1 ~setEventCalled~0)))) (.cse1 (not (= ~myStatus~0 0))) (.cse13 (not (= ~customIrp~0 0))) (.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (= ~s~0 ~SKIP1~0)) (.cse11 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~SKIP1~0 |old(~s~0)|) .cse10 (< |old(~s~0)| ~SKIP1~0) .cse11 .cse12 .cse13) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse2 .cse3) (or .cse5 .cse0 .cse1 .cse14 .cse9 .cse13) (or .cse4 .cse6 .cse10 .cse7 (or .cse11 .cse15 .cse16 .cse17) (not (= ~SKIP1~0 |old(~s~0)|)) .cse8 .cse12))))) [2018-11-18 13:35:00,071 INFO L421 ceAbstractionStarter]: At program point L951(line 951) the Hoare annotation is: (let ((.cse21 (+ ~DC~0 2)) (.cse17 (+ ~DC~0 5)) (.cse19 (+ ~SKIP1~0 2)) (.cse18 (= 0 ~pended~0)) (.cse20 (+ ~NP~0 5))) (let ((.cse4 (< ~MPR3~0 .cse20)) (.cse7 (not .cse18)) (.cse8 (< 1 ~PagingReferenceCount~0)) (.cse9 (<= ~PagingReferenceCount~0 0)) (.cse5 (< ~MPR1~0 .cse19)) (.cse11 (< ~IPC~0 .cse17)) (.cse10 (< ~SKIP2~0 .cse21))) (let ((.cse13 (< 6 ~MPR3~0)) (.cse14 (or (or .cse4 (or (not (= |old(~s~0)| ~NP~0)) .cse7 .cse8 .cse9) .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse11) .cse10)) (.cse15 (< ~MPR3~0 6))) (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or .cse13 .cse14 .cse15)) (.cse0 (and (let ((.cse22 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse17 ~IPC~0) .cse18 (<= ~PagingReferenceCount~0 1) (<= .cse19 ~MPR1~0) (<= 1 ~compRegistered~0) (<= .cse20 ~MPR3~0) (<= .cse21 ~SKIP2~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse22 1) 0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0) (< 0 ~PagingReferenceCount~0))) (= ~s~0 |old(~s~0)|) (= 1 ~setEventCalled~0))) (.cse12 (not (= ~myStatus~0 0))) (.cse3 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse6 (not (= ~compRegistered~0 0))) (.cse16 (not (= ~customIrp~0 0)))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse3 .cse4 .cse5 (or .cse6 .cse7 .cse8 .cse9) (not (= ~SKIP1~0 |old(~s~0)|)) .cse10 .cse11) (or .cse12 .cse1 .cse0 .cse2) (or .cse13 .cse0 .cse12 .cse14 .cse15 .cse16) (or .cse3 .cse13 .cse4 .cse10 .cse15 (< ~SKIP1~0 |old(~s~0)|) .cse5 (< |old(~s~0)| ~SKIP1~0) .cse6 .cse11 .cse16)))))) [2018-11-18 13:35:00,074 INFO L425 ceAbstractionStarter]: For program point L943(lines 943 955) no Hoare annotation was computed. [2018-11-18 13:35:00,074 INFO L425 ceAbstractionStarter]: For program point L943-1(lines 943 955) no Hoare annotation was computed. [2018-11-18 13:35:00,074 INFO L421 ceAbstractionStarter]: At program point L964(lines 963 980) the Hoare annotation is: (let ((.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse8 (not (= 0 ~pended~0))) (.cse9 (< 1 ~PagingReferenceCount~0)) (.cse10 (<= ~PagingReferenceCount~0 0)) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse14 (< 6 ~MPR3~0)) (.cse17 (or (or .cse5 (or (not (= |old(~s~0)| ~NP~0)) .cse8 .cse9 .cse10) .cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse12) .cse11)) (.cse15 (< ~MPR3~0 6))) (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or .cse14 .cse17 .cse15)) (.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse13 (= ~s~0 ~SKIP1~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse1 (let ((.cse18 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse18) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse18 1) 0) (= 1 ~setEventCalled~0)))) (.cse3 (not (= ~myStatus~0 0))) (.cse16 (not (= ~customIrp~0 0)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse3 .cse0 .cse1 .cse2) (or .cse4 .cse5 .cse6 (or .cse7 .cse8 .cse9 .cse10) (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse12 .cse13) (or .cse4 .cse14 .cse5 .cse13 .cse11 .cse15 (< ~SKIP1~0 |old(~s~0)|) .cse6 (< |old(~s~0)| ~SKIP1~0) .cse7 .cse12 .cse16) (or .cse14 .cse1 .cse3 .cse17 .cse15 .cse16))))) [2018-11-18 13:35:00,074 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 13:35:00,074 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-18 13:35:00,074 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:35:00,075 INFO L421 ceAbstractionStarter]: At program point L641(line 641) the Hoare annotation is: (let ((.cse3 (= FlFdcDeviceIo_~__cil_tmp11~0 FlFdcDeviceIo_~ntStatus~2)) (.cse4 (= 1 ~setEventCalled~0)) (.cse5 (= 259 FlFdcDeviceIo_~__cil_tmp11~0))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse3 .cse4 .cse5)) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or (and (= |old(~s~0)| ~s~0) .cse3 .cse4 .cse5) (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse2 .cse1)))) [2018-11-18 13:35:00,081 INFO L425 ceAbstractionStarter]: For program point L641-1(line 641) no Hoare annotation was computed. [2018-11-18 13:35:00,081 INFO L425 ceAbstractionStarter]: For program point L639(lines 639 644) no Hoare annotation was computed. [2018-11-18 13:35:00,081 INFO L425 ceAbstractionStarter]: For program point L639-2(lines 639 644) no Hoare annotation was computed. [2018-11-18 13:35:00,081 INFO L421 ceAbstractionStarter]: At program point L635(line 635) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (= ~s~0 |old(~s~0)|))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2))) [2018-11-18 13:35:00,081 INFO L421 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 614 648) the Hoare annotation is: (let ((.cse6 (+ ~NP~0 5)) (.cse4 (= 0 ~pended~0)) (.cse7 (+ ~SKIP1~0 2)) (.cse5 (+ ~DC~0 5)) (.cse3 (+ ~DC~0 2))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~MPR3~0 .cse6) (or (not (= |old(~s~0)| ~NP~0)) (not .cse4) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)) (< ~MPR1~0 .cse7) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse5)) (< ~MPR3~0 6) (< ~SKIP2~0 .cse3) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP2~0) (<= ~MPR3~0 6) (= 0 ~customIrp~0) (and (<= (+ ~NP~0 2) ~SKIP1~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~IPC~0) (<= .cse6 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~s~0) (<= .cse7 ~MPR1~0) (<= 1 ~compRegistered~0) (< 0 ~PagingReferenceCount~0)) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2)))) [2018-11-18 13:35:00,081 INFO L425 ceAbstractionStarter]: For program point L635-1(line 635) no Hoare annotation was computed. [2018-11-18 13:35:00,081 INFO L425 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 614 648) no Hoare annotation was computed. [2018-11-18 13:35:00,081 INFO L425 ceAbstractionStarter]: For program point L629(lines 629 631) no Hoare annotation was computed. [2018-11-18 13:35:00,082 INFO L421 ceAbstractionStarter]: At program point L626(lines 626 627) the Hoare annotation is: (let ((.cse6 (+ ~NP~0 5)) (.cse4 (= 0 ~pended~0)) (.cse7 (+ ~SKIP1~0 2)) (.cse5 (+ ~DC~0 5)) (.cse3 (+ ~DC~0 2))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~MPR3~0 .cse6) (or (not (= |old(~s~0)| ~NP~0)) (not .cse4) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)) (< ~MPR1~0 .cse7) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse5)) (< ~MPR3~0 6) (< ~SKIP2~0 .cse3) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~SKIP2~0) (<= ~MPR3~0 6) (= 0 ~customIrp~0) (and (<= (+ ~NP~0 2) ~SKIP1~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~IPC~0) (<= .cse6 ~MPR3~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~s~0) (<= .cse7 ~MPR1~0) (<= 1 ~compRegistered~0) (< 0 ~PagingReferenceCount~0)) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2)))) [2018-11-18 13:35:00,084 INFO L425 ceAbstractionStarter]: For program point L626-1(lines 626 627) no Hoare annotation was computed. [2018-11-18 13:35:00,084 INFO L425 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 614 648) no Hoare annotation was computed. [2018-11-18 13:35:00,084 INFO L425 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 92 98) no Hoare annotation was computed. [2018-11-18 13:35:00,084 INFO L428 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 92 98) the Hoare annotation is: true [2018-11-18 13:35:00,084 INFO L425 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 92 98) no Hoare annotation was computed. [2018-11-18 13:35:00,084 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:35:00,084 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (<= ~PagingReferenceCount~0 0) (= ~IPC~0 ~s~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (<= 0 ~PagingReferenceCount~0) (<= ~MaximumInterfaceType~0 0)) [2018-11-18 13:35:00,084 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 13:35:00,085 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 13:35:00,085 INFO L428 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 834 854) the Hoare annotation is: true [2018-11-18 13:35:00,085 INFO L425 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 834 854) no Hoare annotation was computed. [2018-11-18 13:35:00,085 INFO L428 ceAbstractionStarter]: At program point L843(lines 842 852) the Hoare annotation is: true [2018-11-18 13:35:00,085 INFO L428 ceAbstractionStarter]: At program point L841(lines 840 852) the Hoare annotation is: true [2018-11-18 13:35:00,085 INFO L425 ceAbstractionStarter]: For program point L840(lines 840 852) no Hoare annotation was computed. [2018-11-18 13:35:00,085 INFO L425 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 834 854) no Hoare annotation was computed. [2018-11-18 13:35:00,085 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 844 851) no Hoare annotation was computed. [2018-11-18 13:35:00,085 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 844 851) no Hoare annotation was computed. [2018-11-18 13:35:00,085 INFO L428 ceAbstractionStarter]: At program point L864(lines 863 875) the Hoare annotation is: true [2018-11-18 13:35:00,085 INFO L425 ceAbstractionStarter]: For program point L863(lines 863 875) no Hoare annotation was computed. [2018-11-18 13:35:00,085 INFO L425 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 855 877) no Hoare annotation was computed. [2018-11-18 13:35:00,087 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 867 874) no Hoare annotation was computed. [2018-11-18 13:35:00,087 INFO L428 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 855 877) the Hoare annotation is: true [2018-11-18 13:35:00,087 INFO L425 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 855 877) no Hoare annotation was computed. [2018-11-18 13:35:00,087 INFO L428 ceAbstractionStarter]: At program point L866(lines 865 875) the Hoare annotation is: true [2018-11-18 13:35:00,087 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 867 874) no Hoare annotation was computed. [2018-11-18 13:35:00,087 INFO L428 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1116 1136) the Hoare annotation is: true [2018-11-18 13:35:00,087 INFO L425 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1116 1136) no Hoare annotation was computed. [2018-11-18 13:35:00,088 INFO L428 ceAbstractionStarter]: At program point L1125(lines 1124 1134) the Hoare annotation is: true [2018-11-18 13:35:00,088 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 1126 1133) no Hoare annotation was computed. [2018-11-18 13:35:00,088 INFO L428 ceAbstractionStarter]: At program point L1123(lines 1122 1134) the Hoare annotation is: true [2018-11-18 13:35:00,088 INFO L425 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1116 1136) no Hoare annotation was computed. [2018-11-18 13:35:00,088 INFO L425 ceAbstractionStarter]: For program point L1122(lines 1122 1134) no Hoare annotation was computed. [2018-11-18 13:35:00,088 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 1126 1133) no Hoare annotation was computed. [2018-11-18 13:35:00,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:35:00 BoogieIcfgContainer [2018-11-18 13:35:00,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:35:00,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:35:00,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:35:00,145 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:35:00,146 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:34:31" (3/4) ... [2018-11-18 13:35:00,149 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-18 13:35:00,156 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-18 13:35:00,157 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-18 13:35:00,157 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-18 13:35:00,157 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-18 13:35:00,157 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-18 13:35:00,157 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-18 13:35:00,157 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-18 13:35:00,157 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-18 13:35:00,157 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-18 13:35:00,157 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 13:35:00,157 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-18 13:35:00,157 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-18 13:35:00,158 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-18 13:35:00,158 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-18 13:35:00,158 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-18 13:35:00,169 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2018-11-18 13:35:00,170 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2018-11-18 13:35:00,171 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 13:35:00,172 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 13:35:00,198 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || (((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(compRegistered) == 0)) || (((((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(0 == \old(pended))) || (((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 13:35:00,198 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || ((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || (((((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(0 == \old(pended))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 13:35:00,198 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || (((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(IPC))) || (((((NP + 2 <= SKIP1 && ((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3)) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0) [2018-11-18 13:35:00,199 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((NP + 2 <= SKIP1 && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1 && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)))) || !(\old(s) == \old(DC))) || (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0)) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || (((MPR3 <= 6 && NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1 && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0))) && 6 <= MPR3) && !(259 == status))) || (((status == lowerDriverReturn && NP + 2 <= SKIP1) && (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0) && SKIP2 <= s)) || ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 13:35:00,199 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || (((((((NP + 2 <= SKIP1 && ((NP + 5 <= MPR3 && 0 == pended) && PagingReferenceCount <= 1) && 0 < PagingReferenceCount) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0) && lowerDriverReturn == ntStatus)) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && compRegistered <= 0)) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s))) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == compRegistered) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) || (((MPR3 <= 6 && ((NP + 2 <= SKIP1 && (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && 0 < PagingReferenceCount) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 6 <= MPR3) && !(259 == ntStatus))) || ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && compRegistered <= 0) && 6 <= MPR3)) && ((((((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((NP + 2 <= SKIP1 && ((NP + 5 <= MPR3 && 0 == pended) && PagingReferenceCount <= 1) && 0 < PagingReferenceCount) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0) && lowerDriverReturn == ntStatus)) || !(\old(myStatus) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && compRegistered <= 0)) || 0 < MaximumInterfaceType) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s))) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == compRegistered) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) || (((MPR3 <= 6 && ((NP + 2 <= SKIP1 && (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && 0 < PagingReferenceCount) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 6 <= MPR3) && !(259 == ntStatus))) || ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && compRegistered <= 0) && 6 <= MPR3)) [2018-11-18 13:35:00,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp) || ((((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((((((\old(s) == s && 0 == customIrp) && \old(customIrp) == 1) && 1 == setEventCalled) || ((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5)) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(myStatus == 0)) || MPR3 < 6) || SKIP2 < DC + 2) || (s == NP && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3)) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (s == \old(s) && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-11-18 13:35:00,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp) || ((((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((((((\old(s) == s && 0 == customIrp) && \old(customIrp) == 1) && 1 == setEventCalled) || ((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5)) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(myStatus == 0)) || MPR3 < 6) || SKIP2 < DC + 2) || (s == NP && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3)) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (s == \old(s) && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0)) [2018-11-18 13:35:00,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= PagingReferenceCount) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3)) || !(\old(s) == \old(IPC))) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && NP + 5 <= MPR3) && 0 == myStatus) && DC + 2 <= SKIP2) && 0 <= PagingReferenceCount) && MPR3 <= 6) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 13:35:00,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(PagingReferenceCount) < 0) || 0 <= status) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-18 13:35:00,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && (((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6)) && (((((6 < MPR3 || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || !(myStatus == 0)) || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(customIrp == 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || ((!(compRegistered == 0) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-18 13:35:00,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount)) && MPR3 <= 6) && 1 == setEventCalled) && 6 <= MPR3) && MaximumInterfaceType <= 0) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && ((((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount)) && MPR3 <= 6) && 1 == setEventCalled) && 6 <= MPR3) && MaximumInterfaceType <= 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || ((!(compRegistered == 0) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(SKIP1 == \old(s))) || s == SKIP1) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && ((((((6 < MPR3 || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259)) || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount)) && 1 == setEventCalled)) || !(customIrp == 0)) [2018-11-18 13:35:00,201 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((1 == setEventCalled && \old(customIrp) == customIrp) && \old(s) == s)) && ((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || !(\old(customIrp) == 0)) || \old(s) < MPR3)) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || (s == \old(s) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((((s == \old(s) && 1 == setEventCalled) && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5) [2018-11-18 13:35:00,201 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6)) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || ((!(compRegistered == 0) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || s == SKIP1)) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && (((((6 < MPR3 || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || !(myStatus == 0)) || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(customIrp == 0)) [2018-11-18 13:35:00,201 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6)) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || ((!(compRegistered == 0) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || s == SKIP1)) && (((((6 < MPR3 || !(myStatus == 0)) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0)) [2018-11-18 13:35:00,202 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || (((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || 0 < MaximumInterfaceType) [2018-11-18 13:35:00,202 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((0 <= InterfaceType && ((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((0 <= InterfaceType && ((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) [2018-11-18 13:35:00,202 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || (((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || 0 < MaximumInterfaceType) [2018-11-18 13:35:00,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount)) [2018-11-18 13:35:00,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) [2018-11-18 13:35:00,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) [2018-11-18 13:35:00,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) [2018-11-18 13:35:00,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) [2018-11-18 13:35:00,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) [2018-11-18 13:35:00,287 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f43be091-0d5b-4a93-b6a0-7b5b41427abf/bin-2019/uautomizer/witness.graphml [2018-11-18 13:35:00,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:35:00,288 INFO L168 Benchmark]: Toolchain (without parser) took 30180.57 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 844.1 MB). Free memory was 956.6 MB in the beginning and 1.3 GB in the end (delta: -345.7 MB). Peak memory consumption was 498.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:35:00,289 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:35:00,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.18 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:35:00,289 INFO L168 Benchmark]: Boogie Preprocessor took 93.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:35:00,289 INFO L168 Benchmark]: RCFGBuilder took 673.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.4 MB). Peak memory consumption was 90.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:35:00,289 INFO L168 Benchmark]: TraceAbstraction took 28951.35 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 703.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -297.8 MB). Peak memory consumption was 912.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:35:00,290 INFO L168 Benchmark]: Witness Printer took 142.32 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:35:00,295 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.18 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 673.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.4 MB). Peak memory consumption was 90.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28951.35 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 703.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -297.8 MB). Peak memory consumption was 912.5 MB. Max. memory is 11.5 GB. * Witness Printer took 142.32 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 64]: 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: 218]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 == myStatus) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) - InvariantResult [Line: 887]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: ((((((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6)) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || ((!(compRegistered == 0) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || s == SKIP1)) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && (((((6 < MPR3 || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || !(myStatus == 0)) || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(customIrp == 0)) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1035]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((1 == setEventCalled && \old(customIrp) == customIrp) && \old(s) == s)) && ((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || !(myStatus == 0)) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || !(\old(customIrp) == 0)) || \old(s) < MPR3)) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || (s == \old(s) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0))) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((((s == \old(s) && 1 == setEventCalled) && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5) - InvariantResult [Line: 749]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || ((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || (((((DC == s && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(0 == \old(pended))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 532]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || (((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || 0 < MaximumInterfaceType) - InvariantResult [Line: 863]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1124]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || (((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || 0 < MaximumInterfaceType) - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: (((((((((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp) || ((((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((((((\old(s) == s && 0 == customIrp) && \old(customIrp) == 1) && 1 == setEventCalled) || ((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5)) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(myStatus == 0)) || MPR3 < 6) || SKIP2 < DC + 2) || (s == NP && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3)) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (s == \old(s) && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1101]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 865]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 842]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((0 <= InterfaceType && ((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((0 <= InterfaceType && ((MPR3 <= 6 && (((((((((NP + 2 <= SKIP1 && 0 == pended) && s == NP) && DC + 5 <= IPC) && NP + 5 <= MPR3) && PagingReferenceCount <= 1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP == \old(s)) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || (((((((NP + 2 <= SKIP1 && ((NP + 5 <= MPR3 && 0 == pended) && PagingReferenceCount <= 1) && 0 < PagingReferenceCount) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0) && lowerDriverReturn == ntStatus)) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && compRegistered <= 0)) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s))) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == compRegistered) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) || (((MPR3 <= 6 && ((NP + 2 <= SKIP1 && (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && 0 < PagingReferenceCount) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 6 <= MPR3) && !(259 == ntStatus))) || ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && compRegistered <= 0) && 6 <= MPR3)) && ((((((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((((NP + 2 <= SKIP1 && ((NP + 5 <= MPR3 && 0 == pended) && PagingReferenceCount <= 1) && 0 < PagingReferenceCount) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0) && lowerDriverReturn == ntStatus)) || !(\old(myStatus) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && compRegistered <= 0)) || 0 < MaximumInterfaceType) || ((((((((NP + 2 <= SKIP1 && DC == s) && ntStatus + 1073741823 <= 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s))) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == compRegistered) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3)) || (((MPR3 <= 6 && ((NP + 2 <= SKIP1 && (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && 0 < PagingReferenceCount) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 6 <= MPR3) && !(259 == ntStatus))) || ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && lowerDriverReturn == ntStatus) && !(MPR3 == \old(s))) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && compRegistered <= 0) && 6 <= MPR3)) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) - InvariantResult [Line: 958]: Loop Invariant Derived loop invariant: ((((((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && (((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6)) && (((((6 < MPR3 || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || !(myStatus == 0)) || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(customIrp == 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || s == SKIP1) || ((!(compRegistered == 0) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 1103]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 965]: Loop Invariant Derived loop invariant: ((((((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6)) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || ((!(compRegistered == 0) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) || s == SKIP1)) && (((((6 < MPR3 || !(myStatus == 0)) || ((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled)) || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || !(customIrp == 0))) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0)) - InvariantResult [Line: 821]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 840]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 734]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(PagingReferenceCount) < 0) || 0 <= status) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount)) - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) - InvariantResult [Line: 732]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 <= PagingReferenceCount) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3)) || !(\old(s) == \old(IPC))) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && NP + 5 <= MPR3) && 0 == myStatus) && DC + 2 <= SKIP2) && 0 <= PagingReferenceCount) && MPR3 <= 6) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0) && 6 <= MPR3)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 757]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || (((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(IPC))) || (((((NP + 2 <= SKIP1 && ((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3)) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0) - InvariantResult [Line: 1081]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1059]: Loop Invariant Derived loop invariant: (((((((((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp) || ((((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((((((\old(s) == s && 0 == customIrp) && \old(customIrp) == 1) && 1 == setEventCalled) || ((\old(s) == s && 1 == setEventCalled) && \old(customIrp) == customIrp)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((!(\old(setEventCalled) == 1) || 6 < MPR3) || MPR3 < NP + 5) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || IPC < DC + 5)) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (s == NP && \old(customIrp) == customIrp)) || (((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || MPR3 < 6) || SKIP2 < DC + 2) || \old(s) < MPR3)) && (((((((((((!(\old(setEventCalled) == 1) || SKIP1 < NP + 2) || 6 < MPR3) || ((((MPR3 < NP + 5 || !(0 == pended)) || 1 < PagingReferenceCount) || compRegistered < 1) || PagingReferenceCount <= 0) || IPC < DC + 5) || !(myStatus == 0)) || MPR3 < 6) || SKIP2 < DC + 2) || (s == NP && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3)) && ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (s == \old(s) && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || IPC < DC + 5) || !(\old(customIrp) == 0)) - InvariantResult [Line: 703]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || (((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(compRegistered) == 0)) || (((((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((((((((status == lowerDriverReturn && 0 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && compRegistered <= 0)) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || (((((((NP + 2 <= SKIP1 && DC == s) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(0 == \old(pended))) || (((((NP + 2 <= SKIP1 && (((DC == s && 0 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && 6 <= MPR3) && !(259 == status))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 906]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) - InvariantResult [Line: 1122]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) && (((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || !(\old(s) == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || IPC < DC + 5) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && s == NP) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((NP + 2 <= SKIP1 && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1 && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)))) || !(\old(s) == \old(DC))) || (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0)) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || (((MPR3 <= 6 && NP + 2 <= SKIP1 && SKIP1 + 2 <= MPR1 && ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0))) && 6 <= MPR3) && !(259 == status))) || (((status == lowerDriverReturn && NP + 2 <= SKIP1) && (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0) && SKIP2 <= s)) || ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || ((((DC == s && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && status + 1073741738 <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount)) && MPR3 <= 6) && 1 == setEventCalled) && 6 <= MPR3) && MaximumInterfaceType <= 0) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) && ((((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259)) || (6 < MPR3 || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || (((((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount)) && MPR3 <= 6) && 1 == setEventCalled) && 6 <= MPR3) && MaximumInterfaceType <= 0))) && (((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || MPR1 < SKIP1 + 2) || ((!(compRegistered == 0) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(SKIP1 == \old(s))) || s == SKIP1) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((((((SKIP1 < NP + 2 || 6 < MPR3) || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || MPR3 < 6) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || IPC < DC + 5) || !(customIrp == 0))) && ((((((6 < MPR3 || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 == setEventCalled) && returnVal2 == 259)) || (((((MPR3 < NP + 5 || ((!(\old(s) == NP) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || MPR1 < SKIP1 + 2) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || ((((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount) || ((((((((((((((NP + 2 <= SKIP1 && 0 == pended) && DC + 5 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) && 0 < PagingReferenceCount)) && 1 == setEventCalled)) || !(customIrp == 0)) - InvariantResult [Line: 885]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 334 locations, 1 error locations. SAFE Result, 28.8s OverallTime, 48 OverallIterations, 2 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 14.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 15861 SDtfs, 8715 SDslu, 45950 SDs, 0 SdLazy, 9243 SolverSat, 1458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 922 GetRequests, 579 SyntacticMatches, 14 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=956occurred in iteration=8, 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: 1.4s AutomataMinimizationTime, 48 MinimizatonAttempts, 1886 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 117 LocationsWithAnnotation, 2124 PreInvPairs, 2421 NumberOfFragments, 20656 HoareAnnotationTreeSize, 2124 FomulaSimplifications, 98640 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 117 FomulaSimplificationsInter, 250662 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 4009 NumberOfCodeBlocks, 4009 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3958 ConstructedInterpolants, 0 QuantifiedInterpolants, 653993 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3718 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 51 InterpolantComputations, 48 PerfectInterpolantSequences, 298/307 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...