./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/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 9187bc92090d01e0892e8fd14c7d6a75e3556b66 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:20:50,152 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:20:50,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:20:50,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:20:50,160 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:20:50,160 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:20:50,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:20:50,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:20:50,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:20:50,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:20:50,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:20:50,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:20:50,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:20:50,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:20:50,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:20:50,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:20:50,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:20:50,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:20:50,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:20:50,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:20:50,173 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:20:50,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:20:50,176 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:20:50,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:20:50,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:20:50,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:20:50,178 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:20:50,178 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:20:50,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:20:50,179 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:20:50,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:20:50,180 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:20:50,180 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:20:50,180 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:20:50,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:20:50,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:20:50,181 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:20:50,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:20:50,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:20:50,192 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:20:50,192 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:20:50,193 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:20:50,193 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:20:50,193 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:20:50,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:20:50,193 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:20:50,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:20:50,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:20:50,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:20:50,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:20:50,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:20:50,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:20:50,194 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:20:50,194 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:20:50,194 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:20:50,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:20:50,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:20:50,195 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:20:50,195 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:20:50,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:20:50,195 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:20:50,195 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:20:50,195 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:20:50,195 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:20:50,196 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:20:50,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:20:50,196 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_fd8da68f-eb59-400b-801b-229a485ced26/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 -> 9187bc92090d01e0892e8fd14c7d6a75e3556b66 [2018-11-10 12:20:50,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:20:50,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:20:50,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:20:50,228 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:20:50,228 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:20:50,229 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 12:20:50,264 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/bin-2019/uautomizer/data/a58904f6c/f4f350938bc34f769895b2fb9397a1a2/FLAGe8c72a093 [2018-11-10 12:20:50,715 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:20:50,716 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 12:20:50,725 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/bin-2019/uautomizer/data/a58904f6c/f4f350938bc34f769895b2fb9397a1a2/FLAGe8c72a093 [2018-11-10 12:20:50,735 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/bin-2019/uautomizer/data/a58904f6c/f4f350938bc34f769895b2fb9397a1a2 [2018-11-10 12:20:50,738 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:20:50,739 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:20:50,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:20:50,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:20:50,743 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:20:50,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:20:50" (1/1) ... [2018-11-10 12:20:50,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d98d4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:50, skipping insertion in model container [2018-11-10 12:20:50,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:20:50" (1/1) ... [2018-11-10 12:20:50,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:20:50,796 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:20:51,016 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:20:51,018 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:20:51,074 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:20:51,089 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:20:51,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:51 WrapperNode [2018-11-10 12:20:51,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:20:51,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:20:51,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:20:51,090 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:20:51,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:51" (1/1) ... [2018-11-10 12:20:51,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:51" (1/1) ... [2018-11-10 12:20:51,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:51" (1/1) ... [2018-11-10 12:20:51,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:51" (1/1) ... [2018-11-10 12:20:51,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:51" (1/1) ... [2018-11-10 12:20:51,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:51" (1/1) ... [2018-11-10 12:20:51,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:51" (1/1) ... [2018-11-10 12:20:51,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:20:51,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:20:51,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:20:51,187 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:20:51,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/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-10 12:20:51,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:20:51,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:20:51,235 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-10 12:20:51,235 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-10 12:20:51,235 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-10 12:20:51,235 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-10 12:20:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-10 12:20:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-10 12:20:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-10 12:20:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2018-11-10 12:20:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-10 12:20:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:20:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-10 12:20:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-10 12:20:51,236 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-10 12:20:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-10 12:20:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-10 12:20:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-10 12:20:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-10 12:20:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-10 12:20:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-10 12:20:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-10 12:20:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-10 12:20:51,238 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-10 12:20:51,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-10 12:20:51,238 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-11-10 12:20:51,238 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-11-10 12:20:51,238 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-11-10 12:20:51,238 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-11-10 12:20:51,238 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-10 12:20:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:20:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-10 12:20:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 12:20:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-10 12:20:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-10 12:20:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-10 12:20:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-10 12:20:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-10 12:20:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-10 12:20:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-10 12:20:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-10 12:20:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-10 12:20:51,239 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-10 12:20:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-10 12:20:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-10 12:20:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-10 12:20:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-10 12:20:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-10 12:20:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-10 12:20:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-10 12:20:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-10 12:20:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-10 12:20:51,240 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-11-10 12:20:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-11-10 12:20:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-11-10 12:20:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-11-10 12:20:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-10 12:20:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-10 12:20:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-10 12:20:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2018-11-10 12:20:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-10 12:20:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:20:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-10 12:20:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:20:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:20:51,416 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,416 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:51,458 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,458 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:51,471 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,471 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:51,629 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,629 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:51,701 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,701 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:51,801 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,802 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:51,816 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,816 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:51,826 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,826 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:51,860 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,860 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:51,881 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,882 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:51,992 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,992 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:51,996 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:51,996 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:52,020 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:20:52,020 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:20:52,030 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:20:52,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:20:52 BoogieIcfgContainer [2018-11-10 12:20:52,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:20:52,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:20:52,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:20:52,034 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:20:52,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:20:50" (1/3) ... [2018-11-10 12:20:52,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85a0c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:20:52, skipping insertion in model container [2018-11-10 12:20:52,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:51" (2/3) ... [2018-11-10 12:20:52,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85a0c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:20:52, skipping insertion in model container [2018-11-10 12:20:52,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:20:52" (3/3) ... [2018-11-10 12:20:52,036 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 12:20:52,041 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:20:52,046 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:20:52,056 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:20:52,084 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:20:52,085 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:20:52,085 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:20:52,085 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:20:52,085 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:20:52,085 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:20:52,085 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:20:52,085 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:20:52,085 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:20:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states. [2018-11-10 12:20:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 12:20:52,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:52,110 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-10 12:20:52,112 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:52,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:52,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1098335980, now seen corresponding path program 1 times [2018-11-10 12:20:52,118 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:52,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:52,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:52,286 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-10 12:20:52,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:52,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:52,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:52,301 INFO L87 Difference]: Start difference. First operand 390 states. Second operand 3 states. [2018-11-10 12:20:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:52,404 INFO L93 Difference]: Finished difference Result 626 states and 911 transitions. [2018-11-10 12:20:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:52,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 12:20:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:52,415 INFO L225 Difference]: With dead ends: 626 [2018-11-10 12:20:52,415 INFO L226 Difference]: Without dead ends: 381 [2018-11-10 12:20:52,419 INFO L605 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-10 12:20:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-10 12:20:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-10 12:20:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-10 12:20:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 524 transitions. [2018-11-10 12:20:52,473 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 524 transitions. Word has length 20 [2018-11-10 12:20:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:52,473 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 524 transitions. [2018-11-10 12:20:52,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 524 transitions. [2018-11-10 12:20:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:20:52,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:52,475 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] [2018-11-10 12:20:52,475 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:52,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:52,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1064921131, now seen corresponding path program 1 times [2018-11-10 12:20:52,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:52,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:52,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:52,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:52,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:52,567 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-10 12:20:52,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:52,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:52,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:52,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:52,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:52,569 INFO L87 Difference]: Start difference. First operand 381 states and 524 transitions. Second operand 3 states. [2018-11-10 12:20:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:52,747 INFO L93 Difference]: Finished difference Result 702 states and 953 transitions. [2018-11-10 12:20:52,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:52,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 12:20:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:52,751 INFO L225 Difference]: With dead ends: 702 [2018-11-10 12:20:52,752 INFO L226 Difference]: Without dead ends: 538 [2018-11-10 12:20:52,753 INFO L605 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-10 12:20:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-11-10 12:20:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 521. [2018-11-10 12:20:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-11-10 12:20:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 708 transitions. [2018-11-10 12:20:52,788 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 708 transitions. Word has length 25 [2018-11-10 12:20:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:52,789 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 708 transitions. [2018-11-10 12:20:52,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 708 transitions. [2018-11-10 12:20:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 12:20:52,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:52,790 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] [2018-11-10 12:20:52,791 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:52,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:52,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1723045672, now seen corresponding path program 1 times [2018-11-10 12:20:52,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:52,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:52,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:52,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:52,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:52,873 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-10 12:20:52,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:52,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:52,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:52,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:52,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:52,874 INFO L87 Difference]: Start difference. First operand 521 states and 708 transitions. Second operand 3 states. [2018-11-10 12:20:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:52,928 INFO L93 Difference]: Finished difference Result 644 states and 861 transitions. [2018-11-10 12:20:52,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:52,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 12:20:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:52,932 INFO L225 Difference]: With dead ends: 644 [2018-11-10 12:20:52,932 INFO L226 Difference]: Without dead ends: 625 [2018-11-10 12:20:52,933 INFO L605 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-10 12:20:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-10 12:20:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 579. [2018-11-10 12:20:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-10 12:20:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 782 transitions. [2018-11-10 12:20:52,959 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 782 transitions. Word has length 31 [2018-11-10 12:20:52,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:52,959 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 782 transitions. [2018-11-10 12:20:52,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 782 transitions. [2018-11-10 12:20:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 12:20:52,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:52,961 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] [2018-11-10 12:20:52,961 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:52,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:52,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1972802819, now seen corresponding path program 1 times [2018-11-10 12:20:52,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:52,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:52,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:52,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:52,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:53,021 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-10 12:20:53,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:53,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:53,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:53,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:53,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:53,022 INFO L87 Difference]: Start difference. First operand 579 states and 782 transitions. Second operand 3 states. [2018-11-10 12:20:53,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:53,099 INFO L93 Difference]: Finished difference Result 1086 states and 1461 transitions. [2018-11-10 12:20:53,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:53,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 12:20:53,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:53,103 INFO L225 Difference]: With dead ends: 1086 [2018-11-10 12:20:53,103 INFO L226 Difference]: Without dead ends: 792 [2018-11-10 12:20:53,105 INFO L605 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-10 12:20:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-11-10 12:20:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 763. [2018-11-10 12:20:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-10 12:20:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1034 transitions. [2018-11-10 12:20:53,143 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1034 transitions. Word has length 33 [2018-11-10 12:20:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:53,143 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 1034 transitions. [2018-11-10 12:20:53,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1034 transitions. [2018-11-10 12:20:53,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 12:20:53,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:53,145 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] [2018-11-10 12:20:53,145 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:53,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:53,146 INFO L82 PathProgramCache]: Analyzing trace with hash 234590186, now seen corresponding path program 1 times [2018-11-10 12:20:53,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:53,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:53,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:53,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:53,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:53,179 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-10 12:20:53,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:53,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:53,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:53,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:53,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:53,180 INFO L87 Difference]: Start difference. First operand 763 states and 1034 transitions. Second operand 3 states. [2018-11-10 12:20:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:53,310 INFO L93 Difference]: Finished difference Result 799 states and 1076 transitions. [2018-11-10 12:20:53,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:53,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 12:20:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:53,314 INFO L225 Difference]: With dead ends: 799 [2018-11-10 12:20:53,315 INFO L226 Difference]: Without dead ends: 794 [2018-11-10 12:20:53,316 INFO L605 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-10 12:20:53,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-10 12:20:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2018-11-10 12:20:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-10 12:20:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1069 transitions. [2018-11-10 12:20:53,349 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1069 transitions. Word has length 38 [2018-11-10 12:20:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:53,350 INFO L481 AbstractCegarLoop]: Abstraction has 792 states and 1069 transitions. [2018-11-10 12:20:53,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1069 transitions. [2018-11-10 12:20:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 12:20:53,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:53,352 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] [2018-11-10 12:20:53,352 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:53,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash 800532412, now seen corresponding path program 1 times [2018-11-10 12:20:53,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:53,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:53,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:53,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:53,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:53,407 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-10 12:20:53,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:53,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:53,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:53,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:53,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:53,408 INFO L87 Difference]: Start difference. First operand 792 states and 1069 transitions. Second operand 3 states. [2018-11-10 12:20:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:53,520 INFO L93 Difference]: Finished difference Result 807 states and 1089 transitions. [2018-11-10 12:20:53,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:53,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-10 12:20:53,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:53,525 INFO L225 Difference]: With dead ends: 807 [2018-11-10 12:20:53,525 INFO L226 Difference]: Without dead ends: 804 [2018-11-10 12:20:53,526 INFO L605 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-10 12:20:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-10 12:20:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 803. [2018-11-10 12:20:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-11-10 12:20:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1083 transitions. [2018-11-10 12:20:53,558 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1083 transitions. Word has length 38 [2018-11-10 12:20:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:53,559 INFO L481 AbstractCegarLoop]: Abstraction has 803 states and 1083 transitions. [2018-11-10 12:20:53,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1083 transitions. [2018-11-10 12:20:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 12:20:53,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:53,560 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] [2018-11-10 12:20:53,560 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:53,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:53,560 INFO L82 PathProgramCache]: Analyzing trace with hash -865990947, now seen corresponding path program 1 times [2018-11-10 12:20:53,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:53,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:53,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:53,595 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-10 12:20:53,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:53,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:20:53,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:20:53,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:20:53,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:53,596 INFO L87 Difference]: Start difference. First operand 803 states and 1083 transitions. Second operand 5 states. [2018-11-10 12:20:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:53,658 INFO L93 Difference]: Finished difference Result 816 states and 1097 transitions. [2018-11-10 12:20:53,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:20:53,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-10 12:20:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:53,662 INFO L225 Difference]: With dead ends: 816 [2018-11-10 12:20:53,662 INFO L226 Difference]: Without dead ends: 801 [2018-11-10 12:20:53,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:20:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-10 12:20:53,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-10 12:20:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-10 12:20:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1079 transitions. [2018-11-10 12:20:53,695 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1079 transitions. Word has length 39 [2018-11-10 12:20:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:53,695 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1079 transitions. [2018-11-10 12:20:53,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:20:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1079 transitions. [2018-11-10 12:20:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 12:20:53,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:53,697 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-10 12:20:53,697 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:53,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:53,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1772394300, now seen corresponding path program 1 times [2018-11-10 12:20:53,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:53,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:53,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:53,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:53,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:53,733 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-10 12:20:53,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:53,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:20:53,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:20:53,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:20:53,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:53,734 INFO L87 Difference]: Start difference. First operand 801 states and 1079 transitions. Second operand 5 states. [2018-11-10 12:20:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:53,803 INFO L93 Difference]: Finished difference Result 814 states and 1093 transitions. [2018-11-10 12:20:53,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:20:53,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-10 12:20:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:53,807 INFO L225 Difference]: With dead ends: 814 [2018-11-10 12:20:53,807 INFO L226 Difference]: Without dead ends: 794 [2018-11-10 12:20:53,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:20:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-10 12:20:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2018-11-10 12:20:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-11-10 12:20:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1070 transitions. [2018-11-10 12:20:53,836 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1070 transitions. Word has length 40 [2018-11-10 12:20:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:53,836 INFO L481 AbstractCegarLoop]: Abstraction has 794 states and 1070 transitions. [2018-11-10 12:20:53,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:20:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1070 transitions. [2018-11-10 12:20:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 12:20:53,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:53,838 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-10 12:20:53,838 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:53,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:53,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1726819464, now seen corresponding path program 1 times [2018-11-10 12:20:53,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:53,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:53,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:53,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:53,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:53,873 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-10 12:20:53,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:53,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:53,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:53,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:53,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:53,874 INFO L87 Difference]: Start difference. First operand 794 states and 1070 transitions. Second operand 3 states. [2018-11-10 12:20:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:53,973 INFO L93 Difference]: Finished difference Result 1176 states and 1598 transitions. [2018-11-10 12:20:53,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:53,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-10 12:20:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:53,979 INFO L225 Difference]: With dead ends: 1176 [2018-11-10 12:20:53,979 INFO L226 Difference]: Without dead ends: 1173 [2018-11-10 12:20:53,980 INFO L605 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-10 12:20:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2018-11-10 12:20:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 919. [2018-11-10 12:20:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-11-10 12:20:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1241 transitions. [2018-11-10 12:20:54,023 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1241 transitions. Word has length 44 [2018-11-10 12:20:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:54,023 INFO L481 AbstractCegarLoop]: Abstraction has 919 states and 1241 transitions. [2018-11-10 12:20:54,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:54,023 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1241 transitions. [2018-11-10 12:20:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:20:54,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:54,024 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-10 12:20:54,024 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:54,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:54,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1534169537, now seen corresponding path program 1 times [2018-11-10 12:20:54,025 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:54,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:54,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:54,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:54,073 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-10 12:20:54,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:54,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:20:54,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:20:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:20:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:54,074 INFO L87 Difference]: Start difference. First operand 919 states and 1241 transitions. Second operand 5 states. [2018-11-10 12:20:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:54,360 INFO L93 Difference]: Finished difference Result 927 states and 1247 transitions. [2018-11-10 12:20:54,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:20:54,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-10 12:20:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:54,363 INFO L225 Difference]: With dead ends: 927 [2018-11-10 12:20:54,363 INFO L226 Difference]: Without dead ends: 921 [2018-11-10 12:20:54,363 INFO L605 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-10 12:20:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-11-10 12:20:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 919. [2018-11-10 12:20:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-11-10 12:20:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1240 transitions. [2018-11-10 12:20:54,388 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1240 transitions. Word has length 43 [2018-11-10 12:20:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:54,389 INFO L481 AbstractCegarLoop]: Abstraction has 919 states and 1240 transitions. [2018-11-10 12:20:54,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:20:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1240 transitions. [2018-11-10 12:20:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:20:54,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:54,390 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-10 12:20:54,390 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:54,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1988047197, now seen corresponding path program 1 times [2018-11-10 12:20:54,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:54,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:54,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:54,432 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-10 12:20:54,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:54,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:20:54,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:20:54,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:20:54,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:20:54,433 INFO L87 Difference]: Start difference. First operand 919 states and 1240 transitions. Second operand 4 states. [2018-11-10 12:20:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:54,476 INFO L93 Difference]: Finished difference Result 947 states and 1273 transitions. [2018-11-10 12:20:54,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:20:54,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-10 12:20:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:54,479 INFO L225 Difference]: With dead ends: 947 [2018-11-10 12:20:54,479 INFO L226 Difference]: Without dead ends: 925 [2018-11-10 12:20:54,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-10 12:20:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 921. [2018-11-10 12:20:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-11-10 12:20:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1242 transitions. [2018-11-10 12:20:54,505 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1242 transitions. Word has length 42 [2018-11-10 12:20:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:54,505 INFO L481 AbstractCegarLoop]: Abstraction has 921 states and 1242 transitions. [2018-11-10 12:20:54,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:20:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1242 transitions. [2018-11-10 12:20:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:20:54,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:54,506 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] [2018-11-10 12:20:54,507 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:54,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:54,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1753737204, now seen corresponding path program 1 times [2018-11-10 12:20:54,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:54,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:54,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:54,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:54,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:54,556 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-10 12:20:54,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:54,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:20:54,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:20:54,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:20:54,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:54,557 INFO L87 Difference]: Start difference. First operand 921 states and 1242 transitions. Second operand 5 states. [2018-11-10 12:20:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:54,944 INFO L93 Difference]: Finished difference Result 1652 states and 2197 transitions. [2018-11-10 12:20:54,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:20:54,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-10 12:20:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:54,948 INFO L225 Difference]: With dead ends: 1652 [2018-11-10 12:20:54,948 INFO L226 Difference]: Without dead ends: 1095 [2018-11-10 12:20:54,949 INFO L605 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-10 12:20:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-11-10 12:20:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 912. [2018-11-10 12:20:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2018-11-10 12:20:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1221 transitions. [2018-11-10 12:20:54,980 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1221 transitions. Word has length 45 [2018-11-10 12:20:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:54,980 INFO L481 AbstractCegarLoop]: Abstraction has 912 states and 1221 transitions. [2018-11-10 12:20:54,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:20:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1221 transitions. [2018-11-10 12:20:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 12:20:54,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:54,981 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-10 12:20:54,981 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:54,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:54,982 INFO L82 PathProgramCache]: Analyzing trace with hash -546005933, now seen corresponding path program 1 times [2018-11-10 12:20:54,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:54,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:54,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:54,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:54,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:55,032 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-10 12:20:55,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:55,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:20:55,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:20:55,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:20:55,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:55,033 INFO L87 Difference]: Start difference. First operand 912 states and 1221 transitions. Second operand 5 states. [2018-11-10 12:20:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:55,326 INFO L93 Difference]: Finished difference Result 920 states and 1227 transitions. [2018-11-10 12:20:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:20:55,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-10 12:20:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:55,329 INFO L225 Difference]: With dead ends: 920 [2018-11-10 12:20:55,329 INFO L226 Difference]: Without dead ends: 914 [2018-11-10 12:20:55,330 INFO L605 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-10 12:20:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-11-10 12:20:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 912. [2018-11-10 12:20:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2018-11-10 12:20:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1220 transitions. [2018-11-10 12:20:55,363 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1220 transitions. Word has length 44 [2018-11-10 12:20:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:55,363 INFO L481 AbstractCegarLoop]: Abstraction has 912 states and 1220 transitions. [2018-11-10 12:20:55,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:20:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1220 transitions. [2018-11-10 12:20:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 12:20:55,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:55,364 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-10 12:20:55,364 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:55,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:55,365 INFO L82 PathProgramCache]: Analyzing trace with hash -389894069, now seen corresponding path program 1 times [2018-11-10 12:20:55,365 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:55,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:55,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:55,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:55,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:55,398 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-10 12:20:55,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:55,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:20:55,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:20:55,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:20:55,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:20:55,399 INFO L87 Difference]: Start difference. First operand 912 states and 1220 transitions. Second operand 4 states. [2018-11-10 12:20:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:55,458 INFO L93 Difference]: Finished difference Result 940 states and 1253 transitions. [2018-11-10 12:20:55,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:20:55,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-10 12:20:55,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:55,462 INFO L225 Difference]: With dead ends: 940 [2018-11-10 12:20:55,462 INFO L226 Difference]: Without dead ends: 918 [2018-11-10 12:20:55,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2018-11-10 12:20:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 912. [2018-11-10 12:20:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2018-11-10 12:20:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1220 transitions. [2018-11-10 12:20:55,494 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1220 transitions. Word has length 43 [2018-11-10 12:20:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:55,494 INFO L481 AbstractCegarLoop]: Abstraction has 912 states and 1220 transitions. [2018-11-10 12:20:55,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:20:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1220 transitions. [2018-11-10 12:20:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:20:55,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:55,495 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] [2018-11-10 12:20:55,495 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:55,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:55,496 INFO L82 PathProgramCache]: Analyzing trace with hash 337231274, now seen corresponding path program 1 times [2018-11-10 12:20:55,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:55,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:55,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:55,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:55,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:55,536 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-10 12:20:55,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:55,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:20:55,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:20:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:20:55,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:55,537 INFO L87 Difference]: Start difference. First operand 912 states and 1220 transitions. Second operand 5 states. [2018-11-10 12:20:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:55,578 INFO L93 Difference]: Finished difference Result 928 states and 1235 transitions. [2018-11-10 12:20:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:20:55,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-10 12:20:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:55,581 INFO L225 Difference]: With dead ends: 928 [2018-11-10 12:20:55,581 INFO L226 Difference]: Without dead ends: 910 [2018-11-10 12:20:55,581 INFO L605 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-10 12:20:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-11-10 12:20:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 910. [2018-11-10 12:20:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2018-11-10 12:20:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1216 transitions. [2018-11-10 12:20:55,611 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1216 transitions. Word has length 45 [2018-11-10 12:20:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:55,611 INFO L481 AbstractCegarLoop]: Abstraction has 910 states and 1216 transitions. [2018-11-10 12:20:55,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:20:55,612 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1216 transitions. [2018-11-10 12:20:55,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 12:20:55,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:55,613 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] [2018-11-10 12:20:55,613 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:55,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:55,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1555095157, now seen corresponding path program 1 times [2018-11-10 12:20:55,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:55,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:55,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:55,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:55,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:55,636 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-10 12:20:55,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:55,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:55,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:55,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:55,637 INFO L87 Difference]: Start difference. First operand 910 states and 1216 transitions. Second operand 3 states. [2018-11-10 12:20:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:55,678 INFO L93 Difference]: Finished difference Result 950 states and 1263 transitions. [2018-11-10 12:20:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:55,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-10 12:20:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:55,681 INFO L225 Difference]: With dead ends: 950 [2018-11-10 12:20:55,681 INFO L226 Difference]: Without dead ends: 874 [2018-11-10 12:20:55,681 INFO L605 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-10 12:20:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-10 12:20:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 871. [2018-11-10 12:20:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-11-10 12:20:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1165 transitions. [2018-11-10 12:20:55,708 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1165 transitions. Word has length 46 [2018-11-10 12:20:55,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:55,709 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 1165 transitions. [2018-11-10 12:20:55,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:55,709 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1165 transitions. [2018-11-10 12:20:55,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 12:20:55,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:55,710 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] [2018-11-10 12:20:55,710 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:55,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:55,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1650529097, now seen corresponding path program 1 times [2018-11-10 12:20:55,710 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:55,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:55,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:55,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:55,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:55,753 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-10 12:20:55,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:55,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:20:55,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:20:55,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:20:55,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:55,753 INFO L87 Difference]: Start difference. First operand 871 states and 1165 transitions. Second operand 5 states. [2018-11-10 12:20:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:55,789 INFO L93 Difference]: Finished difference Result 887 states and 1180 transitions. [2018-11-10 12:20:55,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:20:55,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-10 12:20:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:55,792 INFO L225 Difference]: With dead ends: 887 [2018-11-10 12:20:55,792 INFO L226 Difference]: Without dead ends: 869 [2018-11-10 12:20:55,793 INFO L605 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-10 12:20:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-11-10 12:20:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2018-11-10 12:20:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-11-10 12:20:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1161 transitions. [2018-11-10 12:20:55,819 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1161 transitions. Word has length 47 [2018-11-10 12:20:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:55,820 INFO L481 AbstractCegarLoop]: Abstraction has 869 states and 1161 transitions. [2018-11-10 12:20:55,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:20:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1161 transitions. [2018-11-10 12:20:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 12:20:55,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:55,821 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-10 12:20:55,821 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:55,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:55,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2011020046, now seen corresponding path program 1 times [2018-11-10 12:20:55,821 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:55,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:55,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:55,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:55,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:55,854 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-10 12:20:55,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:55,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:20:55,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:20:55,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:20:55,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:20:55,855 INFO L87 Difference]: Start difference. First operand 869 states and 1161 transitions. Second operand 4 states. [2018-11-10 12:20:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:56,000 INFO L93 Difference]: Finished difference Result 953 states and 1244 transitions. [2018-11-10 12:20:56,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:20:56,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-11-10 12:20:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:56,003 INFO L225 Difference]: With dead ends: 953 [2018-11-10 12:20:56,003 INFO L226 Difference]: Without dead ends: 616 [2018-11-10 12:20:56,004 INFO L605 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-10 12:20:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-11-10 12:20:56,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 579. [2018-11-10 12:20:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-10 12:20:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 750 transitions. [2018-11-10 12:20:56,024 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 750 transitions. Word has length 52 [2018-11-10 12:20:56,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:56,024 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 750 transitions. [2018-11-10 12:20:56,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:20:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 750 transitions. [2018-11-10 12:20:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 12:20:56,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:56,025 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] [2018-11-10 12:20:56,026 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:56,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:56,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1830977757, now seen corresponding path program 1 times [2018-11-10 12:20:56,026 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:56,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:56,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:56,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:56,076 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-10 12:20:56,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:56,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:20:56,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:20:56,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:20:56,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:20:56,077 INFO L87 Difference]: Start difference. First operand 579 states and 750 transitions. Second operand 6 states. [2018-11-10 12:20:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:56,129 INFO L93 Difference]: Finished difference Result 599 states and 770 transitions. [2018-11-10 12:20:56,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:20:56,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-10 12:20:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:56,132 INFO L225 Difference]: With dead ends: 599 [2018-11-10 12:20:56,132 INFO L226 Difference]: Without dead ends: 579 [2018-11-10 12:20:56,132 INFO L605 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-10 12:20:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-11-10 12:20:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2018-11-10 12:20:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-10 12:20:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 738 transitions. [2018-11-10 12:20:56,152 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 738 transitions. Word has length 50 [2018-11-10 12:20:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:56,152 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 738 transitions. [2018-11-10 12:20:56,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:20:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 738 transitions. [2018-11-10 12:20:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 12:20:56,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:56,153 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] [2018-11-10 12:20:56,153 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:56,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:56,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1530310595, now seen corresponding path program 1 times [2018-11-10 12:20:56,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:56,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:56,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:56,188 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-10 12:20:56,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:56,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:56,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:56,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:56,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:56,189 INFO L87 Difference]: Start difference. First operand 579 states and 738 transitions. Second operand 3 states. [2018-11-10 12:20:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:56,262 INFO L93 Difference]: Finished difference Result 782 states and 1007 transitions. [2018-11-10 12:20:56,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:56,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-10 12:20:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:56,265 INFO L225 Difference]: With dead ends: 782 [2018-11-10 12:20:56,265 INFO L226 Difference]: Without dead ends: 755 [2018-11-10 12:20:56,265 INFO L605 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-10 12:20:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-10 12:20:56,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 624. [2018-11-10 12:20:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-11-10 12:20:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 795 transitions. [2018-11-10 12:20:56,288 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 795 transitions. Word has length 50 [2018-11-10 12:20:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:56,288 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 795 transitions. [2018-11-10 12:20:56,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 795 transitions. [2018-11-10 12:20:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 12:20:56,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:56,290 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] [2018-11-10 12:20:56,290 INFO L424 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:56,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:56,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1843149445, now seen corresponding path program 1 times [2018-11-10 12:20:56,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:56,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:56,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:56,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:56,340 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-10 12:20:56,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:56,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:20:56,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:20:56,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:20:56,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:20:56,341 INFO L87 Difference]: Start difference. First operand 624 states and 795 transitions. Second operand 7 states. [2018-11-10 12:20:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:56,408 INFO L93 Difference]: Finished difference Result 663 states and 838 transitions. [2018-11-10 12:20:56,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:20:56,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-10 12:20:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:56,411 INFO L225 Difference]: With dead ends: 663 [2018-11-10 12:20:56,411 INFO L226 Difference]: Without dead ends: 614 [2018-11-10 12:20:56,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:20:56,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-11-10 12:20:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2018-11-10 12:20:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-10 12:20:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2018-11-10 12:20:56,432 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2018-11-10 12:20:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:56,433 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2018-11-10 12:20:56,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:20:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2018-11-10 12:20:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 12:20:56,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:56,434 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] [2018-11-10 12:20:56,434 INFO L424 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:56,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash 517866388, now seen corresponding path program 1 times [2018-11-10 12:20:56,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:56,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:56,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:56,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:56,471 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-10 12:20:56,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:56,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:20:56,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:20:56,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:20:56,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:20:56,472 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 6 states. [2018-11-10 12:20:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:56,515 INFO L93 Difference]: Finished difference Result 639 states and 807 transitions. [2018-11-10 12:20:56,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:20:56,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-10 12:20:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:56,518 INFO L225 Difference]: With dead ends: 639 [2018-11-10 12:20:56,519 INFO L226 Difference]: Without dead ends: 614 [2018-11-10 12:20:56,519 INFO L605 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-10 12:20:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-11-10 12:20:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2018-11-10 12:20:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-11-10 12:20:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 778 transitions. [2018-11-10 12:20:56,540 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 778 transitions. Word has length 51 [2018-11-10 12:20:56,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:56,540 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 778 transitions. [2018-11-10 12:20:56,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:20:56,540 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 778 transitions. [2018-11-10 12:20:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 12:20:56,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:56,541 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] [2018-11-10 12:20:56,542 INFO L424 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:56,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:56,542 INFO L82 PathProgramCache]: Analyzing trace with hash 646912898, now seen corresponding path program 1 times [2018-11-10 12:20:56,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:56,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:56,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:56,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:56,595 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-10 12:20:56,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:56,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 12:20:56,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:20:56,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:20:56,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:20:56,596 INFO L87 Difference]: Start difference. First operand 614 states and 778 transitions. Second operand 8 states. [2018-11-10 12:20:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:56,705 INFO L93 Difference]: Finished difference Result 644 states and 812 transitions. [2018-11-10 12:20:56,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:20:56,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-10 12:20:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:56,708 INFO L225 Difference]: With dead ends: 644 [2018-11-10 12:20:56,708 INFO L226 Difference]: Without dead ends: 640 [2018-11-10 12:20:56,709 INFO L605 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-10 12:20:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-11-10 12:20:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 632. [2018-11-10 12:20:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-11-10 12:20:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 799 transitions. [2018-11-10 12:20:56,736 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 799 transitions. Word has length 51 [2018-11-10 12:20:56,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:56,737 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 799 transitions. [2018-11-10 12:20:56,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:20:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 799 transitions. [2018-11-10 12:20:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 12:20:56,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:56,738 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] [2018-11-10 12:20:56,739 INFO L424 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:56,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:56,739 INFO L82 PathProgramCache]: Analyzing trace with hash 646636068, now seen corresponding path program 1 times [2018-11-10 12:20:56,739 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:56,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:56,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:56,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:56,807 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-10 12:20:56,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:56,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 12:20:56,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:20:56,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:20:56,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:20:56,809 INFO L87 Difference]: Start difference. First operand 632 states and 799 transitions. Second operand 8 states. [2018-11-10 12:20:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:56,885 INFO L93 Difference]: Finished difference Result 1028 states and 1322 transitions. [2018-11-10 12:20:56,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:20:56,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-11-10 12:20:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:56,888 INFO L225 Difference]: With dead ends: 1028 [2018-11-10 12:20:56,888 INFO L226 Difference]: Without dead ends: 672 [2018-11-10 12:20:56,889 INFO L605 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-10 12:20:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-11-10 12:20:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 653. [2018-11-10 12:20:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-11-10 12:20:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 837 transitions. [2018-11-10 12:20:56,936 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 837 transitions. Word has length 51 [2018-11-10 12:20:56,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:56,936 INFO L481 AbstractCegarLoop]: Abstraction has 653 states and 837 transitions. [2018-11-10 12:20:56,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:20:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 837 transitions. [2018-11-10 12:20:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 12:20:56,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:56,938 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-10 12:20:56,938 INFO L424 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:56,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:56,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1336246450, now seen corresponding path program 1 times [2018-11-10 12:20:56,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:56,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:56,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:56,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:57,039 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-10 12:20:57,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:57,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:20:57,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:20:57,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:20:57,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:20:57,041 INFO L87 Difference]: Start difference. First operand 653 states and 837 transitions. Second operand 9 states. [2018-11-10 12:20:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:58,360 INFO L93 Difference]: Finished difference Result 1007 states and 1282 transitions. [2018-11-10 12:20:58,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 12:20:58,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-10 12:20:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:58,364 INFO L225 Difference]: With dead ends: 1007 [2018-11-10 12:20:58,365 INFO L226 Difference]: Without dead ends: 940 [2018-11-10 12:20:58,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-11-10 12:20:58,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-11-10 12:20:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 705. [2018-11-10 12:20:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-11-10 12:20:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 910 transitions. [2018-11-10 12:20:58,410 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 910 transitions. Word has length 52 [2018-11-10 12:20:58,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:58,410 INFO L481 AbstractCegarLoop]: Abstraction has 705 states and 910 transitions. [2018-11-10 12:20:58,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:20:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 910 transitions. [2018-11-10 12:20:58,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 12:20:58,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:58,412 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-10 12:20:58,412 INFO L424 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:58,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:58,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1121853832, now seen corresponding path program 1 times [2018-11-10 12:20:58,412 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:58,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:58,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:58,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:58,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:58,462 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-10 12:20:58,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:58,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:58,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:58,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:58,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:58,463 INFO L87 Difference]: Start difference. First operand 705 states and 910 transitions. Second operand 3 states. [2018-11-10 12:20:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:58,575 INFO L93 Difference]: Finished difference Result 942 states and 1228 transitions. [2018-11-10 12:20:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:58,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-10 12:20:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:58,580 INFO L225 Difference]: With dead ends: 942 [2018-11-10 12:20:58,581 INFO L226 Difference]: Without dead ends: 899 [2018-11-10 12:20:58,581 INFO L605 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-10 12:20:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-11-10 12:20:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 750. [2018-11-10 12:20:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-11-10 12:20:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 957 transitions. [2018-11-10 12:20:58,633 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 957 transitions. Word has length 52 [2018-11-10 12:20:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:58,633 INFO L481 AbstractCegarLoop]: Abstraction has 750 states and 957 transitions. [2018-11-10 12:20:58,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 957 transitions. [2018-11-10 12:20:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 12:20:58,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:58,635 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-10 12:20:58,635 INFO L424 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:58,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:58,635 INFO L82 PathProgramCache]: Analyzing trace with hash 978574474, now seen corresponding path program 1 times [2018-11-10 12:20:58,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:58,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:58,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:58,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:58,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:58,721 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-10 12:20:58,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:58,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:20:58,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:20:58,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:20:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:20:58,722 INFO L87 Difference]: Start difference. First operand 750 states and 957 transitions. Second operand 7 states. [2018-11-10 12:20:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:59,215 INFO L93 Difference]: Finished difference Result 806 states and 1024 transitions. [2018-11-10 12:20:59,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:20:59,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-10 12:20:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:59,218 INFO L225 Difference]: With dead ends: 806 [2018-11-10 12:20:59,218 INFO L226 Difference]: Without dead ends: 662 [2018-11-10 12:20:59,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:20:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-11-10 12:20:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 622. [2018-11-10 12:20:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 12:20:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 791 transitions. [2018-11-10 12:20:59,265 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 791 transitions. Word has length 52 [2018-11-10 12:20:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:59,265 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 791 transitions. [2018-11-10 12:20:59,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:20:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 791 transitions. [2018-11-10 12:20:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 12:20:59,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:59,267 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] [2018-11-10 12:20:59,267 INFO L424 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:59,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1512929268, now seen corresponding path program 1 times [2018-11-10 12:20:59,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:59,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:59,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:59,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:59,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:59,306 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-10 12:20:59,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:59,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:59,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:59,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:59,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:59,307 INFO L87 Difference]: Start difference. First operand 622 states and 791 transitions. Second operand 3 states. [2018-11-10 12:20:59,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:59,398 INFO L93 Difference]: Finished difference Result 932 states and 1192 transitions. [2018-11-10 12:20:59,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:59,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-10 12:20:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:59,401 INFO L225 Difference]: With dead ends: 932 [2018-11-10 12:20:59,401 INFO L226 Difference]: Without dead ends: 621 [2018-11-10 12:20:59,402 INFO L605 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-10 12:20:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-11-10 12:20:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2018-11-10 12:20:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-10 12:20:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 787 transitions. [2018-11-10 12:20:59,445 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 787 transitions. Word has length 58 [2018-11-10 12:20:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:59,446 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 787 transitions. [2018-11-10 12:20:59,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 787 transitions. [2018-11-10 12:20:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 12:20:59,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:59,450 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-10 12:20:59,450 INFO L424 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:59,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:59,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2010209367, now seen corresponding path program 1 times [2018-11-10 12:20:59,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:59,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:59,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:59,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:59,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:59,492 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-10 12:20:59,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:59,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:20:59,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:20:59,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:20:59,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:20:59,493 INFO L87 Difference]: Start difference. First operand 621 states and 787 transitions. Second operand 5 states. [2018-11-10 12:20:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:59,780 INFO L93 Difference]: Finished difference Result 706 states and 894 transitions. [2018-11-10 12:20:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:20:59,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-10 12:20:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:59,788 INFO L225 Difference]: With dead ends: 706 [2018-11-10 12:20:59,788 INFO L226 Difference]: Without dead ends: 688 [2018-11-10 12:20:59,788 INFO L605 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-10 12:20:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-11-10 12:20:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 623. [2018-11-10 12:20:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-11-10 12:20:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 787 transitions. [2018-11-10 12:20:59,816 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 787 transitions. Word has length 54 [2018-11-10 12:20:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:59,816 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 787 transitions. [2018-11-10 12:20:59,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:20:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 787 transitions. [2018-11-10 12:20:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 12:20:59,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:59,817 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-10 12:20:59,817 INFO L424 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:59,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1896275701, now seen corresponding path program 1 times [2018-11-10 12:20:59,818 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:20:59,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:20:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:59,864 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-10 12:20:59,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:59,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:20:59,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:20:59,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:20:59,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:20:59,865 INFO L87 Difference]: Start difference. First operand 623 states and 787 transitions. Second operand 4 states. [2018-11-10 12:21:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:00,108 INFO L93 Difference]: Finished difference Result 1344 states and 1682 transitions. [2018-11-10 12:21:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:21:00,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-10 12:21:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:00,112 INFO L225 Difference]: With dead ends: 1344 [2018-11-10 12:21:00,112 INFO L226 Difference]: Without dead ends: 1179 [2018-11-10 12:21:00,113 INFO L605 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-10 12:21:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-11-10 12:21:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1109. [2018-11-10 12:21:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2018-11-10 12:21:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1411 transitions. [2018-11-10 12:21:00,184 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1411 transitions. Word has length 55 [2018-11-10 12:21:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:00,184 INFO L481 AbstractCegarLoop]: Abstraction has 1109 states and 1411 transitions. [2018-11-10 12:21:00,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:21:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1411 transitions. [2018-11-10 12:21:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 12:21:00,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:00,186 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-10 12:21:00,186 INFO L424 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:00,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:00,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1975989769, now seen corresponding path program 1 times [2018-11-10 12:21:00,186 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:00,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:00,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:00,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:00,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:00,256 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-10 12:21:00,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:00,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 12:21:00,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:21:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:21:00,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:21:00,257 INFO L87 Difference]: Start difference. First operand 1109 states and 1411 transitions. Second operand 8 states. [2018-11-10 12:21:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:00,330 INFO L93 Difference]: Finished difference Result 1122 states and 1423 transitions. [2018-11-10 12:21:00,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:21:00,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-10 12:21:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:00,334 INFO L225 Difference]: With dead ends: 1122 [2018-11-10 12:21:00,334 INFO L226 Difference]: Without dead ends: 1090 [2018-11-10 12:21:00,334 INFO L605 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-10 12:21:00,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-11-10 12:21:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2018-11-10 12:21:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2018-11-10 12:21:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1387 transitions. [2018-11-10 12:21:00,385 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1387 transitions. Word has length 55 [2018-11-10 12:21:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:00,386 INFO L481 AbstractCegarLoop]: Abstraction has 1090 states and 1387 transitions. [2018-11-10 12:21:00,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:21:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1387 transitions. [2018-11-10 12:21:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 12:21:00,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:00,388 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] [2018-11-10 12:21:00,388 INFO L424 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:00,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:00,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1022371571, now seen corresponding path program 1 times [2018-11-10 12:21:00,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:00,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:00,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:00,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:00,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:00,434 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-10 12:21:00,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:00,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:21:00,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:21:00,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:21:00,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:21:00,435 INFO L87 Difference]: Start difference. First operand 1090 states and 1387 transitions. Second operand 4 states. [2018-11-10 12:21:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:00,576 INFO L93 Difference]: Finished difference Result 1523 states and 1879 transitions. [2018-11-10 12:21:00,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:21:00,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-10 12:21:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:00,578 INFO L225 Difference]: With dead ends: 1523 [2018-11-10 12:21:00,578 INFO L226 Difference]: Without dead ends: 877 [2018-11-10 12:21:00,580 INFO L605 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-10 12:21:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-11-10 12:21:00,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 798. [2018-11-10 12:21:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-11-10 12:21:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 983 transitions. [2018-11-10 12:21:00,619 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 983 transitions. Word has length 64 [2018-11-10 12:21:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:00,619 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 983 transitions. [2018-11-10 12:21:00,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:21:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 983 transitions. [2018-11-10 12:21:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 12:21:00,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:00,620 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] [2018-11-10 12:21:00,621 INFO L424 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:00,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1446018293, now seen corresponding path program 1 times [2018-11-10 12:21:00,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:00,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:00,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:00,677 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-10 12:21:00,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:00,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:21:00,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:21:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:21:00,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:21:00,678 INFO L87 Difference]: Start difference. First operand 798 states and 983 transitions. Second operand 5 states. [2018-11-10 12:21:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:00,714 INFO L93 Difference]: Finished difference Result 1059 states and 1320 transitions. [2018-11-10 12:21:00,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:21:00,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-11-10 12:21:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:00,717 INFO L225 Difference]: With dead ends: 1059 [2018-11-10 12:21:00,717 INFO L226 Difference]: Without dead ends: 730 [2018-11-10 12:21:00,718 INFO L605 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-10 12:21:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-11-10 12:21:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2018-11-10 12:21:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-10 12:21:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 888 transitions. [2018-11-10 12:21:00,756 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 888 transitions. Word has length 64 [2018-11-10 12:21:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:00,756 INFO L481 AbstractCegarLoop]: Abstraction has 730 states and 888 transitions. [2018-11-10 12:21:00,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:21:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 888 transitions. [2018-11-10 12:21:00,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 12:21:00,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:00,758 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] [2018-11-10 12:21:00,758 INFO L424 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:00,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:00,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1560522320, now seen corresponding path program 1 times [2018-11-10 12:21:00,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:00,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:00,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:00,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:00,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:00,815 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-10 12:21:00,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:00,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 12:21:00,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:21:00,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:21:00,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:21:00,816 INFO L87 Difference]: Start difference. First operand 730 states and 888 transitions. Second operand 8 states. [2018-11-10 12:21:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:00,931 INFO L93 Difference]: Finished difference Result 744 states and 901 transitions. [2018-11-10 12:21:00,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:21:00,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-10 12:21:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:00,934 INFO L225 Difference]: With dead ends: 744 [2018-11-10 12:21:00,934 INFO L226 Difference]: Without dead ends: 726 [2018-11-10 12:21:00,935 INFO L605 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-10 12:21:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-11-10 12:21:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2018-11-10 12:21:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-10 12:21:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 882 transitions. [2018-11-10 12:21:00,969 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 882 transitions. Word has length 58 [2018-11-10 12:21:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:00,970 INFO L481 AbstractCegarLoop]: Abstraction has 726 states and 882 transitions. [2018-11-10 12:21:00,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:21:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 882 transitions. [2018-11-10 12:21:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 12:21:00,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:00,971 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-10 12:21:00,971 INFO L424 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:00,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:00,971 INFO L82 PathProgramCache]: Analyzing trace with hash 799621147, now seen corresponding path program 1 times [2018-11-10 12:21:00,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:00,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:00,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:00,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:00,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:01,020 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-10 12:21:01,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:01,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:21:01,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:21:01,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:21:01,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:21:01,021 INFO L87 Difference]: Start difference. First operand 726 states and 882 transitions. Second operand 6 states. [2018-11-10 12:21:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:01,074 INFO L93 Difference]: Finished difference Result 745 states and 900 transitions. [2018-11-10 12:21:01,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:21:01,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-10 12:21:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:01,077 INFO L225 Difference]: With dead ends: 745 [2018-11-10 12:21:01,077 INFO L226 Difference]: Without dead ends: 707 [2018-11-10 12:21:01,077 INFO L605 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-10 12:21:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-10 12:21:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2018-11-10 12:21:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-11-10 12:21:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 859 transitions. [2018-11-10 12:21:01,111 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 859 transitions. Word has length 60 [2018-11-10 12:21:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:01,111 INFO L481 AbstractCegarLoop]: Abstraction has 707 states and 859 transitions. [2018-11-10 12:21:01,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:21:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 859 transitions. [2018-11-10 12:21:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 12:21:01,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:01,112 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-10 12:21:01,112 INFO L424 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:01,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:01,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1064701422, now seen corresponding path program 1 times [2018-11-10 12:21:01,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:01,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:01,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:01,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:01,159 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-10 12:21:01,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:01,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:21:01,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:21:01,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:21:01,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:21:01,160 INFO L87 Difference]: Start difference. First operand 707 states and 859 transitions. Second operand 5 states. [2018-11-10 12:21:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:01,352 INFO L93 Difference]: Finished difference Result 968 states and 1189 transitions. [2018-11-10 12:21:01,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:21:01,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-10 12:21:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:01,355 INFO L225 Difference]: With dead ends: 968 [2018-11-10 12:21:01,355 INFO L226 Difference]: Without dead ends: 707 [2018-11-10 12:21:01,356 INFO L605 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-10 12:21:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-10 12:21:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2018-11-10 12:21:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-11-10 12:21:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 857 transitions. [2018-11-10 12:21:01,390 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 857 transitions. Word has length 68 [2018-11-10 12:21:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:01,390 INFO L481 AbstractCegarLoop]: Abstraction has 707 states and 857 transitions. [2018-11-10 12:21:01,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:21:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 857 transitions. [2018-11-10 12:21:01,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 12:21:01,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:01,392 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] [2018-11-10 12:21:01,392 INFO L424 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:01,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:01,392 INFO L82 PathProgramCache]: Analyzing trace with hash 487854810, now seen corresponding path program 1 times [2018-11-10 12:21:01,392 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:01,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:01,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:01,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:01,433 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-10 12:21:01,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:01,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:21:01,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:21:01,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:21:01,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:21:01,434 INFO L87 Difference]: Start difference. First operand 707 states and 857 transitions. Second operand 5 states. [2018-11-10 12:21:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:01,473 INFO L93 Difference]: Finished difference Result 836 states and 1007 transitions. [2018-11-10 12:21:01,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:21:01,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-10 12:21:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:01,477 INFO L225 Difference]: With dead ends: 836 [2018-11-10 12:21:01,477 INFO L226 Difference]: Without dead ends: 719 [2018-11-10 12:21:01,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:21:01,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-11-10 12:21:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 715. [2018-11-10 12:21:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-11-10 12:21:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 865 transitions. [2018-11-10 12:21:01,511 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 865 transitions. Word has length 63 [2018-11-10 12:21:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:01,511 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 865 transitions. [2018-11-10 12:21:01,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:21:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 865 transitions. [2018-11-10 12:21:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 12:21:01,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:01,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] [2018-11-10 12:21:01,513 INFO L424 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:01,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:01,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1527314919, now seen corresponding path program 1 times [2018-11-10 12:21:01,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:01,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:01,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:01,577 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-10 12:21:01,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:01,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:21:01,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:21:01,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:21:01,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:21:01,578 INFO L87 Difference]: Start difference. First operand 715 states and 865 transitions. Second operand 9 states. [2018-11-10 12:21:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:01,641 INFO L93 Difference]: Finished difference Result 867 states and 1036 transitions. [2018-11-10 12:21:01,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:01,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-11-10 12:21:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:01,644 INFO L225 Difference]: With dead ends: 867 [2018-11-10 12:21:01,644 INFO L226 Difference]: Without dead ends: 708 [2018-11-10 12:21:01,644 INFO L605 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-10 12:21:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-11-10 12:21:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2018-11-10 12:21:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-11-10 12:21:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 855 transitions. [2018-11-10 12:21:01,676 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 855 transitions. Word has length 63 [2018-11-10 12:21:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:01,677 INFO L481 AbstractCegarLoop]: Abstraction has 708 states and 855 transitions. [2018-11-10 12:21:01,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:21:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 855 transitions. [2018-11-10 12:21:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 12:21:01,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:01,678 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] [2018-11-10 12:21:01,678 INFO L424 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:01,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1486367283, now seen corresponding path program 1 times [2018-11-10 12:21:01,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:01,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:01,705 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-10 12:21:01,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:01,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:21:01,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:21:01,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:21:01,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:21:01,705 INFO L87 Difference]: Start difference. First operand 708 states and 855 transitions. Second operand 3 states. [2018-11-10 12:21:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:01,751 INFO L93 Difference]: Finished difference Result 1011 states and 1239 transitions. [2018-11-10 12:21:01,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:21:01,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-10 12:21:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:01,753 INFO L225 Difference]: With dead ends: 1011 [2018-11-10 12:21:01,754 INFO L226 Difference]: Without dead ends: 750 [2018-11-10 12:21:01,754 INFO L605 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-10 12:21:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-11-10 12:21:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 708. [2018-11-10 12:21:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-11-10 12:21:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 855 transitions. [2018-11-10 12:21:01,787 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 855 transitions. Word has length 71 [2018-11-10 12:21:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:01,788 INFO L481 AbstractCegarLoop]: Abstraction has 708 states and 855 transitions. [2018-11-10 12:21:01,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:21:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 855 transitions. [2018-11-10 12:21:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 12:21:01,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:01,789 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] [2018-11-10 12:21:01,789 INFO L424 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:01,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:01,789 INFO L82 PathProgramCache]: Analyzing trace with hash 507667981, now seen corresponding path program 1 times [2018-11-10 12:21:01,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:01,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:01,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:01,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:01,849 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-10 12:21:01,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:01,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:21:01,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:21:01,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:21:01,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:21:01,850 INFO L87 Difference]: Start difference. First operand 708 states and 855 transitions. Second operand 6 states. [2018-11-10 12:21:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:01,909 INFO L93 Difference]: Finished difference Result 979 states and 1192 transitions. [2018-11-10 12:21:01,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:21:01,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-10 12:21:01,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:01,911 INFO L225 Difference]: With dead ends: 979 [2018-11-10 12:21:01,911 INFO L226 Difference]: Without dead ends: 751 [2018-11-10 12:21:01,912 INFO L605 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-10 12:21:01,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-11-10 12:21:01,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 708. [2018-11-10 12:21:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-11-10 12:21:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 853 transitions. [2018-11-10 12:21:01,944 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 853 transitions. Word has length 71 [2018-11-10 12:21:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:01,945 INFO L481 AbstractCegarLoop]: Abstraction has 708 states and 853 transitions. [2018-11-10 12:21:01,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:21:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 853 transitions. [2018-11-10 12:21:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 12:21:01,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:01,946 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] [2018-11-10 12:21:01,946 INFO L424 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:01,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:01,947 INFO L82 PathProgramCache]: Analyzing trace with hash -770762414, now seen corresponding path program 1 times [2018-11-10 12:21:01,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:01,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:01,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:01,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:02,007 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-10 12:21:02,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:02,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:21:02,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:21:02,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:21:02,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:21:02,008 INFO L87 Difference]: Start difference. First operand 708 states and 853 transitions. Second operand 9 states. [2018-11-10 12:21:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:02,140 INFO L93 Difference]: Finished difference Result 725 states and 869 transitions. [2018-11-10 12:21:02,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:02,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-11-10 12:21:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:02,143 INFO L225 Difference]: With dead ends: 725 [2018-11-10 12:21:02,143 INFO L226 Difference]: Without dead ends: 704 [2018-11-10 12:21:02,143 INFO L605 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-10 12:21:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-11-10 12:21:02,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2018-11-10 12:21:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-11-10 12:21:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 847 transitions. [2018-11-10 12:21:02,199 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 847 transitions. Word has length 63 [2018-11-10 12:21:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:02,200 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 847 transitions. [2018-11-10 12:21:02,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:21:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 847 transitions. [2018-11-10 12:21:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 12:21:02,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:02,201 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] [2018-11-10 12:21:02,201 INFO L424 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:02,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash 750429482, now seen corresponding path program 1 times [2018-11-10 12:21:02,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:02,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:02,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:02,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:02,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:02,277 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-10 12:21:02,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:02,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:21:02,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:21:02,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:21:02,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:21:02,278 INFO L87 Difference]: Start difference. First operand 704 states and 847 transitions. Second operand 9 states. [2018-11-10 12:21:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:02,520 INFO L93 Difference]: Finished difference Result 721 states and 863 transitions. [2018-11-10 12:21:02,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:02,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-10 12:21:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:02,523 INFO L225 Difference]: With dead ends: 721 [2018-11-10 12:21:02,524 INFO L226 Difference]: Without dead ends: 699 [2018-11-10 12:21:02,524 INFO L605 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-10 12:21:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-11-10 12:21:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2018-11-10 12:21:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-11-10 12:21:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 840 transitions. [2018-11-10 12:21:02,602 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 840 transitions. Word has length 64 [2018-11-10 12:21:02,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:02,602 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 840 transitions. [2018-11-10 12:21:02,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:21:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 840 transitions. [2018-11-10 12:21:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 12:21:02,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:02,604 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] [2018-11-10 12:21:02,604 INFO L424 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:02,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:02,604 INFO L82 PathProgramCache]: Analyzing trace with hash -179681988, now seen corresponding path program 1 times [2018-11-10 12:21:02,604 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:02,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:02,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:02,671 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-10 12:21:02,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:02,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:21:02,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:21:02,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:21:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:21:02,672 INFO L87 Difference]: Start difference. First operand 699 states and 840 transitions. Second operand 9 states. [2018-11-10 12:21:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:02,886 INFO L93 Difference]: Finished difference Result 716 states and 856 transitions. [2018-11-10 12:21:02,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:02,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-11-10 12:21:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:02,889 INFO L225 Difference]: With dead ends: 716 [2018-11-10 12:21:02,889 INFO L226 Difference]: Without dead ends: 695 [2018-11-10 12:21:02,894 INFO L605 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-10 12:21:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-11-10 12:21:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2018-11-10 12:21:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-11-10 12:21:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 834 transitions. [2018-11-10 12:21:02,945 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 834 transitions. Word has length 64 [2018-11-10 12:21:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:02,945 INFO L481 AbstractCegarLoop]: Abstraction has 695 states and 834 transitions. [2018-11-10 12:21:02,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:21:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 834 transitions. [2018-11-10 12:21:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 12:21:02,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:02,947 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] [2018-11-10 12:21:02,947 INFO L424 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:02,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:02,947 INFO L82 PathProgramCache]: Analyzing trace with hash -796698632, now seen corresponding path program 1 times [2018-11-10 12:21:02,947 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:02,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:02,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:02,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:02,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:02,993 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-10 12:21:02,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:02,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 12:21:02,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:21:02,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:21:02,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:21:02,994 INFO L87 Difference]: Start difference. First operand 695 states and 834 transitions. Second operand 8 states. [2018-11-10 12:21:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:03,130 INFO L93 Difference]: Finished difference Result 706 states and 844 transitions. [2018-11-10 12:21:03,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:21:03,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-11-10 12:21:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:03,133 INFO L225 Difference]: With dead ends: 706 [2018-11-10 12:21:03,133 INFO L226 Difference]: Without dead ends: 670 [2018-11-10 12:21:03,134 INFO L605 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-10 12:21:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-11-10 12:21:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2018-11-10 12:21:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-11-10 12:21:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 804 transitions. [2018-11-10 12:21:03,182 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 804 transitions. Word has length 64 [2018-11-10 12:21:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:03,182 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 804 transitions. [2018-11-10 12:21:03,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:21:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 804 transitions. [2018-11-10 12:21:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 12:21:03,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:03,184 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-10 12:21:03,184 INFO L424 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:03,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:03,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2130115401, now seen corresponding path program 1 times [2018-11-10 12:21:03,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:03,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:03,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:03,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:03,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:03,266 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-10 12:21:03,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:03,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:21:03,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:21:03,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:21:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:21:03,267 INFO L87 Difference]: Start difference. First operand 670 states and 804 transitions. Second operand 5 states. [2018-11-10 12:21:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:03,586 INFO L93 Difference]: Finished difference Result 1042 states and 1264 transitions. [2018-11-10 12:21:03,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:21:03,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-10 12:21:03,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:03,587 INFO L225 Difference]: With dead ends: 1042 [2018-11-10 12:21:03,588 INFO L226 Difference]: Without dead ends: 787 [2018-11-10 12:21:03,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:21:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-10 12:21:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 745. [2018-11-10 12:21:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-11-10 12:21:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 899 transitions. [2018-11-10 12:21:03,653 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 899 transitions. Word has length 70 [2018-11-10 12:21:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:03,653 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 899 transitions. [2018-11-10 12:21:03,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:21:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 899 transitions. [2018-11-10 12:21:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 12:21:03,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:03,654 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-10 12:21:03,655 INFO L424 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:03,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash 559865067, now seen corresponding path program 1 times [2018-11-10 12:21:03,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:03,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:03,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:03,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:03,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:03,739 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-10 12:21:03,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:03,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:21:03,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:21:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:21:03,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:21:03,740 INFO L87 Difference]: Start difference. First operand 745 states and 899 transitions. Second operand 9 states. [2018-11-10 12:21:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:03,916 INFO L93 Difference]: Finished difference Result 762 states and 915 transitions. [2018-11-10 12:21:03,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:03,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-11-10 12:21:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:03,918 INFO L225 Difference]: With dead ends: 762 [2018-11-10 12:21:03,918 INFO L226 Difference]: Without dead ends: 719 [2018-11-10 12:21:03,919 INFO L605 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-10 12:21:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-11-10 12:21:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2018-11-10 12:21:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-11-10 12:21:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 867 transitions. [2018-11-10 12:21:03,953 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 867 transitions. Word has length 68 [2018-11-10 12:21:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:03,954 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 867 transitions. [2018-11-10 12:21:03,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:21:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 867 transitions. [2018-11-10 12:21:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 12:21:03,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:03,956 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] [2018-11-10 12:21:03,956 INFO L424 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:03,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:03,956 INFO L82 PathProgramCache]: Analyzing trace with hash -552557536, now seen corresponding path program 1 times [2018-11-10 12:21:03,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:03,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:03,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:03,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:03,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:04,023 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-10 12:21:04,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:04,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:21:04,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:21:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:21:04,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:21:04,024 INFO L87 Difference]: Start difference. First operand 719 states and 867 transitions. Second operand 7 states. [2018-11-10 12:21:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:04,566 INFO L93 Difference]: Finished difference Result 1026 states and 1247 transitions. [2018-11-10 12:21:04,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:21:04,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-10 12:21:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:04,569 INFO L225 Difference]: With dead ends: 1026 [2018-11-10 12:21:04,569 INFO L226 Difference]: Without dead ends: 714 [2018-11-10 12:21:04,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:21:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-10 12:21:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 703. [2018-11-10 12:21:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-11-10 12:21:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 842 transitions. [2018-11-10 12:21:04,628 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 842 transitions. Word has length 82 [2018-11-10 12:21:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:04,628 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 842 transitions. [2018-11-10 12:21:04,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:21:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 842 transitions. [2018-11-10 12:21:04,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 12:21:04,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:04,630 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] [2018-11-10 12:21:04,630 INFO L424 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:04,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash -207305743, now seen corresponding path program 1 times [2018-11-10 12:21:04,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:04,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:04,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:04,683 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-10 12:21:04,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:04,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:21:04,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:21:04,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:21:04,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:21:04,684 INFO L87 Difference]: Start difference. First operand 703 states and 842 transitions. Second operand 5 states. [2018-11-10 12:21:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:04,754 INFO L93 Difference]: Finished difference Result 828 states and 984 transitions. [2018-11-10 12:21:04,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:21:04,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-10 12:21:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:04,759 INFO L225 Difference]: With dead ends: 828 [2018-11-10 12:21:04,759 INFO L226 Difference]: Without dead ends: 701 [2018-11-10 12:21:04,760 INFO L605 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-10 12:21:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-11-10 12:21:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2018-11-10 12:21:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-11-10 12:21:04,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 838 transitions. [2018-11-10 12:21:04,817 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 838 transitions. Word has length 76 [2018-11-10 12:21:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:04,817 INFO L481 AbstractCegarLoop]: Abstraction has 701 states and 838 transitions. [2018-11-10 12:21:04,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:21:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 838 transitions. [2018-11-10 12:21:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 12:21:04,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:04,819 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] [2018-11-10 12:21:04,819 INFO L424 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:04,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:04,819 INFO L82 PathProgramCache]: Analyzing trace with hash 505610258, now seen corresponding path program 1 times [2018-11-10 12:21:04,819 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:04,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:04,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:04,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:04,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:04,892 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-10 12:21:04,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:04,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:21:04,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:21:04,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:21:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:21:04,893 INFO L87 Difference]: Start difference. First operand 701 states and 838 transitions. Second operand 9 states. [2018-11-10 12:21:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:04,960 INFO L93 Difference]: Finished difference Result 713 states and 850 transitions. [2018-11-10 12:21:04,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:04,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-11-10 12:21:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:04,962 INFO L225 Difference]: With dead ends: 713 [2018-11-10 12:21:04,962 INFO L226 Difference]: Without dead ends: 627 [2018-11-10 12:21:04,962 INFO L605 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-10 12:21:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-10 12:21:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2018-11-10 12:21:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-10 12:21:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 750 transitions. [2018-11-10 12:21:04,995 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 750 transitions. Word has length 76 [2018-11-10 12:21:04,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:04,995 INFO L481 AbstractCegarLoop]: Abstraction has 627 states and 750 transitions. [2018-11-10 12:21:04,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:21:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 750 transitions. [2018-11-10 12:21:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 12:21:04,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:04,996 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] [2018-11-10 12:21:04,996 INFO L424 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:04,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:04,997 INFO L82 PathProgramCache]: Analyzing trace with hash 3195225, now seen corresponding path program 1 times [2018-11-10 12:21:04,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:04,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:04,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:04,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:04,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:05,058 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-10 12:21:05,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:05,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:21:05,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:21:05,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:21:05,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:21:05,059 INFO L87 Difference]: Start difference. First operand 627 states and 750 transitions. Second operand 6 states. [2018-11-10 12:21:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:05,115 INFO L93 Difference]: Finished difference Result 960 states and 1179 transitions. [2018-11-10 12:21:05,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:21:05,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-10 12:21:05,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:05,119 INFO L225 Difference]: With dead ends: 960 [2018-11-10 12:21:05,119 INFO L226 Difference]: Without dead ends: 703 [2018-11-10 12:21:05,119 INFO L605 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-10 12:21:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-11-10 12:21:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 593. [2018-11-10 12:21:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-11-10 12:21:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 706 transitions. [2018-11-10 12:21:05,153 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 706 transitions. Word has length 83 [2018-11-10 12:21:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:05,154 INFO L481 AbstractCegarLoop]: Abstraction has 593 states and 706 transitions. [2018-11-10 12:21:05,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:21:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 706 transitions. [2018-11-10 12:21:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 12:21:05,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:05,155 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-10 12:21:05,155 INFO L424 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:05,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:05,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1044142237, now seen corresponding path program 1 times [2018-11-10 12:21:05,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:05,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:05,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:05,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:05,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:05,190 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-10 12:21:05,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:05,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:21:05,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:21:05,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:21:05,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:21:05,191 INFO L87 Difference]: Start difference. First operand 593 states and 706 transitions. Second operand 5 states. [2018-11-10 12:21:05,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:05,440 INFO L93 Difference]: Finished difference Result 1033 states and 1210 transitions. [2018-11-10 12:21:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:21:05,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-11-10 12:21:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:05,443 INFO L225 Difference]: With dead ends: 1033 [2018-11-10 12:21:05,443 INFO L226 Difference]: Without dead ends: 641 [2018-11-10 12:21:05,444 INFO L605 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-10 12:21:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-11-10 12:21:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 618. [2018-11-10 12:21:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-11-10 12:21:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 721 transitions. [2018-11-10 12:21:05,494 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 721 transitions. Word has length 78 [2018-11-10 12:21:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:05,494 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 721 transitions. [2018-11-10 12:21:05,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:21:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 721 transitions. [2018-11-10 12:21:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 12:21:05,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:05,499 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] [2018-11-10 12:21:05,499 INFO L424 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:05,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash -796576949, now seen corresponding path program 1 times [2018-11-10 12:21:05,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:05,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:05,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:05,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:05,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:05,558 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-10 12:21:05,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:05,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:21:05,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:21:05,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:21:05,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:21:05,558 INFO L87 Difference]: Start difference. First operand 618 states and 721 transitions. Second operand 9 states. [2018-11-10 12:21:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:05,681 INFO L93 Difference]: Finished difference Result 620 states and 722 transitions. [2018-11-10 12:21:05,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:05,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-11-10 12:21:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:05,683 INFO L225 Difference]: With dead ends: 620 [2018-11-10 12:21:05,683 INFO L226 Difference]: Without dead ends: 453 [2018-11-10 12:21:05,684 INFO L605 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-10 12:21:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-11-10 12:21:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2018-11-10 12:21:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-11-10 12:21:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 537 transitions. [2018-11-10 12:21:05,721 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 537 transitions. Word has length 81 [2018-11-10 12:21:05,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:05,721 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 537 transitions. [2018-11-10 12:21:05,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:21:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 537 transitions. [2018-11-10 12:21:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 12:21:05,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:05,722 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] [2018-11-10 12:21:05,722 INFO L424 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:05,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash -138819064, now seen corresponding path program 1 times [2018-11-10 12:21:05,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:05,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:05,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:05,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:05,794 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-10 12:21:05,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:05,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:21:05,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:21:05,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:21:05,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:21:05,795 INFO L87 Difference]: Start difference. First operand 453 states and 537 transitions. Second operand 9 states. [2018-11-10 12:21:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:05,899 INFO L93 Difference]: Finished difference Result 474 states and 558 transitions. [2018-11-10 12:21:05,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:05,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-11-10 12:21:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:05,901 INFO L225 Difference]: With dead ends: 474 [2018-11-10 12:21:05,901 INFO L226 Difference]: Without dead ends: 453 [2018-11-10 12:21:05,902 INFO L605 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-10 12:21:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-11-10 12:21:05,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2018-11-10 12:21:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-11-10 12:21:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 536 transitions. [2018-11-10 12:21:05,931 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 536 transitions. Word has length 88 [2018-11-10 12:21:05,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:05,931 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 536 transitions. [2018-11-10 12:21:05,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:21:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 536 transitions. [2018-11-10 12:21:05,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 12:21:05,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:05,932 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] [2018-11-10 12:21:05,932 INFO L424 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:05,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:05,932 INFO L82 PathProgramCache]: Analyzing trace with hash -818160155, now seen corresponding path program 1 times [2018-11-10 12:21:05,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:05,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:05,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:05,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:05,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:05,980 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-10 12:21:05,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:05,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:21:05,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:21:05,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:21:05,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:21:05,981 INFO L87 Difference]: Start difference. First operand 453 states and 536 transitions. Second operand 7 states. [2018-11-10 12:21:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:06,095 INFO L93 Difference]: Finished difference Result 855 states and 1015 transitions. [2018-11-10 12:21:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:06,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-10 12:21:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:06,098 INFO L225 Difference]: With dead ends: 855 [2018-11-10 12:21:06,099 INFO L226 Difference]: Without dead ends: 800 [2018-11-10 12:21:06,099 INFO L605 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-10 12:21:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-11-10 12:21:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 373. [2018-11-10 12:21:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 12:21:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 434 transitions. [2018-11-10 12:21:06,128 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 434 transitions. Word has length 99 [2018-11-10 12:21:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:06,128 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 434 transitions. [2018-11-10 12:21:06,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:21:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 434 transitions. [2018-11-10 12:21:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 12:21:06,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:06,129 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, 1, 1, 1] [2018-11-10 12:21:06,129 INFO L424 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:06,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:06,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1511697420, now seen corresponding path program 1 times [2018-11-10 12:21:06,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:06,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:06,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:06,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:06,199 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-10 12:21:06,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:06,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 12:21:06,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:21:06,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:21:06,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:21:06,200 INFO L87 Difference]: Start difference. First operand 373 states and 434 transitions. Second operand 11 states. [2018-11-10 12:21:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:06,276 INFO L93 Difference]: Finished difference Result 520 states and 608 transitions. [2018-11-10 12:21:06,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:21:06,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2018-11-10 12:21:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:06,279 INFO L225 Difference]: With dead ends: 520 [2018-11-10 12:21:06,279 INFO L226 Difference]: Without dead ends: 369 [2018-11-10 12:21:06,279 INFO L605 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-10 12:21:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-10 12:21:06,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 356. [2018-11-10 12:21:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 12:21:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 411 transitions. [2018-11-10 12:21:06,305 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 411 transitions. Word has length 104 [2018-11-10 12:21:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:06,305 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 411 transitions. [2018-11-10 12:21:06,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:21:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 411 transitions. [2018-11-10 12:21:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 12:21:06,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:06,306 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, 1, 1, 1] [2018-11-10 12:21:06,306 INFO L424 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:06,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:06,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1019545780, now seen corresponding path program 1 times [2018-11-10 12:21:06,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:06,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:06,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:06,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:06,355 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-10 12:21:06,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:06,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:21:06,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:21:06,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:21:06,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:21:06,356 INFO L87 Difference]: Start difference. First operand 356 states and 411 transitions. Second operand 6 states. [2018-11-10 12:21:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:06,395 INFO L93 Difference]: Finished difference Result 384 states and 437 transitions. [2018-11-10 12:21:06,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:21:06,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-10 12:21:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:06,397 INFO L225 Difference]: With dead ends: 384 [2018-11-10 12:21:06,397 INFO L226 Difference]: Without dead ends: 307 [2018-11-10 12:21:06,397 INFO L605 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-10 12:21:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-10 12:21:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 244. [2018-11-10 12:21:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-10 12:21:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 269 transitions. [2018-11-10 12:21:06,415 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 269 transitions. Word has length 113 [2018-11-10 12:21:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:06,416 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 269 transitions. [2018-11-10 12:21:06,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:21:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 269 transitions. [2018-11-10 12:21:06,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 12:21:06,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:06,417 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] [2018-11-10 12:21:06,417 INFO L424 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:06,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash -960660735, now seen corresponding path program 1 times [2018-11-10 12:21:06,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:06,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:06,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:06,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:06,488 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-10 12:21:06,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:06,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:21:06,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:21:06,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:21:06,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:21:06,489 INFO L87 Difference]: Start difference. First operand 244 states and 269 transitions. Second operand 9 states. [2018-11-10 12:21:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:06,553 INFO L93 Difference]: Finished difference Result 318 states and 357 transitions. [2018-11-10 12:21:06,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:06,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-11-10 12:21:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:06,555 INFO L225 Difference]: With dead ends: 318 [2018-11-10 12:21:06,555 INFO L226 Difference]: Without dead ends: 289 [2018-11-10 12:21:06,556 INFO L605 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-10 12:21:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-10 12:21:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2018-11-10 12:21:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-10 12:21:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 295 transitions. [2018-11-10 12:21:06,575 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 295 transitions. Word has length 134 [2018-11-10 12:21:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:06,575 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 295 transitions. [2018-11-10 12:21:06,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:21:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 295 transitions. [2018-11-10 12:21:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 12:21:06,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:06,576 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] [2018-11-10 12:21:06,576 INFO L424 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:06,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:06,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2119185761, now seen corresponding path program 1 times [2018-11-10 12:21:06,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:06,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:06,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:06,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:06,650 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-10 12:21:06,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:06,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:21:06,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:21:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:21:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:21:06,653 INFO L87 Difference]: Start difference. First operand 265 states and 295 transitions. Second operand 9 states. [2018-11-10 12:21:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:06,745 INFO L93 Difference]: Finished difference Result 341 states and 378 transitions. [2018-11-10 12:21:06,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:06,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2018-11-10 12:21:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:06,747 INFO L225 Difference]: With dead ends: 341 [2018-11-10 12:21:06,747 INFO L226 Difference]: Without dead ends: 270 [2018-11-10 12:21:06,750 INFO L605 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-10 12:21:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-11-10 12:21:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 247. [2018-11-10 12:21:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-10 12:21:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 270 transitions. [2018-11-10 12:21:06,780 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 270 transitions. Word has length 135 [2018-11-10 12:21:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:06,780 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 270 transitions. [2018-11-10 12:21:06,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:21:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 270 transitions. [2018-11-10 12:21:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 12:21:06,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:06,781 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] [2018-11-10 12:21:06,781 INFO L424 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:06,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:06,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1763534259, now seen corresponding path program 1 times [2018-11-10 12:21:06,781 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:06,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:06,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:06,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:06,850 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-10 12:21:06,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:06,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:21:06,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:21:06,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:21:06,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:21:06,851 INFO L87 Difference]: Start difference. First operand 247 states and 270 transitions. Second operand 5 states. [2018-11-10 12:21:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:06,890 INFO L93 Difference]: Finished difference Result 283 states and 307 transitions. [2018-11-10 12:21:06,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:21:06,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-11-10 12:21:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:06,893 INFO L225 Difference]: With dead ends: 283 [2018-11-10 12:21:06,893 INFO L226 Difference]: Without dead ends: 253 [2018-11-10 12:21:06,893 INFO L605 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-10 12:21:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-10 12:21:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2018-11-10 12:21:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-10 12:21:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 274 transitions. [2018-11-10 12:21:06,927 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 274 transitions. Word has length 151 [2018-11-10 12:21:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:06,927 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 274 transitions. [2018-11-10 12:21:06,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:21:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 274 transitions. [2018-11-10 12:21:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 12:21:06,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:06,928 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] [2018-11-10 12:21:06,928 INFO L424 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:06,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:06,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1945020756, now seen corresponding path program 1 times [2018-11-10 12:21:06,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:06,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:06,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:07,087 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-10 12:21:07,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:07,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 12:21:07,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 12:21:07,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 12:21:07,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:21:07,088 INFO L87 Difference]: Start difference. First operand 251 states and 274 transitions. Second operand 15 states. [2018-11-10 12:21:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:07,247 INFO L93 Difference]: Finished difference Result 318 states and 354 transitions. [2018-11-10 12:21:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 12:21:07,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 151 [2018-11-10 12:21:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:07,248 INFO L225 Difference]: With dead ends: 318 [2018-11-10 12:21:07,248 INFO L226 Difference]: Without dead ends: 283 [2018-11-10 12:21:07,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-10 12:21:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-10 12:21:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2018-11-10 12:21:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-10 12:21:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 295 transitions. [2018-11-10 12:21:07,280 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 295 transitions. Word has length 151 [2018-11-10 12:21:07,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:07,281 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 295 transitions. [2018-11-10 12:21:07,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 12:21:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 295 transitions. [2018-11-10 12:21:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 12:21:07,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:07,282 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] [2018-11-10 12:21:07,282 INFO L424 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:07,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:07,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1201404660, now seen corresponding path program 1 times [2018-11-10 12:21:07,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:07,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:07,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:07,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:07,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:07,372 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-10 12:21:07,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:07,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:21:07,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:21:07,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:21:07,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:21:07,373 INFO L87 Difference]: Start difference. First operand 268 states and 295 transitions. Second operand 9 states. [2018-11-10 12:21:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:07,441 INFO L93 Difference]: Finished difference Result 359 states and 397 transitions. [2018-11-10 12:21:07,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:21:07,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 152 [2018-11-10 12:21:07,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:07,442 INFO L225 Difference]: With dead ends: 359 [2018-11-10 12:21:07,442 INFO L226 Difference]: Without dead ends: 276 [2018-11-10 12:21:07,442 INFO L605 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-10 12:21:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-10 12:21:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 268. [2018-11-10 12:21:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-10 12:21:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 294 transitions. [2018-11-10 12:21:07,462 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 294 transitions. Word has length 152 [2018-11-10 12:21:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:07,462 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 294 transitions. [2018-11-10 12:21:07,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:21:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 294 transitions. [2018-11-10 12:21:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 12:21:07,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:07,464 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] [2018-11-10 12:21:07,464 INFO L424 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:07,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:07,464 INFO L82 PathProgramCache]: Analyzing trace with hash -552499366, now seen corresponding path program 1 times [2018-11-10 12:21:07,464 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:07,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:07,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:07,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:07,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:07,583 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-10 12:21:07,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:21:07,584 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/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-10 12:21:07,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:07,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:21:07,910 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-10 12:21:07,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:21:07,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-11-10 12:21:07,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 12:21:07,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 12:21:07,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-10 12:21:07,939 INFO L87 Difference]: Start difference. First operand 268 states and 294 transitions. Second operand 21 states. [2018-11-10 12:21:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:08,143 INFO L93 Difference]: Finished difference Result 314 states and 346 transitions. [2018-11-10 12:21:08,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:21:08,145 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 153 [2018-11-10 12:21:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:08,146 INFO L225 Difference]: With dead ends: 314 [2018-11-10 12:21:08,146 INFO L226 Difference]: Without dead ends: 273 [2018-11-10 12:21:08,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-11-10 12:21:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-10 12:21:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 262. [2018-11-10 12:21:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-10 12:21:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 285 transitions. [2018-11-10 12:21:08,186 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 285 transitions. Word has length 153 [2018-11-10 12:21:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:08,186 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 285 transitions. [2018-11-10 12:21:08,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 12:21:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 285 transitions. [2018-11-10 12:21:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 12:21:08,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:08,188 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, 1] [2018-11-10 12:21:08,188 INFO L424 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:08,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:08,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1980614348, now seen corresponding path program 1 times [2018-11-10 12:21:08,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:08,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:08,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:08,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:08,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:08,295 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-10 12:21:08,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:21:08,296 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/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-10 12:21:08,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:08,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:21:08,517 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-10 12:21:08,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:21:08,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-11-10 12:21:08,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 12:21:08,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 12:21:08,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:21:08,545 INFO L87 Difference]: Start difference. First operand 262 states and 285 transitions. Second operand 14 states. [2018-11-10 12:21:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:08,734 INFO L93 Difference]: Finished difference Result 324 states and 350 transitions. [2018-11-10 12:21:08,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:21:08,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2018-11-10 12:21:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:08,736 INFO L225 Difference]: With dead ends: 324 [2018-11-10 12:21:08,736 INFO L226 Difference]: Without dead ends: 247 [2018-11-10 12:21:08,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 160 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-10 12:21:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-10 12:21:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2018-11-10 12:21:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-10 12:21:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 250 transitions. [2018-11-10 12:21:08,774 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 250 transitions. Word has length 159 [2018-11-10 12:21:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:08,774 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 250 transitions. [2018-11-10 12:21:08,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 12:21:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 250 transitions. [2018-11-10 12:21:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 12:21:08,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:08,776 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, 1, 1, 1] [2018-11-10 12:21:08,776 INFO L424 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:08,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:08,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1087506197, now seen corresponding path program 1 times [2018-11-10 12:21:08,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:08,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:08,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:08,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:08,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:08,864 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-10 12:21:08,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:08,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:21:08,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:21:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:21:08,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:21:08,865 INFO L87 Difference]: Start difference. First operand 233 states and 250 transitions. Second operand 6 states. [2018-11-10 12:21:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:08,920 INFO L93 Difference]: Finished difference Result 324 states and 348 transitions. [2018-11-10 12:21:08,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:21:08,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2018-11-10 12:21:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:08,922 INFO L225 Difference]: With dead ends: 324 [2018-11-10 12:21:08,922 INFO L226 Difference]: Without dead ends: 238 [2018-11-10 12:21:08,925 INFO L605 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-10 12:21:08,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-10 12:21:08,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2018-11-10 12:21:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-10 12:21:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 248 transitions. [2018-11-10 12:21:08,959 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 248 transitions. Word has length 161 [2018-11-10 12:21:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:08,960 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 248 transitions. [2018-11-10 12:21:08,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:21:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 248 transitions. [2018-11-10 12:21:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 12:21:08,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:08,961 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, 1, 1, 1] [2018-11-10 12:21:08,961 INFO L424 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:08,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:08,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1950494539, now seen corresponding path program 1 times [2018-11-10 12:21:08,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:08,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:08,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:08,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:08,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:09,074 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-10 12:21:09,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:21:09,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 12:21:09,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:21:09,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:21:09,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:21:09,076 INFO L87 Difference]: Start difference. First operand 232 states and 248 transitions. Second operand 10 states. [2018-11-10 12:21:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:09,814 INFO L93 Difference]: Finished difference Result 458 states and 491 transitions. [2018-11-10 12:21:09,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 12:21:09,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 162 [2018-11-10 12:21:09,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:09,816 INFO L225 Difference]: With dead ends: 458 [2018-11-10 12:21:09,816 INFO L226 Difference]: Without dead ends: 235 [2018-11-10 12:21:09,816 INFO L605 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-10 12:21:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-10 12:21:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-11-10 12:21:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-10 12:21:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 247 transitions. [2018-11-10 12:21:09,835 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 247 transitions. Word has length 162 [2018-11-10 12:21:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:09,835 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 247 transitions. [2018-11-10 12:21:09,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:21:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 247 transitions. [2018-11-10 12:21:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 12:21:09,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:21:09,836 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, 1, 1, 1] [2018-11-10 12:21:09,836 INFO L424 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:21:09,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:21:09,836 INFO L82 PathProgramCache]: Analyzing trace with hash -503913673, now seen corresponding path program 1 times [2018-11-10 12:21:09,837 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:21:09,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:21:09,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:09,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:09,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:21:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:09,943 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-10 12:21:09,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:21:09,943 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/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-10 12:21:09,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:21:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:21:10,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:21:10,121 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-10 12:21:10,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:21:10,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2018-11-10 12:21:10,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 12:21:10,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 12:21:10,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-11-10 12:21:10,140 INFO L87 Difference]: Start difference. First operand 232 states and 247 transitions. Second operand 19 states. [2018-11-10 12:21:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:21:10,893 INFO L93 Difference]: Finished difference Result 304 states and 327 transitions. [2018-11-10 12:21:10,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 12:21:10,894 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 162 [2018-11-10 12:21:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:21:10,894 INFO L225 Difference]: With dead ends: 304 [2018-11-10 12:21:10,894 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:21:10,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 12:21:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:21:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:21:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:21:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:21:10,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2018-11-10 12:21:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:21:10,896 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:21:10,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 12:21:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:21:10,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:21:10,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:21:11,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:11,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:21:12,906 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2018-11-10 12:21:13,172 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 79 [2018-11-10 12:21:13,295 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 66 [2018-11-10 12:21:13,414 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2018-11-10 12:21:13,565 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2018-11-10 12:21:13,831 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 82 [2018-11-10 12:21:13,935 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2018-11-10 12:21:14,067 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2018-11-10 12:21:14,303 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 79 [2018-11-10 12:21:14,693 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 66 [2018-11-10 12:21:14,797 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 1 [2018-11-10 12:21:15,182 WARN L179 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 96 [2018-11-10 12:21:15,878 WARN L179 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 108 [2018-11-10 12:21:16,323 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 79 [2018-11-10 12:21:16,442 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2018-11-10 12:21:16,882 WARN L179 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 102 [2018-11-10 12:21:17,138 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 79 [2018-11-10 12:21:17,315 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 62 [2018-11-10 12:21:17,497 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 1 [2018-11-10 12:21:17,648 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 81 [2018-11-10 12:21:18,196 WARN L179 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 105 [2018-11-10 12:21:18,507 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 97 [2018-11-10 12:21:18,641 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2018-11-10 12:21:19,140 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 85 [2018-11-10 12:21:19,310 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2018-11-10 12:21:20,073 WARN L179 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 110 [2018-11-10 12:21:20,247 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2018-11-10 12:21:20,546 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 91 [2018-11-10 12:21:20,938 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2018-11-10 12:21:21,303 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 94 [2018-11-10 12:21:21,416 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 1 [2018-11-10 12:21:21,623 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 83 [2018-11-10 12:21:21,740 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2018-11-10 12:21:21,858 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 1 [2018-11-10 12:21:22,219 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 95 [2018-11-10 12:21:22,367 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2018-11-10 12:21:22,591 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2018-11-10 12:21:23,216 WARN L179 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 93 [2018-11-10 12:21:23,566 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 95 [2018-11-10 12:21:24,488 WARN L179 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 114 [2018-11-10 12:21:24,600 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 79 [2018-11-10 12:21:24,860 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 79 [2018-11-10 12:21:24,964 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2018-11-10 12:21:25,139 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 77 [2018-11-10 12:21:25,240 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2018-11-10 12:21:25,750 WARN L179 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 110 [2018-11-10 12:21:26,094 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 79 [2018-11-10 12:21:26,317 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 74 [2018-11-10 12:21:26,546 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2018-11-10 12:21:26,779 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2018-11-10 12:21:27,162 WARN L179 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 94 [2018-11-10 12:21:27,625 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 98 [2018-11-10 12:21:28,159 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 95 [2018-11-10 12:21:28,892 WARN L179 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 114 [2018-11-10 12:21:29,090 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2018-11-10 12:21:29,294 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2018-11-10 12:21:29,421 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 85 [2018-11-10 12:21:29,663 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2018-11-10 12:21:29,804 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 74 [2018-11-10 12:21:29,924 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2018-11-10 12:21:30,084 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 74 [2018-11-10 12:21:30,195 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2018-11-10 12:21:30,556 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2018-11-10 12:21:30,918 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 68 [2018-11-10 12:21:31,332 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2018-11-10 12:21:31,573 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2018-11-10 12:21:31,678 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 58 [2018-11-10 12:21:31,894 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2018-11-10 12:21:32,379 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 77 [2018-11-10 12:21:32,463 INFO L425 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 908 929) no Hoare annotation was computed. [2018-11-10 12:21:32,464 INFO L425 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 908 929) no Hoare annotation was computed. [2018-11-10 12:21:32,464 INFO L428 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 908 929) the Hoare annotation is: true [2018-11-10 12:21:32,464 INFO L428 ceAbstractionStarter]: At program point L918(lines 917 927) the Hoare annotation is: true [2018-11-10 12:21:32,464 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 919 926) no Hoare annotation was computed. [2018-11-10 12:21:32,464 INFO L428 ceAbstractionStarter]: At program point L916(lines 915 927) the Hoare annotation is: true [2018-11-10 12:21:32,464 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 927) no Hoare annotation was computed. [2018-11-10 12:21:32,464 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 919 926) no Hoare annotation was computed. [2018-11-10 12:21:32,464 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 66 86) no Hoare annotation was computed. [2018-11-10 12:21:32,464 INFO L421 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 66 86) 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(~DC~0)|)) (< ~PagingReferenceCount~0 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 ~PagingReferenceCount~0) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~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-10 12:21:32,464 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 66 86) no Hoare annotation was computed. [2018-11-10 12:21:32,465 INFO L425 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 930 950) no Hoare annotation was computed. [2018-11-10 12:21:32,465 INFO L428 ceAbstractionStarter]: At program point L939(lines 938 948) the Hoare annotation is: true [2018-11-10 12:21:32,465 INFO L428 ceAbstractionStarter]: At program point L937(lines 936 948) the Hoare annotation is: true [2018-11-10 12:21:32,465 INFO L425 ceAbstractionStarter]: For program point L936(lines 936 948) no Hoare annotation was computed. [2018-11-10 12:21:32,465 INFO L428 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 930 950) the Hoare annotation is: true [2018-11-10 12:21:32,465 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 940 947) no Hoare annotation was computed. [2018-11-10 12:21:32,465 INFO L425 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 930 950) no Hoare annotation was computed. [2018-11-10 12:21:32,465 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 940 947) no Hoare annotation was computed. [2018-11-10 12:21:32,465 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 646 652) no Hoare annotation was computed. [2018-11-10 12:21:32,465 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsENTRY(lines 646 652) no Hoare annotation was computed. [2018-11-10 12:21:32,465 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsFINAL(lines 646 652) no Hoare annotation was computed. [2018-11-10 12:21:32,465 INFO L421 ceAbstractionStarter]: At program point L225(lines 224 419) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= .cse3 ~SKIP1~0) (<= .cse4 ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= 1 ~s~0) (<= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (< 0 ~PagingReferenceCount~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2)))) [2018-11-10 12:21:32,466 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2018-11-10 12:21:32,466 INFO L425 ceAbstractionStarter]: For program point L192-2(lines 192 194) no Hoare annotation was computed. [2018-11-10 12:21:32,466 INFO L421 ceAbstractionStarter]: At program point L341(line 341) the Hoare annotation is: (let ((.cse21 (+ ~DC~0 2)) (.cse22 (+ ~SKIP1~0 2)) (.cse23 (+ ~DC~0 5))) (let ((.cse4 (<= .cse23 ~IPC~0)) (.cse5 (= 0 ~pended~0)) (.cse6 (<= ~PagingReferenceCount~0 1)) (.cse7 (= 0 ~customIrp~0)) (.cse8 (= 0 ~myStatus~0)) (.cse9 (<= ~MPR3~0 6)) (.cse10 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (<= 1 ~setEventCalled~0)) (.cse12 (<= 6 ~MPR3~0)) (.cse14 (<= FloppyPnp_~__cil_tmp30~0 259)) (.cse15 (<= .cse22 ~MPR1~0)) (.cse16 (<= 1 ~compRegistered~0)) (.cse17 (<= 259 FloppyPnp_~__cil_tmp30~0)) (.cse18 (<= .cse21 ~SKIP2~0)) (.cse19 (<= ~setEventCalled~0 1)) (.cse20 (< 0 ~PagingReferenceCount~0)) (.cse13 (+ ~NP~0 2))) (let ((.cse0 (or (< ~SKIP1~0 .cse13) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse21) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse22) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse23) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and .cse4 .cse5 .cse6 .cse7 (<= 1 ~s~0) .cse8 (<= ~s~0 1) .cse9 .cse10 .cse11 .cse12 .cse14 (= ~s~0 ~NP~0) (not (= 259 FloppyPnp_~ntStatus~0)) (= |old(~s~0)| ~s~0) .cse15 .cse16 .cse17 .cse18 (<= (+ ~s~0 2) ~SKIP1~0) .cse19 .cse20)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and (<= 1 ~NP~0) .cse4 .cse5 .cse6 .cse7 (<= ~MPR3~0 ~s~0) .cse8 (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) .cse9 .cse10 .cse11 .cse12 (<= .cse13 ~SKIP1~0) .cse14 .cse15 .cse16 .cse17 (<= ~s~0 ~MPR3~0) .cse18 .cse19 .cse20))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3))))) [2018-11-10 12:21:32,466 INFO L425 ceAbstractionStarter]: For program point L341-1(line 341) no Hoare annotation was computed. [2018-11-10 12:21:32,466 INFO L425 ceAbstractionStarter]: For program point L209(lines 209 424) no Hoare annotation was computed. [2018-11-10 12:21:32,466 INFO L425 ceAbstractionStarter]: For program point L300(lines 300 306) no Hoare annotation was computed. [2018-11-10 12:21:32,466 INFO L421 ceAbstractionStarter]: At program point L325(line 325) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,466 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 290) no Hoare annotation was computed. [2018-11-10 12:21:32,466 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 421) no Hoare annotation was computed. [2018-11-10 12:21:32,467 INFO L421 ceAbstractionStarter]: At program point L408(line 408) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,467 INFO L425 ceAbstractionStarter]: For program point L408-1(lines 404 410) no Hoare annotation was computed. [2018-11-10 12:21:32,467 INFO L421 ceAbstractionStarter]: At program point L243(line 243) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,467 INFO L425 ceAbstractionStarter]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2018-11-10 12:21:32,467 INFO L421 ceAbstractionStarter]: At program point L202(line 202) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse3) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= .cse4 ~SKIP2~0)))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-10 12:21:32,467 INFO L425 ceAbstractionStarter]: For program point L235-1(lines 228 416) no Hoare annotation was computed. [2018-11-10 12:21:32,467 INFO L425 ceAbstractionStarter]: For program point L202-1(line 202) no Hoare annotation was computed. [2018-11-10 12:21:32,467 INFO L425 ceAbstractionStarter]: For program point $Ultimate##21(lines 228 418) no Hoare annotation was computed. [2018-11-10 12:21:32,467 INFO L425 ceAbstractionStarter]: For program point $Ultimate##20(lines 228 418) no Hoare annotation was computed. [2018-11-10 12:21:32,467 INFO L421 ceAbstractionStarter]: At program point L392(lines 392 393) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= .cse3 ~SKIP1~0) (<= 1 ~NP~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) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (= ~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-10 12:21:32,467 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2018-11-10 12:21:32,468 INFO L425 ceAbstractionStarter]: For program point L392-1(lines 392 393) no Hoare annotation was computed. [2018-11-10 12:21:32,468 INFO L421 ceAbstractionStarter]: At program point L227(lines 226 419) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse0 (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) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (< 0 ~PagingReferenceCount~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse1 .cse0 (not (= |old(~myStatus~0)| 0)) .cse2)))) [2018-11-10 12:21:32,468 INFO L421 ceAbstractionStarter]: At program point L417(lines 228 418) the Hoare annotation is: (let ((.cse29 (+ ~DC~0 2)) (.cse31 (+ ~DC~0 5))) (let ((.cse30 (+ ~SKIP1~0 2)) (.cse28 (+ ~NP~0 2)) (.cse32 (= ~DC~0 ~s~0)) (.cse15 (<= .cse31 ~IPC~0)) (.cse16 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse21 (= 0 ~pended~0)) (.cse18 (<= .cse29 ~SKIP2~0))) (let ((.cse14 (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0))) (.cse20 (<= 1 ~NP~0)) (.cse11 (and .cse32 .cse15 .cse16 .cse21 .cse18)) (.cse13 (= ~NP~0 |old(~s~0)|)) (.cse24 (<= ~MPR3~0 6)) (.cse10 (<= .cse28 ~SKIP1~0)) (.cse26 (<= ~PagingReferenceCount~0 1)) (.cse22 (= ~SKIP2~0 ~s~0)) (.cse12 (<= .cse30 ~MPR1~0)) (.cse23 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0)) (.cse25 (<= ~compRegistered~0 0)) (.cse27 (< 0 ~PagingReferenceCount~0)) (.cse17 (= 0 ~compRegistered~0)) (.cse19 (= ~pended~0 1))) (let ((.cse0 (and .cse32 .cse17 .cse19)) (.cse1 (or (< ~SKIP1~0 .cse28) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse29) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse30) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse31) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and .cse10 .cse15 .cse21 .cse26 .cse22 .cse12 .cse23 .cse16 .cse18 .cse25 .cse27)) (.cse4 (and .cse15 .cse16 (= ~s~0 ~NP~0) .cse17 .cse18 .cse19)) (.cse3 (< 0 ~MaximumInterfaceType~0)) (.cse5 (and .cse10 .cse15 .cse16 .cse17 .cse18 .cse22 .cse19)) (.cse6 (and (and (and .cse20 (and .cse10 .cse11 .cse26 .cse12 .cse13 .cse27)) .cse24) (not (= 259 FloppyPnp_~ntStatus~0)))) (.cse7 (and .cse10 .cse20 .cse15 .cse21 .cse22 .cse12 (= 0 ~customIrp~0) .cse14 .cse23 .cse18 (<= ~NP~0 1) .cse24 (= |old(~customIrp~0)| ~customIrp~0) (not (= |old(~s~0)| ~MPR3~0)) .cse25 (<= 6 ~MPR3~0))) (.cse8 (and .cse15 .cse16 .cse17 .cse18 .cse19 (= ~IPC~0 ~s~0))) (.cse9 (and .cse10 (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) .cse11 .cse12 .cse13 .cse14))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (not (= |old(~myStatus~0)| 0)) .cse4 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9)))))) [2018-11-10 12:21:32,468 INFO L421 ceAbstractionStarter]: At program point L351(line 351) the Hoare annotation is: (let ((.cse11 (+ ~DC~0 2)) (.cse13 (+ ~DC~0 5)) (.cse12 (+ ~SKIP1~0 2))) (let ((.cse4 (and (<= ~PagingReferenceCount~0 1) (<= .cse11 ~SKIP2~0) (and (= 0 ~pended~0) (<= .cse13 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= .cse12 ~MPR1~0) (< 0 ~PagingReferenceCount~0))) (.cse5 (<= ~s~0 1)) (.cse6 (<= ~MPR3~0 6)) (.cse7 (= 0 ~customIrp~0)) (.cse8 (<= 1 ~s~0)) (.cse9 (= |old(~customIrp~0)| ~customIrp~0)) (.cse10 (<= 6 ~MPR3~0))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse11) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse12) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse13) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and .cse4 (not (= 259 FloppyPnp_~ntStatus~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) .cse10)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and (= 0 FloppyPnp_~ntStatus~0) .cse4 (= 0 ~myStatus~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3))))) [2018-11-10 12:21:32,468 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 330) no Hoare annotation was computed. [2018-11-10 12:21:32,469 INFO L421 ceAbstractionStarter]: At program point L219(lines 215 422) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~s~0)| ~s~0) (= 0 FloppyPnp_~ntStatus~0) (< 0 ~PagingReferenceCount~0))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,469 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2018-11-10 12:21:32,469 INFO L421 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (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) (= |old(~s~0)| ~NP~0) (<= .cse5 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~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-10 12:21:32,469 INFO L425 ceAbstractionStarter]: For program point L310-1(line 310) no Hoare annotation was computed. [2018-11-10 12:21:32,469 INFO L421 ceAbstractionStarter]: At program point L335(line 335) the Hoare annotation is: (let ((.cse5 (+ ~DC~0 2)) (.cse4 (+ ~SKIP1~0 2)) (.cse3 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse5) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse4) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse3) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= .cse3 ~IPC~0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (= 0 ~customIrp~0) (<= 1 ~s~0) (= 0 ~myStatus~0) (<= ~s~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0) (= ~s~0 ~NP~0) (= |old(~s~0)| ~s~0) (<= .cse4 ~MPR1~0) (<= 1 ~compRegistered~0) (= 0 FloppyPnp_~ntStatus~0) (<= .cse5 ~SKIP2~0) (<= (+ ~s~0 2) ~SKIP1~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-10 12:21:32,469 INFO L425 ceAbstractionStarter]: For program point L335-1(line 335) no Hoare annotation was computed. [2018-11-10 12:21:32,469 INFO L421 ceAbstractionStarter]: At program point L261(lines 261 262) the Hoare annotation is: (let ((.cse4 (+ ~NP~0 2)) (.cse7 (+ ~DC~0 2)) (.cse8 (+ ~SKIP1~0 2)) (.cse5 (+ ~DC~0 5)) (.cse6 (= 0 ~compRegistered~0))) (let ((.cse0 (and (= 0 ~pended~0) .cse6 (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (or (< ~SKIP1~0 .cse4) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse7) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse8) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse5) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and (<= .cse4 ~SKIP1~0) (<= .cse5 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) .cse6 (<= .cse7 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse8 ~MPR1~0) (= ~pended~0 1)))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3)))) [2018-11-10 12:21:32,469 INFO L425 ceAbstractionStarter]: For program point L294-1(lines 228 416) no Hoare annotation was computed. [2018-11-10 12:21:32,469 INFO L425 ceAbstractionStarter]: For program point L261-1(lines 261 262) no Hoare annotation was computed. [2018-11-10 12:21:32,469 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 423) no Hoare annotation was computed. [2018-11-10 12:21:32,470 INFO L421 ceAbstractionStarter]: At program point L369(line 369) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (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) (= |old(~s~0)| ~NP~0) (<= .cse5 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~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-10 12:21:32,470 INFO L425 ceAbstractionStarter]: For program point L369-1(line 369) no Hoare annotation was computed. [2018-11-10 12:21:32,470 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 276) no Hoare annotation was computed. [2018-11-10 12:21:32,470 INFO L425 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2018-11-10 12:21:32,470 INFO L425 ceAbstractionStarter]: For program point L427-2(lines 427 429) no Hoare annotation was computed. [2018-11-10 12:21:32,470 INFO L421 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,470 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 420) no Hoare annotation was computed. [2018-11-10 12:21:32,470 INFO L421 ceAbstractionStarter]: At program point L213(lines 209 424) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (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 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= 1 ~s~0) (<= ~s~0 ~NP~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (<= ~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-10 12:21:32,470 INFO L421 ceAbstractionStarter]: At program point L304(line 304) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,471 INFO L425 ceAbstractionStarter]: For program point L304-1(lines 300 306) no Hoare annotation was computed. [2018-11-10 12:21:32,471 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 205) no Hoare annotation was computed. [2018-11-10 12:21:32,471 INFO L421 ceAbstractionStarter]: At program point L288(line 288) the Hoare annotation is: (let ((.cse6 (+ ~DC~0 2)) (.cse4 (+ ~DC~0 5)) (.cse5 (= 0 ~compRegistered~0))) (let ((.cse0 (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~pended~0) .cse5 (= |old(~s~0)| ~s~0))) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and (<= .cse4 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) .cse5 (<= .cse6 ~SKIP2~0) (= ~pended~0 1)))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3)))) [2018-11-10 12:21:32,471 INFO L421 ceAbstractionStarter]: At program point L255(line 255) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (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 ~MPR1~0) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (<= 1 ~s~0) (<= ~s~0 ~NP~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (<= ~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-10 12:21:32,471 INFO L421 ceAbstractionStarter]: At program point L222(lines 221 420) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse1 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse0 (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) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (< 0 ~PagingReferenceCount~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2) (or .cse1 .cse0 (not (= |old(~myStatus~0)| 0)) .cse2)))) [2018-11-10 12:21:32,471 INFO L425 ceAbstractionStarter]: For program point L255-1(line 255) no Hoare annotation was computed. [2018-11-10 12:21:32,472 INFO L421 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse12 (+ ~SKIP1~0 2)) (.cse11 (+ ~DC~0 2)) (.cse13 (+ ~DC~0 5)) (.cse10 (+ ~NP~0 2))) (let ((.cse4 (<= .cse10 ~SKIP1~0)) (.cse5 (<= .cse13 ~IPC~0)) (.cse6 (= 0 ~compRegistered~0)) (.cse9 (<= .cse11 ~SKIP2~0)) (.cse7 (<= .cse12 ~MPR1~0)) (.cse8 (= ~s~0 ~SKIP1~0))) (let ((.cse0 (or (< ~SKIP1~0 .cse10) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse11) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse12) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse13) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and .cse4 .cse5 (<= (+ ~NP~0 5) ~MPR3~0) .cse6 .cse9 .cse7 (= ~pended~0 1) .cse8)) (.cse3 (and .cse4 (<= 1 ~NP~0) .cse5 (= 0 ~pended~0) .cse6 (= |old(~s~0)| ~NP~0) .cse7 .cse8 (= 0 ~customIrp~0) .cse9 (<= ~NP~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (<= 6 ~MPR3~0)))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3))))) [2018-11-10 12:21:32,472 INFO L425 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-11-10 12:21:32,472 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 245) no Hoare annotation was computed. [2018-11-10 12:21:32,472 INFO L425 ceAbstractionStarter]: For program point L206(lines 206 425) no Hoare annotation was computed. [2018-11-10 12:21:32,472 INFO L421 ceAbstractionStarter]: At program point L363(line 363) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,472 INFO L425 ceAbstractionStarter]: For program point L396-1(lines 396 400) no Hoare annotation was computed. [2018-11-10 12:21:32,472 INFO L425 ceAbstractionStarter]: For program point L363-1(lines 359 365) no Hoare annotation was computed. [2018-11-10 12:21:32,472 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-11-10 12:21:32,472 INFO L425 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-11-10 12:21:32,472 INFO L425 ceAbstractionStarter]: For program point L264-2(lines 264 266) no Hoare annotation was computed. [2018-11-10 12:21:32,472 INFO L421 ceAbstractionStarter]: At program point L388(line 388) 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) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,472 INFO L425 ceAbstractionStarter]: For program point L388-1(line 388) no Hoare annotation was computed. [2018-11-10 12:21:32,472 INFO L425 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 159 432) no Hoare annotation was computed. [2018-11-10 12:21:32,473 INFO L421 ceAbstractionStarter]: At program point L380(line 380) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,473 INFO L425 ceAbstractionStarter]: For program point L380-1(lines 376 382) no Hoare annotation was computed. [2018-11-10 12:21:32,473 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 422) no Hoare annotation was computed. [2018-11-10 12:21:32,473 INFO L425 ceAbstractionStarter]: For program point L339(lines 339 344) no Hoare annotation was computed. [2018-11-10 12:21:32,473 INFO L425 ceAbstractionStarter]: For program point L339-2(lines 339 344) no Hoare annotation was computed. [2018-11-10 12:21:32,473 INFO L421 ceAbstractionStarter]: At program point L207(lines 206 425) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 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)) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and .cse2 .cse3 .cse4 (= |old(~myStatus~0)| ~myStatus~0) .cse5 .cse6 .cse7 .cse8)) (or .cse0 (and .cse2 .cse3 .cse4 (= 0 ~myStatus~0) .cse5 .cse6 .cse7 .cse8) (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-10 12:21:32,473 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 329) no Hoare annotation was computed. [2018-11-10 12:21:32,473 INFO L425 ceAbstractionStarter]: For program point L323-1(lines 318 330) no Hoare annotation was computed. [2018-11-10 12:21:32,473 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 419) no Hoare annotation was computed. [2018-11-10 12:21:32,473 INFO L421 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (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) (= |old(~s~0)| ~NP~0) (<= .cse5 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~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-10 12:21:32,473 INFO L425 ceAbstractionStarter]: For program point L414-1(line 414) no Hoare annotation was computed. [2018-11-10 12:21:32,474 INFO L421 ceAbstractionStarter]: At program point L249(line 249) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (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) (= |old(~s~0)| ~NP~0) (<= .cse5 ~MPR1~0) (= ~s~0 ~SKIP1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~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-10 12:21:32,474 INFO L425 ceAbstractionStarter]: For program point L249-1(line 249) no Hoare annotation was computed. [2018-11-10 12:21:32,474 INFO L421 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,474 INFO L425 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 159 432) no Hoare annotation was computed. [2018-11-10 12:21:32,474 INFO L425 ceAbstractionStarter]: For program point L274-1(lines 270 276) no Hoare annotation was computed. [2018-11-10 12:21:32,474 INFO L421 ceAbstractionStarter]: At program point L398(line 398) the Hoare annotation is: (let ((.cse3 (+ ~NP~0 2)) (.cse6 (+ ~DC~0 2)) (.cse5 (+ ~SKIP1~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 .cse3) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse6) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse4) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= .cse3 ~SKIP1~0) (<= 1 ~NP~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) (<= (+ ~NP~0 5) ~MPR3~0) (<= .cse6 ~SKIP2~0) (<= ~NP~0 1) (= ~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-10 12:21:32,474 INFO L425 ceAbstractionStarter]: For program point L398-1(line 398) no Hoare annotation was computed. [2018-11-10 12:21:32,474 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 395) no Hoare annotation was computed. [2018-11-10 12:21:32,474 INFO L425 ceAbstractionStarter]: For program point L390-2(lines 228 416) no Hoare annotation was computed. [2018-11-10 12:21:32,475 INFO L421 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 159 432) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (= 0 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= 0 ~PagingReferenceCount~0)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (= |old(~s~0)| ~s~0)) (.cse7 (<= ~PagingReferenceCount~0 0)) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and .cse2 .cse3 (= |old(~myStatus~0)| ~myStatus~0) .cse4 .cse5 .cse6 .cse7)) (or .cse0 (and .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7) (not (= |old(~myStatus~0)| 0)) .cse1))) [2018-11-10 12:21:32,475 INFO L421 ceAbstractionStarter]: At program point L704(line 704) 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(~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)|)) (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)) (< |old(~MPR3~0)| |old(~s~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-10 12:21:32,475 INFO L425 ceAbstractionStarter]: For program point L704-1(lines 700 837) no Hoare annotation was computed. [2018-11-10 12:21:32,475 INFO L425 ceAbstractionStarter]: For program point L795(lines 779 834) no Hoare annotation was computed. [2018-11-10 12:21:32,475 INFO L425 ceAbstractionStarter]: For program point L729(lines 729 777) no Hoare annotation was computed. [2018-11-10 12:21:32,475 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 666 838) no Hoare annotation was computed. [2018-11-10 12:21:32,475 INFO L425 ceAbstractionStarter]: For program point L812(lines 812 814) no Hoare annotation was computed. [2018-11-10 12:21:32,475 INFO L425 ceAbstractionStarter]: For program point L796(lines 796 831) no Hoare annotation was computed. [2018-11-10 12:21:32,475 INFO L421 ceAbstractionStarter]: At program point L730(lines 729 777) 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(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 main_~status~1)) (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)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-10 12:21:32,475 INFO L425 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-11-10 12:21:32,475 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 784) no Hoare annotation was computed. [2018-11-10 12:21:32,476 INFO L421 ceAbstractionStarter]: At program point L747(lines 746 774) 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(~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)|)) (<= 0 main_~status~1) (< |old(~MPR3~0)| |old(~s~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-10 12:21:32,476 INFO L425 ceAbstractionStarter]: For program point L739(lines 739 775) no Hoare annotation was computed. [2018-11-10 12:21:32,476 INFO L421 ceAbstractionStarter]: At program point L706(lines 700 837) the Hoare annotation is: (let ((.cse7 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse5 (= ~pended~0 1)) (.cse6 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (= 0 ~pended~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse10 (= 0 main_~status~1)) (.cse12 (= ~IPC~0 ~s~0)) (.cse11 (<= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (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)) (and .cse6 .cse7 .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse11) (and .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse8 .cse10) (and .cse6 (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse11)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (= 259 main_~status~1))) (< 0 |old(~PagingReferenceCount~0)|) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12) (and .cse6 .cse1 .cse2 .cse8 .cse4 .cse10 .cse12 .cse11) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~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-10 12:21:32,476 INFO L425 ceAbstractionStarter]: For program point L797(lines 797 830) no Hoare annotation was computed. [2018-11-10 12:21:32,476 INFO L425 ceAbstractionStarter]: For program point L756(line 756) no Hoare annotation was computed. [2018-11-10 12:21:32,476 INFO L425 ceAbstractionStarter]: For program point $Ultimate##17(lines 748 773) no Hoare annotation was computed. [2018-11-10 12:21:32,476 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 748 773) no Hoare annotation was computed. [2018-11-10 12:21:32,476 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 666 838) no Hoare annotation was computed. [2018-11-10 12:21:32,476 INFO L425 ceAbstractionStarter]: For program point L715(lines 715 718) no Hoare annotation was computed. [2018-11-10 12:21:32,476 INFO L421 ceAbstractionStarter]: At program point L715-2(lines 715 718) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= 0 ~PagingReferenceCount~0)) (.cse5 (<= ~s~0 1)) (.cse6 (<= ~MPR3~0 6)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (<= 6 ~MPR3~0)) (.cse9 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse10 (= ~s~0 ~NP~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (= 0 main_~status~1)) (.cse13 (<= ~PagingReferenceCount~0 0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ~myStatus~0 1073741637) 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (< 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)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-10 12:21:32,477 INFO L421 ceAbstractionStarter]: At program point L740(lines 739 775) 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(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (= 0 main_~status~1) (<= ~PagingReferenceCount~0 0) (<= ~s~0 ~NP~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1) (<= 0 ~PagingReferenceCount~0) (<= ~MPR3~0 6) (<= 6 ~MPR3~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)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-10 12:21:32,477 INFO L425 ceAbstractionStarter]: For program point L798(lines 798 808) no Hoare annotation was computed. [2018-11-10 12:21:32,477 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 666 838) 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(~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)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-10 12:21:32,477 INFO L425 ceAbstractionStarter]: For program point L823(lines 823 827) no Hoare annotation was computed. [2018-11-10 12:21:32,477 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2018-11-10 12:21:32,477 INFO L425 ceAbstractionStarter]: For program point L766(line 766) no Hoare annotation was computed. [2018-11-10 12:21:32,477 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 828) no Hoare annotation was computed. [2018-11-10 12:21:32,477 INFO L425 ceAbstractionStarter]: For program point L734(lines 734 776) no Hoare annotation was computed. [2018-11-10 12:21:32,477 INFO L421 ceAbstractionStarter]: At program point L825(line 825) 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-10 12:21:32,477 INFO L425 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2018-11-10 12:21:32,477 INFO L425 ceAbstractionStarter]: For program point L751(line 751) no Hoare annotation was computed. [2018-11-10 12:21:32,477 INFO L421 ceAbstractionStarter]: At program point L801(line 801) 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-10 12:21:32,478 INFO L421 ceAbstractionStarter]: At program point L735(lines 734 776) 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(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 main_~status~1)) (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)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-11-10 12:21:32,478 INFO L421 ceAbstractionStarter]: At program point L810(lines 797 830) the Hoare annotation is: (let ((.cse2 (= ~DC~0 ~s~0)) (.cse5 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse9 (= main_~status~1 ~lowerDriverReturn~0)) (.cse11 (<= ~compRegistered~0 0)) (.cse0 (and .cse2 .cse5 .cse4 .cse6))) (let ((.cse12 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse8 (or (and .cse9 .cse4 .cse5 .cse6 .cse11) .cse0))) (let ((.cse1 (not (= 259 main_~status~1))) (.cse3 (= 0 main_~status~1)) (.cse7 (and .cse12 (and .cse10 .cse8)))) (or (and .cse0 .cse1) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse2 .cse3) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (and .cse4 .cse5 .cse6 (= ~pended~0 1)) (and (and (and (<= 1 ~NP~0) .cse7) (<= ~MPR3~0 6)) .cse1) (and .cse8 .cse3) (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 .cse7 (<= (+ main_~status~1 1073741536) 0)) (and .cse9 (and (and .cse10 .cse4 .cse5 .cse6 .cse11) .cse12 (<= ~SKIP2~0 ~s~0))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)))))) [2018-11-10 12:21:32,478 INFO L425 ceAbstractionStarter]: For program point L744(lines 744 774) no Hoare annotation was computed. [2018-11-10 12:21:32,478 INFO L421 ceAbstractionStarter]: At program point L794(lines 787 833) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~s~0)) (.cse5 (= ~pended~0 1)) (.cse9 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse8 (= ~SKIP2~0 ~s~0)) (.cse10 (= main_~status~1 ~lowerDriverReturn~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= 0 main_~status~1)) (.cse6 (= ~IPC~0 ~s~0)) (.cse7 (<= ~compRegistered~0 0))) (or (and (and .cse0 .cse1 .cse2 .cse3) (not (= 259 main_~status~1))) (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 .cse4) (and .cse2 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse8 (and .cse9 (or (and .cse10 .cse2 .cse1 .cse3 .cse4 .cse7) (and .cse2 .cse1 .cse3 .cse5 .cse7)))) (not (= |old(~s~0)| |old(~DC~0)|)) (< |old(~PagingReferenceCount~0)| 0) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse5) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (and .cse10 (and .cse9 .cse2 .cse1 .cse3 .cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse7)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse10 .cse2 .cse1 .cse3 .cse4 .cse6 .cse7) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-10 12:21:32,478 INFO L425 ceAbstractionStarter]: For program point L761(line 761) no Hoare annotation was computed. [2018-11-10 12:21:32,478 INFO L421 ceAbstractionStarter]: At program point L819(line 819) 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-10 12:21:32,479 INFO L421 ceAbstractionStarter]: At program point L786(lines 779 834) the Hoare annotation is: (let ((.cse3 (= 0 ~compRegistered~0)) (.cse5 (= ~pended~0 1)) (.cse0 (= ~DC~0 ~s~0)) (.cse6 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse7 (= ~SKIP2~0 ~s~0)) (.cse9 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse10 (= 0 ~pended~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (= 0 main_~status~1)) (.cse8 (= ~IPC~0 ~s~0)) (.cse12 (<= ~compRegistered~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (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 .cse6 .cse2 .cse1 .cse3 .cse4 .cse7 .cse5) (and .cse2 .cse1 .cse3 .cse4 .cse5 .cse8) (not (= |old(~compRegistered~0)| 0)) (and .cse9 .cse6 .cse1 .cse2 .cse10 .cse4 .cse7 .cse11 .cse12) (and .cse0 .cse10 .cse11) (and (and .cse0 .cse1 .cse2 .cse10 .cse4) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (< 0 |old(~PagingReferenceCount~0)|) (and .cse9 (and .cse6 .cse1 .cse2 .cse10 .cse4 .cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0) .cse12)) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse8 .cse12) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~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-10 12:21:32,479 INFO L425 ceAbstractionStarter]: For program point L720(lines 706 778) no Hoare annotation was computed. [2018-11-10 12:21:32,479 INFO L421 ceAbstractionStarter]: At program point L745(lines 744 774) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= 0 ~PagingReferenceCount~0)) (.cse5 (<= ~s~0 1)) (.cse6 (<= ~MPR3~0 6)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (<= 6 ~MPR3~0)) (.cse9 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse10 (= ~s~0 ~NP~0)) (.cse11 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (= 0 main_~status~1)) (.cse13 (<= ~PagingReferenceCount~0 0)) (.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= |old(~myStatus~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ~myStatus~0 1073741637) 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (< 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)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-11-10 12:21:32,479 INFO L421 ceAbstractionStarter]: At program point L1176(line 1176) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-10 12:21:32,479 INFO L425 ceAbstractionStarter]: For program point L1176-1(line 1176) no Hoare annotation was computed. [2018-11-10 12:21:32,479 INFO L425 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 1167 1180) no Hoare annotation was computed. [2018-11-10 12:21:32,479 INFO L421 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 1167 1180) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-11-10 12:21:32,479 INFO L425 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 1167 1180) no Hoare annotation was computed. [2018-11-10 12:21:32,479 INFO L421 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (or (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~setEventCalled~0 1) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1) (or .cse0 (not (= ~myStatus~0 0)) .cse1))) [2018-11-10 12:21:32,481 INFO L425 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-11-10 12:21:32,482 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 951 964) the Hoare annotation is: (let ((.cse3 (= 0 ~pended~0)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (not .cse3) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse4)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~setEventCalled~0 1) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= (+ ~NP~0 2) ~SKIP1~0) .cse3 (= ~s~0 ~NP~0) (<= .cse4 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2)))) [2018-11-10 12:21:32,482 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 951 964) no Hoare annotation was computed. [2018-11-10 12:21:32,482 INFO L428 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: true [2018-11-10 12:21:32,482 INFO L425 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-11-10 12:21:32,482 INFO L428 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 601 610) the Hoare annotation is: true [2018-11-10 12:21:32,482 INFO L425 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 601 610) no Hoare annotation was computed. [2018-11-10 12:21:32,482 INFO L425 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 601 610) no Hoare annotation was computed. [2018-11-10 12:21:32,482 INFO L421 ceAbstractionStarter]: At program point L1088(lines 1087 1099) the Hoare annotation is: (let ((.cse33 (+ ~DC~0 5)) (.cse34 (= 0 ~pended~0))) (let ((.cse21 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (not .cse34)) (.cse14 (< ~compRegistered~0 1)) (.cse16 (< ~IPC~0 .cse33)) (.cse31 (+ ~SKIP1~0 2)) (.cse30 (<= 1 ~s~0)) (.cse32 (+ ~DC~0 2))) (let ((.cse1 (and (<= .cse33 ~IPC~0) .cse34 (<= ~PagingReferenceCount~0 1) (<= .cse31 ~MPR1~0) (<= 1 ~compRegistered~0) .cse30 (<= ~s~0 ~NP~0) (<= .cse32 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))) (.cse29 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (< 6 ~MPR3~0)) (.cse24 (< ~NP~0 1)) (.cse26 (or .cse21 (or .cse11 .cse14 .cse16))) (.cse6 (< ~SKIP2~0 .cse32)) (.cse7 (< ~MPR3~0 6)) (.cse8 (< 1 ~NP~0)) (.cse9 (< ~MPR1~0 .cse31)) (.cse10 (< |old(~setEventCalled~0)| 1)) (.cse27 (< ~MPR3~0 |old(~s~0)|)) (.cse12 (< 1 ~PagingReferenceCount~0)) (.cse13 (<= ~PagingReferenceCount~0 0)) (.cse28 (< |old(~s~0)| ~MPR3~0)) (.cse18 (< 1 |old(~setEventCalled~0)|))) (let ((.cse0 (< 0 (+ ~myStatus~0 1073741637))) (.cse22 (not (= ~compRegistered~0 0))) (.cse3 (< 0 ~MaximumInterfaceType~0)) (.cse20 (or .cse4 .cse24 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse12 .cse13 .cse28 .cse18)) (.cse19 (and .cse30 (<= ~s~0 1) .cse29)) (.cse25 (not (= ~myStatus~0 0))) (.cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse2 (and .cse1 .cse29)) (.cse15 (< ~NP~0 |old(~s~0)|)) (.cse17 (< |old(~s~0)| 1)) (.cse23 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (or (and (= |old(~customIrp~0)| 1) .cse1 (= 0 ~customIrp~0)) .cse2) .cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (or .cse0 .cse19 .cse3 .cse20) (or .cse21 (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse9 (= |old(~s~0)| ~s~0) .cse22 .cse6 .cse16) (or .cse21 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse22 .cse11 .cse15 .cse16 .cse17 .cse23) (or .cse4 .cse24 .cse25 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse12 .cse13 .cse19 .cse23 .cse28 .cse18) (or .cse25 .cse3 .cse20 .cse19) (or .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18)))))) [2018-11-10 12:21:32,487 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1060 1101) no Hoare annotation was computed. [2018-11-10 12:21:32,488 INFO L421 ceAbstractionStarter]: At program point L1080(line 1080) the Hoare annotation is: (let ((.cse17 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not (= 0 ~pended~0))) (.cse11 (< ~compRegistered~0 1)) (.cse13 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse19 (< ~NP~0 1)) (.cse20 (or .cse17 (or .cse8 .cse11 .cse13))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< ~MPR3~0 6)) (.cse5 (< 1 ~NP~0)) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse21 (< ~MPR3~0 |old(~s~0)|)) (.cse9 (< 1 ~PagingReferenceCount~0)) (.cse10 (<= ~PagingReferenceCount~0 0)) (.cse22 (< |old(~s~0)| ~MPR3~0)) (.cse16 (< 1 |old(~setEventCalled~0)|))) (let ((.cse18 (not (= ~compRegistered~0 0))) (.cse15 (not (= |old(~customIrp~0)| 0))) (.cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse12 (< ~NP~0 |old(~s~0)|)) (.cse14 (< |old(~s~0)| 1)) (.cse23 (< 0 (+ ~myStatus~0 1073741637))) (.cse1 (not (= ~myStatus~0 0))) (.cse24 (< 0 ~MaximumInterfaceType~0)) (.cse25 (or .cse0 .cse19 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse10 .cse22 .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse12 .cse13 .cse14 .cse15) (or .cse17 (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse6 .cse18 .cse3 .cse13) (or .cse0 .cse19 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse10 .cse15 .cse22 .cse16) (or .cse23 .cse24 (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16)) (or .cse23 .cse24 .cse25) (or .cse1 .cse24 .cse25))))) [2018-11-10 12:21:32,490 INFO L425 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2018-11-10 12:21:32,490 INFO L425 ceAbstractionStarter]: For program point L1078-1(lines 1065 1084) no Hoare annotation was computed. [2018-11-10 12:21:32,490 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 1091 1098) no Hoare annotation was computed. [2018-11-10 12:21:32,491 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 1091 1098) no Hoare annotation was computed. [2018-11-10 12:21:32,491 INFO L425 ceAbstractionStarter]: For program point L1066(lines 1066 1071) no Hoare annotation was computed. [2018-11-10 12:21:32,491 INFO L425 ceAbstractionStarter]: For program point L1087(lines 1087 1099) no Hoare annotation was computed. [2018-11-10 12:21:32,491 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1060 1101) no Hoare annotation was computed. [2018-11-10 12:21:32,491 INFO L421 ceAbstractionStarter]: At program point L1073(lines 1065 1084) the Hoare annotation is: (let ((.cse24 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse19 (not (= 0 ~pended~0))) (.cse20 (< ~compRegistered~0 1)) (.cse22 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse1 (< ~NP~0 1)) (.cse3 (or .cse24 (or .cse19 .cse20 .cse22))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~MPR3~0 6)) (.cse6 (< 1 ~NP~0)) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< |old(~setEventCalled~0)| 1)) (.cse9 (< ~MPR3~0 |old(~s~0)|)) (.cse10 (< 1 ~PagingReferenceCount~0)) (.cse11 (<= ~PagingReferenceCount~0 0)) (.cse13 (< |old(~s~0)| ~MPR3~0)) (.cse14 (< 1 |old(~setEventCalled~0)|)) (.cse27 (= |old(~customIrp~0)| ~customIrp~0)) (.cse25 (= |old(~s~0)| ~s~0))) (let ((.cse26 (not (= ~compRegistered~0 0))) (.cse16 (< 0 (+ ~myStatus~0 1073741637))) (.cse18 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse15 (and .cse27 (<= 1 ~setEventCalled~0) .cse25 (<= ~setEventCalled~0 1))) (.cse21 (< ~NP~0 |old(~s~0)|)) (.cse23 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse2 (not (= ~myStatus~0 0))) (.cse17 (< 0 ~MaximumInterfaceType~0)) (.cse28 (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse16 .cse17 (or .cse0 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse10 .cse11 .cse20 .cse21 .cse22 .cse23 .cse14)) (or .cse24 (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse7 .cse25 .cse26 .cse4 .cse22) (or .cse24 .cse0 (and (<= 1 ~s~0) (<= ~s~0 1) .cse27) .cse4 .cse5 .cse6 .cse7 .cse26 .cse19 .cse21 .cse22 .cse23 .cse12) (or .cse16 .cse17 .cse28) (or .cse0 .cse2 .cse18 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse19 .cse10 .cse11 .cse20 .cse21 .cse22 .cse23 .cse12 .cse14) (or .cse2 .cse17 .cse28))))) [2018-11-10 12:21:32,493 INFO L425 ceAbstractionStarter]: For program point L1065(lines 1065 1084) no Hoare annotation was computed. [2018-11-10 12:21:32,493 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1060 1101) the Hoare annotation is: (let ((.cse18 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse20 (not (= 0 ~pended~0))) (.cse28 (< ~compRegistered~0 1)) (.cse22 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse1 (< ~NP~0 1)) (.cse3 (or .cse18 (or .cse20 .cse28 .cse22))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~MPR3~0 6)) (.cse6 (< 1 ~NP~0)) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse12 (< ~MPR3~0 |old(~s~0)|)) (.cse13 (< 1 ~PagingReferenceCount~0)) (.cse14 (<= ~PagingReferenceCount~0 0)) (.cse16 (< |old(~s~0)| ~MPR3~0)) (.cse17 (< 1 |old(~setEventCalled~0)|)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (<= 1 ~setEventCalled~0)) (.cse30 (= |old(~s~0)| ~s~0)) (.cse9 (<= ~setEventCalled~0 1))) (let ((.cse25 (< 0 (+ ~myStatus~0 1073741637))) (.cse27 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse21 (< ~NP~0 |old(~s~0)|)) (.cse23 (< |old(~s~0)| 1)) (.cse15 (not (= |old(~customIrp~0)| 0))) (.cse2 (not (= ~myStatus~0 0))) (.cse26 (< 0 ~MaximumInterfaceType~0)) (.cse24 (and .cse7 .cse8 .cse30 .cse9)) (.cse29 (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17)) (.cse19 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or (and (<= 1 ~s~0) (<= ~s~0 1) .cse7) .cse18 .cse0 .cse4 .cse5 .cse6 .cse10 .cse19 .cse20 .cse21 .cse22 .cse23 .cse15) (or .cse24 .cse25 .cse26 (or .cse0 .cse27 .cse4 .cse5 .cse6 .cse10 .cse11 .cse20 .cse13 .cse14 .cse28 .cse21 .cse22 .cse23 .cse17)) (or .cse25 .cse26 .cse29 .cse24) (or .cse0 .cse2 .cse24 .cse27 .cse4 .cse5 .cse6 .cse10 .cse11 .cse20 .cse13 .cse14 .cse28 .cse21 .cse22 .cse23 .cse15 .cse17) (or .cse2 .cse26 .cse24 .cse29) (or .cse18 (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse10 .cse19 .cse30 .cse4 .cse22))))) [2018-11-10 12:21:32,494 INFO L421 ceAbstractionStarter]: At program point L1090(lines 1089 1099) the Hoare annotation is: (let ((.cse33 (+ ~DC~0 5)) (.cse34 (= 0 ~pended~0))) (let ((.cse21 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse11 (not .cse34)) (.cse14 (< ~compRegistered~0 1)) (.cse16 (< ~IPC~0 .cse33)) (.cse31 (+ ~SKIP1~0 2)) (.cse30 (<= 1 ~s~0)) (.cse32 (+ ~DC~0 2))) (let ((.cse1 (and (<= .cse33 ~IPC~0) .cse34 (<= ~PagingReferenceCount~0 1) (<= .cse31 ~MPR1~0) (<= 1 ~compRegistered~0) .cse30 (<= ~s~0 ~NP~0) (<= .cse32 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))) (.cse29 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (< 6 ~MPR3~0)) (.cse24 (< ~NP~0 1)) (.cse26 (or .cse21 (or .cse11 .cse14 .cse16))) (.cse6 (< ~SKIP2~0 .cse32)) (.cse7 (< ~MPR3~0 6)) (.cse8 (< 1 ~NP~0)) (.cse9 (< ~MPR1~0 .cse31)) (.cse10 (< |old(~setEventCalled~0)| 1)) (.cse27 (< ~MPR3~0 |old(~s~0)|)) (.cse12 (< 1 ~PagingReferenceCount~0)) (.cse13 (<= ~PagingReferenceCount~0 0)) (.cse28 (< |old(~s~0)| ~MPR3~0)) (.cse18 (< 1 |old(~setEventCalled~0)|))) (let ((.cse0 (< 0 (+ ~myStatus~0 1073741637))) (.cse22 (not (= ~compRegistered~0 0))) (.cse3 (< 0 ~MaximumInterfaceType~0)) (.cse20 (or .cse4 .cse24 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse12 .cse13 .cse28 .cse18)) (.cse19 (and .cse30 (<= ~s~0 1) .cse29)) (.cse25 (not (= ~myStatus~0 0))) (.cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse2 (and .cse1 .cse29)) (.cse15 (< ~NP~0 |old(~s~0)|)) (.cse17 (< |old(~s~0)| 1)) (.cse23 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (or (and (= |old(~customIrp~0)| 1) .cse1 (= 0 ~customIrp~0)) .cse2) .cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (or .cse0 .cse19 .cse3 .cse20) (or .cse21 (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse9 (= |old(~s~0)| ~s~0) .cse22 .cse6 .cse16) (or .cse21 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse22 .cse11 .cse15 .cse16 .cse17 .cse23) (or .cse4 .cse24 .cse25 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse12 .cse13 .cse19 .cse23 .cse28 .cse18) (or .cse25 .cse3 .cse20 .cse19) (or .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18)))))) [2018-11-10 12:21:32,496 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1038 1051) the Hoare annotation is: (let ((.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse0 (= ~s~0 ~NP~0)) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (not (= 0 ~pended~0))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) .cse1 .cse0 .cse2 .cse4 .cse5) (or (or (< 6 ~MPR3~0) (or .cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse5) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse4 (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1)) (= |old(~s~0)| ~s~0)))) [2018-11-10 12:21:32,497 INFO L421 ceAbstractionStarter]: At program point L1046(line 1046) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= ~compRegistered~0 0))) (.cse2 (not (= 0 ~pended~0))) (.cse4 (< ~IPC~0 (+ ~DC~0 5))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2)))) (and (or .cse0 .cse1 .cse2) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) .cse0 .cse1 .cse3 .cse4) (or (< 6 ~MPR3~0) (or .cse2 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse4) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse3 (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1)))) [2018-11-10 12:21:32,497 INFO L425 ceAbstractionStarter]: For program point L1046-1(lines 1038 1051) no Hoare annotation was computed. [2018-11-10 12:21:32,497 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1038 1051) no Hoare annotation was computed. [2018-11-10 12:21:32,497 INFO L425 ceAbstractionStarter]: For program point L1042(lines 1042 1048) no Hoare annotation was computed. [2018-11-10 12:21:32,502 INFO L425 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 433 600) no Hoare annotation was computed. [2018-11-10 12:21:32,502 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2018-11-10 12:21:32,502 INFO L421 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 433 600) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (= |old(~s~0)| ~s~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and .cse2 (= |old(~myStatus~0)| ~myStatus~0) .cse3 .cse4)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 (and .cse2 (= 0 ~myStatus~0) .cse3 .cse4)))) [2018-11-10 12:21:32,502 INFO L421 ceAbstractionStarter]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0)) (.cse3 (= |old(~s~0)| ~s~0)) (.cse4 (<= 1 ~compRegistered~0))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and (= |old(~myStatus~0)| ~myStatus~0) .cse2 .cse3 .cse4)) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 (and (= 0 ~myStatus~0) .cse2 .cse3 .cse4)))) [2018-11-10 12:21:32,503 INFO L425 ceAbstractionStarter]: For program point L507-1(line 507) no Hoare annotation was computed. [2018-11-10 12:21:32,503 INFO L421 ceAbstractionStarter]: At program point L532(line 532) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-11-10 12:21:32,503 INFO L425 ceAbstractionStarter]: For program point L532-1(line 532) no Hoare annotation was computed. [2018-11-10 12:21:32,503 INFO L421 ceAbstractionStarter]: At program point L557(lines 557 559) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,503 INFO L425 ceAbstractionStarter]: For program point L557-1(lines 557 559) no Hoare annotation was computed. [2018-11-10 12:21:32,503 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 549 565) no Hoare annotation was computed. [2018-11-10 12:21:32,503 INFO L421 ceAbstractionStarter]: At program point L549-3(lines 549 565) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= 0 FloppyStartDevice_~InterfaceType~0) (and (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))))) (.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-10 12:21:32,506 INFO L421 ceAbstractionStarter]: At program point L566(lines 527 592) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-10 12:21:32,506 INFO L421 ceAbstractionStarter]: At program point L525(line 525) the Hoare annotation is: (let ((.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5)) (.cse4 (+ ~SKIP1~0 2)) (.cse3 (+ ~DC~0 2))) (let ((.cse2 (and (let ((.cse7 (<= ~PagingReferenceCount~0 1)) (.cse9 (<= 1 ~s~0)) (.cse10 (<= .cse3 ~SKIP2~0)) (.cse11 (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse4 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0))) (.cse12 (<= ~s~0 1)) (.cse13 (<= ~MPR3~0 6)) (.cse15 (< 0 ~PagingReferenceCount~0)) (.cse16 (<= 6 ~MPR3~0)) (.cse8 (= 0 ~customIrp~0)) (.cse14 (= |old(~customIrp~0)| ~customIrp~0))) (or (and .cse7 .cse8 .cse9 (<= FloppyStartDevice_~__cil_tmp42~0 259) .cse10 .cse11 .cse12 .cse13 (< 258 FloppyStartDevice_~__cil_tmp42~0) .cse14 .cse15 .cse16) (and (and .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) .cse15 .cse16) .cse8 .cse14))) (= |old(~myStatus~0)| ~myStatus~0))) (.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse3) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse4) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse2 .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1)))) [2018-11-10 12:21:32,507 INFO L421 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,514 INFO L425 ceAbstractionStarter]: For program point L525-1(line 525) no Hoare annotation was computed. [2018-11-10 12:21:32,514 INFO L425 ceAbstractionStarter]: For program point L583(lines 583 588) no Hoare annotation was computed. [2018-11-10 12:21:32,514 INFO L425 ceAbstractionStarter]: For program point L550(lines 549 565) no Hoare annotation was computed. [2018-11-10 12:21:32,514 INFO L425 ceAbstractionStarter]: For program point L583-2(lines 583 588) no Hoare annotation was computed. [2018-11-10 12:21:32,514 INFO L421 ceAbstractionStarter]: At program point L542(lines 529 569) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 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-10 12:21:32,514 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 537) no Hoare annotation was computed. [2018-11-10 12:21:32,514 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 543 546) no Hoare annotation was computed. [2018-11-10 12:21:32,514 INFO L425 ceAbstractionStarter]: For program point L527(lines 527 592) no Hoare annotation was computed. [2018-11-10 12:21:32,514 INFO L425 ceAbstractionStarter]: For program point L527-1(lines 527 592) no Hoare annotation was computed. [2018-11-10 12:21:32,514 INFO L425 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 433 600) no Hoare annotation was computed. [2018-11-10 12:21:32,515 INFO L421 ceAbstractionStarter]: At program point L585(lines 585 586) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (not (= 259 FloppyStartDevice_~ntStatus~1)) (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 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-10 12:21:32,515 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 585 586) no Hoare annotation was computed. [2018-11-10 12:21:32,521 INFO L425 ceAbstractionStarter]: For program point L511(lines 511 516) no Hoare annotation was computed. [2018-11-10 12:21:32,521 INFO L425 ceAbstractionStarter]: For program point L511-2(lines 511 516) no Hoare annotation was computed. [2018-11-10 12:21:32,521 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-11-10 12:21:32,521 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 501) no Hoare annotation was computed. [2018-11-10 12:21:32,521 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 490 502) no Hoare annotation was computed. [2018-11-10 12:21:32,521 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 569) no Hoare annotation was computed. [2018-11-10 12:21:32,522 INFO L421 ceAbstractionStarter]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse5 (= |old(~s~0)| ~s~0)) (.cse10 (<= ~MPR3~0 ~s~0)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (<= 1 ~setEventCalled~0)) (.cse6 (<= 1 ~compRegistered~0)) (.cse11 (<= ~s~0 ~MPR3~0)) (.cse7 (<= FloppyStartDevice_~__cil_tmp42~0 259)) (.cse8 (< 258 FloppyStartDevice_~__cil_tmp42~0)) (.cse9 (<= ~setEventCalled~0 1))) (and (let ((.cse2 (= 0 ~myStatus~0))) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse2 .cse3 .cse4 .cse6 .cse11 .cse7 .cse8 .cse9))) (let ((.cse12 (= |old(~myStatus~0)| ~myStatus~0))) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 (and .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse12 .cse10 .cse3 .cse4 .cse6 .cse11 .cse7 .cse8 .cse9))))) [2018-11-10 12:21:32,522 INFO L425 ceAbstractionStarter]: For program point L513-1(line 513) no Hoare annotation was computed. [2018-11-10 12:21:32,522 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 578) no Hoare annotation was computed. [2018-11-10 12:21:32,522 INFO L421 ceAbstractionStarter]: At program point L571-2(lines 571 578) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-10 12:21:32,522 INFO L421 ceAbstractionStarter]: At program point L596(line 596) the Hoare annotation is: (let ((.cse4 (+ ~DC~0 2)) (.cse3 (+ ~SKIP1~0 2)) (.cse5 (= 0 ~pended~0)) (.cse6 (+ ~DC~0 5))) (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 .cse4) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 .cse3) (not (= |old(~compRegistered~0)| 0)) (not .cse5) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 .cse6) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= ~PagingReferenceCount~0 1) (<= .cse3 ~MPR1~0) (<= 1 ~s~0) (<= .cse4 ~SKIP2~0) (and .cse5 (<= .cse6 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= ~s~0 1) (<= ~MPR3~0 6) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2)))) [2018-11-10 12:21:32,526 INFO L425 ceAbstractionStarter]: For program point L596-1(line 596) no Hoare annotation was computed. [2018-11-10 12:21:32,526 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 540) no Hoare annotation was computed. [2018-11-10 12:21:32,526 INFO L421 ceAbstractionStarter]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (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-10 12:21:32,526 INFO L425 ceAbstractionStarter]: For program point L580(lines 580 581) no Hoare annotation was computed. [2018-11-10 12:21:32,527 INFO L428 ceAbstractionStarter]: At program point L1134(lines 1133 1143) the Hoare annotation is: true [2018-11-10 12:21:32,527 INFO L425 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1124 1145) no Hoare annotation was computed. [2018-11-10 12:21:32,527 INFO L428 ceAbstractionStarter]: At program point L1132(lines 1131 1143) the Hoare annotation is: true [2018-11-10 12:21:32,527 INFO L425 ceAbstractionStarter]: For program point L1131(lines 1131 1143) no Hoare annotation was computed. [2018-11-10 12:21:32,527 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 1135 1142) no Hoare annotation was computed. [2018-11-10 12:21:32,527 INFO L428 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1124 1145) the Hoare annotation is: true [2018-11-10 12:21:32,527 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 1135 1142) no Hoare annotation was computed. [2018-11-10 12:21:32,527 INFO L425 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1124 1145) no Hoare annotation was computed. [2018-11-10 12:21:32,527 INFO L425 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1102 1123) no Hoare annotation was computed. [2018-11-10 12:21:32,527 INFO L428 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1102 1123) the Hoare annotation is: true [2018-11-10 12:21:32,527 INFO L425 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1102 1123) no Hoare annotation was computed. [2018-11-10 12:21:32,527 INFO L428 ceAbstractionStarter]: At program point L1112(lines 1111 1121) the Hoare annotation is: true [2018-11-10 12:21:32,527 INFO L428 ceAbstractionStarter]: At program point L1110(lines 1109 1121) the Hoare annotation is: true [2018-11-10 12:21:32,527 INFO L425 ceAbstractionStarter]: For program point L1109(lines 1109 1121) no Hoare annotation was computed. [2018-11-10 12:21:32,531 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 1113 1120) no Hoare annotation was computed. [2018-11-10 12:21:32,532 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 1113 1120) no Hoare annotation was computed. [2018-11-10 12:21:32,532 INFO L425 ceAbstractionStarter]: For program point L849(lines 849 861) no Hoare annotation was computed. [2018-11-10 12:21:32,532 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 839 863) no Hoare annotation was computed. [2018-11-10 12:21:32,532 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 839 863) no Hoare annotation was computed. [2018-11-10 12:21:32,532 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 853 860) no Hoare annotation was computed. [2018-11-10 12:21:32,532 INFO L421 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 839 863) the Hoare annotation is: (let ((.cse3 (= 0 ~pended~0)) (.cse5 (+ ~SKIP1~0 2)) (.cse6 (+ ~DC~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= ~s~0 ~NP~0)) (not .cse3)) (< ~MPR1~0 .cse5) (< ~compRegistered~0 1) (< ~SKIP2~0 .cse6) (< ~IPC~0 .cse4)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< ~s~0 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= ~PagingReferenceCount~0 1) (= 0 ~customIrp~0) (<= 1 ~s~0) (and .cse3 (<= .cse4 ~IPC~0) (<= .cse5 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 ~s~0) (<= (+ ~s~0 2) ~SKIP1~0)) (<= .cse6 ~SKIP2~0) (<= ~s~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2)))) [2018-11-10 12:21:32,532 INFO L428 ceAbstractionStarter]: At program point L852(lines 851 861) the Hoare annotation is: true [2018-11-10 12:21:32,532 INFO L428 ceAbstractionStarter]: At program point L850(lines 849 861) the Hoare annotation is: true [2018-11-10 12:21:32,532 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 853 860) no Hoare annotation was computed. [2018-11-10 12:21:32,532 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1052 1059) the Hoare annotation is: true [2018-11-10 12:21:32,532 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1052 1059) no Hoare annotation was computed. [2018-11-10 12:21:32,532 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1052 1059) no Hoare annotation was computed. [2018-11-10 12:21:32,532 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 653 665) no Hoare annotation was computed. [2018-11-10 12:21:32,533 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 653 665) the Hoare annotation is: (let ((.cse0 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 ~PagingReferenceCount~0) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~PagingReferenceCount~0 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~s~0)| ~s~0)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse2 .cse1))) [2018-11-10 12:21:32,533 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 653 665) no Hoare annotation was computed. [2018-11-10 12:21:32,533 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 1622 1629) the Hoare annotation is: true [2018-11-10 12:21:32,538 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 1622 1629) no Hoare annotation was computed. [2018-11-10 12:21:32,538 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1626) no Hoare annotation was computed. [2018-11-10 12:21:32,538 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 1622 1629) no Hoare annotation was computed. [2018-11-10 12:21:32,538 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 135) no Hoare annotation was computed. [2018-11-10 12:21:32,538 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-11-10 12:21:32,538 INFO L421 ceAbstractionStarter]: At program point L153(line 153) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< 6 ~MPR3~0)) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse8 (< ~NP~0 ~s~0)) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse10 (< ~s~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) .cse8 .cse9 .cse10 (not (= ~customIrp~0 0))) (or .cse0 .cse1 .cse2 (< 0 |old(~PagingReferenceCount~0)|) .cse3 .cse4 (< |old(~PagingReferenceCount~0)| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-11-10 12:21:32,538 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 122) no Hoare annotation was computed. [2018-11-10 12:21:32,539 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 149 155) no Hoare annotation was computed. [2018-11-10 12:21:32,539 INFO L421 ceAbstractionStarter]: At program point L120-2(lines 120 122) the Hoare annotation is: (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< 6 ~MPR3~0)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< ~MPR3~0 6)) (.cse5 (< 1 ~NP~0)) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= ~compRegistered~0 0))) (.cse0 (= 0 ~pended~0)) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~NP~0 ~s~0)) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~s~0 1))) (and (or (and .cse0 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse1 .cse2 .cse3 (< 0 |old(~PagingReferenceCount~0)|) .cse4 .cse5 (< |old(~PagingReferenceCount~0)| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse0 (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0))) .cse8 (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) .cse9 .cse10 .cse11 (not (= ~customIrp~0 0))))) [2018-11-10 12:21:32,539 INFO L425 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 96 158) no Hoare annotation was computed. [2018-11-10 12:21:32,539 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 145) no Hoare annotation was computed. [2018-11-10 12:21:32,539 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2018-11-10 12:21:32,539 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 133) no Hoare annotation was computed. [2018-11-10 12:21:32,539 INFO L421 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 96 158) the Hoare annotation is: (let ((.cse1 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse2 (< 6 ~MPR3~0)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< ~MPR3~0 6)) (.cse5 (< 1 ~NP~0)) (.cse0 (= 0 ~pended~0)) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~NP~0 ~s~0)) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~s~0 1))) (and (or (and .cse0 (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) .cse1 .cse2 .cse3 (< 0 |old(~PagingReferenceCount~0)|) .cse4 .cse5 (< |old(~PagingReferenceCount~0)| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse0 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse6 .cse7 .cse8 (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) .cse9 .cse10 .cse11 (not (= ~customIrp~0 0))))) [2018-11-10 12:21:32,542 INFO L425 ceAbstractionStarter]: For program point L131-2(lines 131 133) no Hoare annotation was computed. [2018-11-10 12:21:32,542 INFO L425 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 96 158) no Hoare annotation was computed. [2018-11-10 12:21:32,543 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 147) no Hoare annotation was computed. [2018-11-10 12:21:32,543 INFO L425 ceAbstractionStarter]: For program point L117-2(lines 109 157) no Hoare annotation was computed. [2018-11-10 12:21:32,543 INFO L421 ceAbstractionStarter]: At program point L140(line 140) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< 6 ~MPR3~0)) (.cse4 (= FlQueueIrpToThread_~status~0 0)) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (< ~MPR3~0 6)) (.cse8 (< 1 ~NP~0)) (.cse2 (= 0 ~pended~0)) (.cse9 (<= (+ FlQueueIrpToThread_~status~0 1073741823) 0)) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= ~compRegistered~0 0))) (.cse12 (not (= 0 |old(~pended~0)|))) (.cse13 (< ~NP~0 ~s~0)) (.cse14 (< ~IPC~0 (+ ~DC~0 5))) (.cse15 (< ~s~0 1))) (and (let ((.cse3 (<= ~PagingReferenceCount~0 1)) (.cse5 (< 0 ~PagingReferenceCount~0))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 (< 0 |old(~PagingReferenceCount~0)|) .cse7 .cse8 (and .cse2 .cse3 .cse9 .cse5) (< |old(~PagingReferenceCount~0)| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (let ((.cse16 (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)))) (or .cse0 .cse1 (and .cse2 .cse16 .cse4) .cse6 .cse7 .cse8 (and .cse2 .cse16 .cse9) .cse10 .cse11 .cse12 (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) .cse13 .cse14 .cse15 (not (= ~customIrp~0 0)))))) [2018-11-10 12:21:32,543 INFO L425 ceAbstractionStarter]: For program point L140-1(line 140) no Hoare annotation was computed. [2018-11-10 12:21:32,543 INFO L421 ceAbstractionStarter]: At program point L138(lines 138 139) the Hoare annotation is: (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< 6 ~MPR3~0)) (.cse5 (= 0 ~pended~0)) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse9 (< ~NP~0 ~s~0)) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~s~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0))) .cse6 .cse7 .cse8 (< 1 |old(~PagingReferenceCount~0)|) (<= |old(~PagingReferenceCount~0)| 0) .cse9 .cse10 .cse11 (not (= ~customIrp~0 0))) (or .cse0 .cse1 (and .cse5 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse2 (< 0 |old(~PagingReferenceCount~0)|) .cse3 .cse4 (< |old(~PagingReferenceCount~0)| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2018-11-10 12:21:32,543 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 138 139) no Hoare annotation was computed. [2018-11-10 12:21:32,543 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1010) no Hoare annotation was computed. [2018-11-10 12:21:32,543 INFO L421 ceAbstractionStarter]: At program point L989(lines 988 1011) the Hoare annotation is: (let ((.cse25 (+ ~DC~0 2)) (.cse22 (+ ~DC~0 5)) (.cse23 (= 0 ~pended~0)) (.cse24 (+ ~SKIP1~0 2))) (let ((.cse7 (< ~MPR1~0 .cse24)) (.cse10 (not .cse23)) (.cse12 (< ~IPC~0 .cse22)) (.cse11 (< ~SKIP2~0 .cse25)) (.cse26 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse21 (+ ~NP~0 2)) (.cse14 (<= .cse26 0)) (.cse16 (= ~MPR1~0 ~s~0)) (.cse17 (<= 0 .cse26)) (.cse15 (<= 1 ~setEventCalled~0)) (.cse18 (<= ~setEventCalled~0 1)) (.cse13 (< 6 ~MPR3~0)) (.cse19 (or .cse7 (or .cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse12) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse11 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse20 (< ~MPR3~0 6))) (let ((.cse0 (or .cse13 .cse19 .cse20)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and (<= .cse21 ~SKIP1~0) .cse14 (<= 1 ~NP~0) (<= .cse22 ~IPC~0) .cse23 (<= ~PagingReferenceCount~0 1) (<= .cse24 ~MPR1~0) (<= 1 ~compRegistered~0) .cse16 (<= .cse25 ~SKIP2~0) (<= ~NP~0 1) .cse17 (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) .cse15 (<= ~MaximumInterfaceType~0 0) .cse18 (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))) (.cse6 (= ~s~0 ~SKIP1~0)) (.cse4 (< ~SKIP1~0 .cse21)) (.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse1 (not (= ~myStatus~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse6 .cse7 (or .cse4 .cse5 (not (= 1 ~pended~0)) .cse8 .cse9 .cse11 .cse12)) (or .cse13 (and .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse1 .cse20 (not (= ~customIrp~0 0)))))))) [2018-11-10 12:21:32,547 INFO L421 ceAbstractionStarter]: At program point L981(line 981) the Hoare annotation is: (let ((.cse18 (+ ~DC~0 5)) (.cse17 (= 0 ~pended~0))) (let ((.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (not .cse17)) (.cse12 (< ~IPC~0 .cse18)) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse15 (+ ~NP~0 2)) (.cse0 (< 6 ~MPR3~0)) (.cse1 (or .cse7 (or .cse10 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse12) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse11 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse4 (< ~MPR3~0 6))) (let ((.cse13 (or .cse0 .cse1 .cse4)) (.cse2 (not (= ~myStatus~0 0))) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse3 (let ((.cse16 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= .cse16 0) (and (<= .cse15 ~SKIP1~0) .cse17 (= ~s~0 ~NP~0) (<= .cse18 ~IPC~0) (= |old(~s~0)| ~s~0) (<= 1 ~compRegistered~0)) (<= 0 .cse16) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse5 (< ~SKIP1~0 .cse15)) (.cse6 (< ~MPR3~0 (+ ~NP~0 5))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~customIrp~0 0))) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (< 0 (+ ~myStatus~0 1073741637)) .cse13 .cse14 .cse3) (or .cse13 .cse2 .cse14 .cse3) (or .cse7 (or .cse5 .cse6 (not (= 1 ~pended~0)) .cse8 .cse9 .cse11 .cse12))))))) [2018-11-10 12:21:32,547 INFO L425 ceAbstractionStarter]: For program point L973(lines 973 985) no Hoare annotation was computed. [2018-11-10 12:21:32,547 INFO L425 ceAbstractionStarter]: For program point L973-1(lines 973 985) no Hoare annotation was computed. [2018-11-10 12:21:32,547 INFO L421 ceAbstractionStarter]: At program point L994(lines 993 1010) the Hoare annotation is: (let ((.cse0 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse7 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse13 (< 6 ~MPR3~0)) (.cse14 (or .cse0 (or .cse11 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse7) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse6 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse15 (< ~MPR3~0 6))) (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= ~s~0 ~SKIP1~0)) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse9 (or .cse13 .cse14 .cse15)) (.cse10 (< 0 ~MaximumInterfaceType~0)) (.cse8 (let ((.cse16 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= .cse16 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= 0 .cse16) (<= ~setEventCalled~0 1)))) (.cse12 (not (= ~myStatus~0 0)))) (and (or .cse0 .cse1 (or .cse2 .cse3 (not (= 1 ~pended~0)) .cse4 .cse5 .cse6 .cse7)) (or .cse8 (< 0 (+ ~myStatus~0 1073741637)) .cse9 .cse10) (or .cse2 .cse3 .cse1 .cse0 .cse4 .cse5 .cse11 .cse6 .cse7) (or .cse9 .cse12 .cse10 .cse8) (or .cse13 .cse8 .cse14 .cse12 .cse15 (not (= ~customIrp~0 0))))))) [2018-11-10 12:21:32,550 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 965 1037) the Hoare annotation is: (let ((.cse0 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= 0 ~pended~0))) (.cse7 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse8 (< 6 ~MPR3~0)) (.cse9 (or .cse0 (or .cse15 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse7) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse6 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse12 (< ~MPR3~0 6))) (let ((.cse10 (not (= ~myStatus~0 0))) (.cse13 (or .cse8 .cse9 .cse12)) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse11 (= ~s~0 |old(~s~0)|)) (.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= ~s~0 ~SKIP1~0)) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 .cse1 (or .cse2 .cse3 (not (= 1 ~pended~0)) .cse4 .cse5 .cse6 .cse7)) (or .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0))) (or .cse13 .cse10 .cse14 .cse11) (or (< 0 (+ ~myStatus~0 1073741637)) .cse13 .cse14 .cse11) (or .cse2 .cse3 .cse1 .cse0 .cse4 .cse5 .cse15 .cse6 .cse7))))) [2018-11-10 12:21:32,550 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 965 1037) no Hoare annotation was computed. [2018-11-10 12:21:32,550 INFO L425 ceAbstractionStarter]: For program point L1016(lines 1016 1033) no Hoare annotation was computed. [2018-11-10 12:21:32,550 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 965 1037) no Hoare annotation was computed. [2018-11-10 12:21:32,550 INFO L425 ceAbstractionStarter]: For program point L979(lines 979 983) no Hoare annotation was computed. [2018-11-10 12:21:32,551 INFO L421 ceAbstractionStarter]: At program point L1008(lines 972 1036) the Hoare annotation is: (let ((.cse39 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse36 (+ ~DC~0 2)) (.cse38 (+ ~DC~0 5)) (.cse28 (= 0 ~pended~0)) (.cse37 (+ ~SKIP1~0 2))) (let ((.cse0 (< ~MPR1~0 .cse37)) (.cse23 (not .cse28)) (.cse7 (< ~IPC~0 .cse38)) (.cse6 (< ~SKIP2~0 .cse36)) (.cse12 (<= .cse39 0)) (.cse15 (= ~MPR1~0 ~s~0)) (.cse16 (<= 0 .cse39)) (.cse24 (+ ~NP~0 5)) (.cse25 (+ ~NP~0 2))) (let ((.cse18 (let ((.cse26 (<= .cse25 ~SKIP1~0)) (.cse27 (<= .cse38 ~IPC~0)) (.cse29 (<= ~PagingReferenceCount~0 1)) (.cse30 (<= .cse37 ~MPR1~0)) (.cse31 (<= 1 ~compRegistered~0)) (.cse32 (<= .cse24 ~MPR3~0)) (.cse33 (<= .cse36 ~SKIP2~0)) (.cse34 (= ~NP~0 |old(~s~0)|)) (.cse35 (< 0 ~PagingReferenceCount~0))) (or (and .cse26 .cse12 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse15 .cse33 (= 0 IofCallDriver_~returnVal2~0) .cse16 .cse34 .cse35) (and .cse26 .cse12 .cse27 .cse28 .cse29 .cse30 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse31 .cse32 .cse15 .cse33 .cse16 .cse34 .cse35)))) (.cse14 (<= 1 ~setEventCalled~0)) (.cse13 (= IofCallDriver_~returnVal2~0 259)) (.cse17 (<= ~setEventCalled~0 1)) (.cse19 (< 6 ~MPR3~0)) (.cse20 (or .cse0 (or .cse23 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse7) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse6 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse22 (< ~MPR3~0 6))) (let ((.cse2 (< ~SKIP1~0 .cse25)) (.cse3 (< ~MPR3~0 .cse24)) (.cse1 (= ~s~0 ~SKIP1~0)) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse8 (or .cse19 .cse20 .cse22)) (.cse21 (not (= ~myStatus~0 0))) (.cse9 (< 0 ~MaximumInterfaceType~0)) (.cse11 (and .cse12 .cse14 .cse13 .cse15 .cse16 .cse17)) (.cse10 (and (and (<= 1 ~NP~0) .cse18 (<= ~MPR3~0 6) .cse14 .cse17) (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 .cse1 (or .cse2 .cse3 (not (= 1 ~pended~0)) .cse4 .cse5 .cse6 .cse7)) (or (< 0 (+ ~myStatus~0 1073741637)) .cse8 .cse9 .cse10 .cse11) (or (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse14 .cse17) .cse19 .cse20 .cse21 .cse22 (not (= ~customIrp~0 0))) (or .cse2 .cse3 .cse1 .cse0 .cse4 .cse5 .cse23 .cse6 .cse7) (or .cse8 .cse21 .cse9 .cse11 .cse10)))))) [2018-11-10 12:21:32,554 INFO L421 ceAbstractionStarter]: At program point L975(line 975) the Hoare annotation is: (let ((.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse7 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse8 (< 6 ~MPR3~0)) (.cse9 (or .cse2 (or .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse7) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse6 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse12 (< ~MPR3~0 6))) (let ((.cse10 (not (= ~myStatus~0 0))) (.cse13 (or .cse8 .cse9 .cse12)) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse11 (= ~s~0 |old(~s~0)|)) (.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0))) (or .cse13 .cse10 .cse14 .cse11) (or (< 0 (+ ~myStatus~0 1073741637)) .cse13 .cse14 .cse11) (or .cse2 (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse3 .cse4 .cse6 .cse7)))))) [2018-11-10 12:21:32,555 INFO L425 ceAbstractionStarter]: For program point L975-1(line 975) no Hoare annotation was computed. [2018-11-10 12:21:32,555 INFO L421 ceAbstractionStarter]: At program point L996(lines 995 1010) the Hoare annotation is: (let ((.cse0 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= 0 ~pended~0))) (.cse7 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse13 (< 6 ~MPR3~0)) (.cse14 (or .cse0 (or .cse11 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse7) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse6 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse15 (< ~MPR3~0 6))) (let ((.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= ~s~0 ~SKIP1~0)) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse9 (or .cse13 .cse14 .cse15)) (.cse10 (< 0 ~MaximumInterfaceType~0)) (.cse8 (let ((.cse16 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (and (<= .cse16 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= 0 .cse16) (<= ~setEventCalled~0 1)))) (.cse12 (not (= ~myStatus~0 0)))) (and (or .cse0 .cse1 (or .cse2 .cse3 (not (= 1 ~pended~0)) .cse4 .cse5 .cse6 .cse7)) (or .cse8 (< 0 (+ ~myStatus~0 1073741637)) .cse9 .cse10) (or .cse2 .cse3 .cse1 .cse0 .cse4 .cse5 .cse11 .cse6 .cse7) (or .cse9 .cse12 .cse10 .cse8) (or .cse13 .cse8 .cse14 .cse12 .cse15 (not (= ~customIrp~0 0))))))) [2018-11-10 12:21:32,559 INFO L425 ceAbstractionStarter]: For program point $Ultimate##12(lines 997 1009) no Hoare annotation was computed. [2018-11-10 12:21:32,559 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 997 1009) no Hoare annotation was computed. [2018-11-10 12:21:32,560 INFO L425 ceAbstractionStarter]: For program point L1025(lines 1025 1032) no Hoare annotation was computed. [2018-11-10 12:21:32,560 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1011) no Hoare annotation was computed. [2018-11-10 12:21:32,560 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1023) no Hoare annotation was computed. [2018-11-10 12:21:32,560 INFO L421 ceAbstractionStarter]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse8 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or .cse4 (or .cse7 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse9) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse8 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse0 (or .cse10 .cse11 .cse13)) (.cse12 (not (= ~myStatus~0 0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 (not (= ~customIrp~0 0))) (or .cse0 .cse12 .cse1) (or .cse4 (or .cse2 .cse3 (not (= 1 ~pended~0)) .cse5 .cse6 .cse8 .cse9)))))) [2018-11-10 12:21:32,560 INFO L425 ceAbstractionStarter]: For program point L1030-1(lines 1012 1034) no Hoare annotation was computed. [2018-11-10 12:21:32,560 INFO L421 ceAbstractionStarter]: At program point L1307(line 1307) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,560 INFO L425 ceAbstractionStarter]: For program point L1274(lines 1274 1286) no Hoare annotation was computed. [2018-11-10 12:21:32,560 INFO L425 ceAbstractionStarter]: For program point L1307-1(line 1307) no Hoare annotation was computed. [2018-11-10 12:21:32,560 INFO L425 ceAbstractionStarter]: For program point L1274-2(lines 1273 1562) no Hoare annotation was computed. [2018-11-10 12:21:32,560 INFO L425 ceAbstractionStarter]: For program point $Ultimate##38(lines 1400 1526) no Hoare annotation was computed. [2018-11-10 12:21:32,561 INFO L425 ceAbstractionStarter]: For program point $Ultimate##37(lines 1400 1526) no Hoare annotation was computed. [2018-11-10 12:21:32,561 INFO L421 ceAbstractionStarter]: At program point L1514(line 1514) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,561 INFO L425 ceAbstractionStarter]: For program point L1514-1(lines 1510 1516) no Hoare annotation was computed. [2018-11-10 12:21:32,562 INFO L425 ceAbstractionStarter]: For program point L1382(lines 1382 1531) no Hoare annotation was computed. [2018-11-10 12:21:32,562 INFO L421 ceAbstractionStarter]: At program point L1316(lines 1315 1549) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,562 INFO L421 ceAbstractionStarter]: At program point L1399(lines 1389 1529) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,562 INFO L425 ceAbstractionStarter]: For program point L1424(lines 1424 1427) no Hoare annotation was computed. [2018-11-10 12:21:32,562 INFO L421 ceAbstractionStarter]: At program point L1292(line 1292) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,562 INFO L425 ceAbstractionStarter]: For program point L1292-1(line 1292) no Hoare annotation was computed. [2018-11-10 12:21:32,562 INFO L421 ceAbstractionStarter]: At program point L1449(line 1449) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0) (<= ~s~0 1)) (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,562 INFO L425 ceAbstractionStarter]: For program point L1449-1(line 1449) no Hoare annotation was computed. [2018-11-10 12:21:32,562 INFO L421 ceAbstractionStarter]: At program point L1383(lines 1375 1533) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,562 INFO L425 ceAbstractionStarter]: For program point L1375(lines 1375 1533) no Hoare annotation was computed. [2018-11-10 12:21:32,566 INFO L425 ceAbstractionStarter]: For program point L1433(lines 1433 1437) no Hoare annotation was computed. [2018-11-10 12:21:32,566 INFO L421 ceAbstractionStarter]: At program point L1301(line 1301) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,566 INFO L421 ceAbstractionStarter]: At program point L1557(line 1557) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse2 (+ ~DC~0 2))) (let ((.cse0 (and (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~pended~0) .cse1 (<= .cse2 ~SKIP2~0)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (and (not (= 259 FloppyDeviceControl_~ntStatus~3)) (= FloppyDeviceControl_~__cil_tmp91~0 FloppyDeviceControl_~ntStatus~3) .cse0) (and .cse1 (= ~pended~0 1)) (< ~SKIP2~0 .cse2) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (<= (+ FloppyDeviceControl_~ntStatus~3 1073741811) 0) .cse0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)))) [2018-11-10 12:21:32,567 INFO L425 ceAbstractionStarter]: For program point L1301-1(lines 1297 1303) no Hoare annotation was computed. [2018-11-10 12:21:32,567 INFO L425 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 1182 1563) no Hoare annotation was computed. [2018-11-10 12:21:32,567 INFO L421 ceAbstractionStarter]: At program point L1483(lines 1347 1541) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0) (<= ~s~0 1)) (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,567 INFO L425 ceAbstractionStarter]: For program point L1475(lines 1475 1478) no Hoare annotation was computed. [2018-11-10 12:21:32,567 INFO L425 ceAbstractionStarter]: For program point L1467(lines 1467 1480) no Hoare annotation was computed. [2018-11-10 12:21:32,567 INFO L425 ceAbstractionStarter]: For program point L1368(lines 1368 1535) no Hoare annotation was computed. [2018-11-10 12:21:32,567 INFO L421 ceAbstractionStarter]: At program point L1525(lines 1400 1526) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (and (not (= 259 FloppyDeviceControl_~ntStatus~3)) (= 0 ~pended~0) .cse0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (< 6 ~MPR3~0) (< ~NP~0 1) (and .cse0 (= ~pended~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5)))) [2018-11-10 12:21:32,567 INFO L425 ceAbstractionStarter]: For program point L1451(lines 1451 1454) no Hoare annotation was computed. [2018-11-10 12:21:32,567 INFO L425 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 1182 1563) no Hoare annotation was computed. [2018-11-10 12:21:32,567 INFO L425 ceAbstractionStarter]: For program point L1410(lines 1410 1414) no Hoare annotation was computed. [2018-11-10 12:21:32,567 INFO L421 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 1182 1563) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0) (<= ~s~0 1)) (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,570 INFO L425 ceAbstractionStarter]: For program point L1361(lines 1361 1537) no Hoare annotation was computed. [2018-11-10 12:21:32,570 INFO L425 ceAbstractionStarter]: For program point L1320(lines 1320 1547) no Hoare annotation was computed. [2018-11-10 12:21:32,570 INFO L425 ceAbstractionStarter]: For program point L1279(lines 1279 1284) no Hoare annotation was computed. [2018-11-10 12:21:32,570 INFO L425 ceAbstractionStarter]: For program point L1502(lines 1502 1504) no Hoare annotation was computed. [2018-11-10 12:21:32,570 INFO L425 ceAbstractionStarter]: For program point L1494(lines 1494 1497) no Hoare annotation was computed. [2018-11-10 12:21:32,570 INFO L425 ceAbstractionStarter]: For program point L1461(lines 1461 1481) no Hoare annotation was computed. [2018-11-10 12:21:32,570 INFO L425 ceAbstractionStarter]: For program point L1329(lines 1329 1545) no Hoare annotation was computed. [2018-11-10 12:21:32,570 INFO L425 ceAbstractionStarter]: For program point L1296(lines 1296 1310) no Hoare annotation was computed. [2018-11-10 12:21:32,570 INFO L421 ceAbstractionStarter]: At program point L1321(lines 1320 1547) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,570 INFO L425 ceAbstractionStarter]: For program point L1338(lines 1338 1543) no Hoare annotation was computed. [2018-11-10 12:21:32,570 INFO L425 ceAbstractionStarter]: For program point L1462(lines 1462 1465) no Hoare annotation was computed. [2018-11-10 12:21:32,570 INFO L425 ceAbstractionStarter]: For program point L1396(lines 1396 1527) no Hoare annotation was computed. [2018-11-10 12:21:32,571 INFO L425 ceAbstractionStarter]: For program point L1297(lines 1297 1303) no Hoare annotation was computed. [2018-11-10 12:21:32,571 INFO L425 ceAbstractionStarter]: For program point L1553(lines 1553 1559) no Hoare annotation was computed. [2018-11-10 12:21:32,571 INFO L421 ceAbstractionStarter]: At program point L1520(lines 1520 1521) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,571 INFO L425 ceAbstractionStarter]: For program point L1553-1(lines 1553 1559) no Hoare annotation was computed. [2018-11-10 12:21:32,571 INFO L425 ceAbstractionStarter]: For program point L1520-1(lines 1520 1521) no Hoare annotation was computed. [2018-11-10 12:21:32,571 INFO L425 ceAbstractionStarter]: For program point L1347(lines 1347 1541) no Hoare annotation was computed. [2018-11-10 12:21:32,571 INFO L421 ceAbstractionStarter]: At program point L1281(line 1281) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)))) [2018-11-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point L1281-1(line 1281) no Hoare annotation was computed. [2018-11-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point L1471(lines 1471 1479) no Hoare annotation was computed. [2018-11-10 12:21:32,575 INFO L421 ceAbstractionStarter]: At program point L1339(lines 1329 1545) the Hoare annotation is: (or (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0) (<= ~s~0 1)) (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< 0 |old(~PagingReferenceCount~0)|) (< ~MPR3~0 6) (< 1 ~NP~0) (< |old(~PagingReferenceCount~0)| 0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-11-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2018-11-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point L1389(lines 1389 1529) no Hoare annotation was computed. [2018-11-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point L1356(lines 1356 1539) no Hoare annotation was computed. [2018-11-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point L1315(lines 1315 1549) no Hoare annotation was computed. [2018-11-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 1564 1580) no Hoare annotation was computed. [2018-11-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 1564 1580) no Hoare annotation was computed. [2018-11-10 12:21:32,575 INFO L428 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 1564 1580) the Hoare annotation is: true [2018-11-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point L1573(lines 1573 1577) no Hoare annotation was computed. [2018-11-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point L1570(lines 1570 1578) no Hoare annotation was computed. [2018-11-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:21:32,575 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-10 12:21:32,575 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:21:32,576 INFO L421 ceAbstractionStarter]: At program point L1598(line 1598) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (and (<= |old(~PagingReferenceCount~0)| 1) (< 0 |old(~PagingReferenceCount~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-10 12:21:32,576 INFO L425 ceAbstractionStarter]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2018-11-10 12:21:32,576 INFO L425 ceAbstractionStarter]: For program point L1590(lines 1590 1592) no Hoare annotation was computed. [2018-11-10 12:21:32,576 INFO L425 ceAbstractionStarter]: For program point L1590-2(lines 1588 1619) no Hoare annotation was computed. [2018-11-10 12:21:32,576 INFO L421 ceAbstractionStarter]: At program point L1613(line 1613) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (<= |old(~PagingReferenceCount~0)| 1) (< 0 |old(~PagingReferenceCount~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-10 12:21:32,581 INFO L425 ceAbstractionStarter]: For program point L1613-1(lines 1609 1615) no Hoare annotation was computed. [2018-11-10 12:21:32,581 INFO L425 ceAbstractionStarter]: For program point L1609(lines 1609 1615) no Hoare annotation was computed. [2018-11-10 12:21:32,581 INFO L425 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 1581 1620) no Hoare annotation was computed. [2018-11-10 12:21:32,581 INFO L421 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 1581 1620) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (<= |old(~PagingReferenceCount~0)| 1) (< 0 |old(~PagingReferenceCount~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0) (or (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0)))) [2018-11-10 12:21:32,581 INFO L425 ceAbstractionStarter]: For program point L1601(lines 1601 1603) no Hoare annotation was computed. [2018-11-10 12:21:32,581 INFO L425 ceAbstractionStarter]: For program point L1601-2(lines 1601 1603) no Hoare annotation was computed. [2018-11-10 12:21:32,581 INFO L425 ceAbstractionStarter]: For program point L1593-1(lines 1593 1617) no Hoare annotation was computed. [2018-11-10 12:21:32,581 INFO L425 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 1581 1620) no Hoare annotation was computed. [2018-11-10 12:21:32,581 INFO L421 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse6 (< 0 ~MaximumInterfaceType~0)) (.cse1 (<= ~MPR3~0 ~s~0)) (.cse2 (<= ~s~0 ~MPR3~0)) (.cse3 (<= 1 ~setEventCalled~0)) (.cse5 (<= ~setEventCalled~0 1)) (.cse4 (= 259 FlFdcDeviceIo_~__cil_tmp11~0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) (not (= ~myStatus~0 0)) .cse6) (or .cse0 (and (<= 1 ~s~0) (<= ~s~0 ~NP~0) .cse3 .cse4 .cse5) (< 0 (+ ~myStatus~0 1073741637)) .cse6 (and (and .cse1 .cse2 .cse3 .cse5) .cse4)))) [2018-11-10 12:21:32,581 INFO L425 ceAbstractionStarter]: For program point L638-1(line 638) no Hoare annotation was computed. [2018-11-10 12:21:32,581 INFO L425 ceAbstractionStarter]: For program point L636(lines 636 641) no Hoare annotation was computed. [2018-11-10 12:21:32,582 INFO L421 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 611 645) the Hoare annotation is: (let ((.cse3 (= 0 ~pended~0)) (.cse5 (+ ~SKIP1~0 2)) (.cse6 (+ ~DC~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not .cse3)) (< ~MPR1~0 .cse5) (< ~compRegistered~0 1) (< ~SKIP2~0 .cse6) (< ~IPC~0 .cse4)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= ~PagingReferenceCount~0 1) (= 0 ~customIrp~0) (<= 1 ~s~0) (and .cse3 (<= .cse4 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= .cse6 ~SKIP2~0) (<= ~s~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2)))) [2018-11-10 12:21:32,583 INFO L425 ceAbstractionStarter]: For program point L636-2(lines 636 641) no Hoare annotation was computed. [2018-11-10 12:21:32,583 INFO L421 ceAbstractionStarter]: At program point L632(line 632) the Hoare annotation is: (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (< ~MPR1~0 (+ ~SKIP1~0 2)) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (= ~s~0 |old(~s~0)|)) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 .cse1 (< 0 (+ ~myStatus~0 1073741637)) .cse2) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2))) [2018-11-10 12:21:32,583 INFO L425 ceAbstractionStarter]: For program point L632-1(line 632) no Hoare annotation was computed. [2018-11-10 12:21:32,583 INFO L425 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 611 645) no Hoare annotation was computed. [2018-11-10 12:21:32,584 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 628) no Hoare annotation was computed. [2018-11-10 12:21:32,584 INFO L421 ceAbstractionStarter]: At program point L623(lines 623 624) the Hoare annotation is: (let ((.cse3 (= 0 ~pended~0)) (.cse5 (+ ~SKIP1~0 2)) (.cse6 (+ ~DC~0 2)) (.cse4 (+ ~DC~0 5))) (let ((.cse0 (or (< 6 ~MPR3~0) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= |old(~s~0)| ~NP~0)) (not .cse3)) (< ~MPR1~0 .cse5) (< ~compRegistered~0 1) (< ~SKIP2~0 .cse6) (< ~IPC~0 .cse4)) (< 1 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (and (<= ~PagingReferenceCount~0 1) (= 0 ~customIrp~0) (<= 1 ~s~0) (and .cse3 (<= .cse4 ~IPC~0) (= |old(~s~0)| ~s~0) (<= .cse5 ~MPR1~0) (<= 1 ~compRegistered~0) (= ~NP~0 |old(~s~0)|) (<= (+ ~s~0 2) ~SKIP1~0)) (<= .cse6 ~SKIP2~0) (<= ~s~0 1) (<= ~MPR3~0 6) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0) (<= 6 ~MPR3~0))) (.cse2 (< 0 ~MaximumInterfaceType~0))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2)))) [2018-11-10 12:21:32,584 INFO L425 ceAbstractionStarter]: For program point L623-1(lines 623 624) no Hoare annotation was computed. [2018-11-10 12:21:32,584 INFO L425 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 611 645) no Hoare annotation was computed. [2018-11-10 12:21:32,584 INFO L425 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 89 95) no Hoare annotation was computed. [2018-11-10 12:21:32,584 INFO L428 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 89 95) the Hoare annotation is: true [2018-11-10 12:21:32,584 INFO L425 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 89 95) no Hoare annotation was computed. [2018-11-10 12:21:32,584 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:21:32,590 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-10 12:21:32,591 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:21:32,591 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:21:32,591 INFO L428 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 864 884) the Hoare annotation is: true [2018-11-10 12:21:32,591 INFO L425 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 864 884) no Hoare annotation was computed. [2018-11-10 12:21:32,591 INFO L428 ceAbstractionStarter]: At program point L873(lines 872 882) the Hoare annotation is: true [2018-11-10 12:21:32,591 INFO L425 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 864 884) no Hoare annotation was computed. [2018-11-10 12:21:32,591 INFO L428 ceAbstractionStarter]: At program point L871(lines 870 882) the Hoare annotation is: true [2018-11-10 12:21:32,591 INFO L425 ceAbstractionStarter]: For program point L870(lines 870 882) no Hoare annotation was computed. [2018-11-10 12:21:32,591 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 874 881) no Hoare annotation was computed. [2018-11-10 12:21:32,591 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 874 881) no Hoare annotation was computed. [2018-11-10 12:21:32,591 INFO L428 ceAbstractionStarter]: At program point L896(lines 895 905) the Hoare annotation is: true [2018-11-10 12:21:32,591 INFO L428 ceAbstractionStarter]: At program point L894(lines 893 905) the Hoare annotation is: true [2018-11-10 12:21:32,591 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 905) no Hoare annotation was computed. [2018-11-10 12:21:32,591 INFO L425 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 885 907) no Hoare annotation was computed. [2018-11-10 12:21:32,591 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 897 904) no Hoare annotation was computed. [2018-11-10 12:21:32,591 INFO L428 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 885 907) the Hoare annotation is: true [2018-11-10 12:21:32,592 INFO L425 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 885 907) no Hoare annotation was computed. [2018-11-10 12:21:32,592 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 897 904) no Hoare annotation was computed. [2018-11-10 12:21:32,592 INFO L428 ceAbstractionStarter]: At program point L1153(lines 1152 1164) the Hoare annotation is: true [2018-11-10 12:21:32,592 INFO L425 ceAbstractionStarter]: For program point L1152(lines 1152 1164) no Hoare annotation was computed. [2018-11-10 12:21:32,592 INFO L428 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1146 1166) the Hoare annotation is: true [2018-11-10 12:21:32,592 INFO L425 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1146 1166) no Hoare annotation was computed. [2018-11-10 12:21:32,592 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 1156 1163) no Hoare annotation was computed. [2018-11-10 12:21:32,592 INFO L428 ceAbstractionStarter]: At program point L1155(lines 1154 1164) the Hoare annotation is: true [2018-11-10 12:21:32,592 INFO L425 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1146 1166) no Hoare annotation was computed. [2018-11-10 12:21:32,597 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 1156 1163) no Hoare annotation was computed. [2018-11-10 12:21:32,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:21:32 BoogieIcfgContainer [2018-11-10 12:21:32,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:21:32,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:21:32,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:21:32,657 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:21:32,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:20:52" (3/4) ... [2018-11-10 12:21:32,661 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:21:32,672 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-10 12:21:32,672 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-10 12:21:32,672 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2018-11-10 12:21:32,672 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-10 12:21:32,672 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-10 12:21:32,672 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-10 12:21:32,673 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-11-10 12:21:32,674 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-11-10 12:21:32,674 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:21:32,674 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-11-10 12:21:32,674 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-10 12:21:32,674 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-10 12:21:32,674 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-10 12:21:32,674 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-10 12:21:32,674 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-10 12:21:32,689 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 82 nodes and edges [2018-11-10 12:21:32,691 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2018-11-10 12:21:32,692 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 12:21:32,693 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 12:21:32,718 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || ((DC == s && 0 == pended) && 0 == status)) || (status == lowerDriverReturn && ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || 0 < \old(PagingReferenceCount)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-10 12:21:32,718 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || ((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((((NP + 5 <= MPR3 && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || (status == lowerDriverReturn && ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-10 12:21:32,719 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || (((((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1) && IPC == s) && compRegistered <= 0)) || (SKIP2 == s && NP + 2 <= SKIP1 && ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0) || ((((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1) && compRegistered <= 0)))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || (status == lowerDriverReturn && (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-10 12:21:32,719 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || (((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1)) || (((1 <= NP && SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1 && (((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2))) && MPR3 <= 6) && !(259 == status))) || ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) && 0 == status)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1 && (((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2))) && status + 1073741536 <= 0)) || (status == lowerDriverReturn && (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-10 12:21:32,719 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((DC == s && 0 == compRegistered) && pended == 1) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) && 0 < PagingReferenceCount)) || 0 < MaximumInterfaceType) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((1 <= NP && ((((NP + 2 <= SKIP1 && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && MPR3 <= 6) && !(259 == ntStatus))) || (((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && (1 < PagingReferenceCount || PagingReferenceCount <= 0)) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((NP + 2 <= SKIP1 && ntStatus + 1073741823 <= 0) && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && (1 < PagingReferenceCount || PagingReferenceCount <= 0))) && ((((((((((((DC == s && 0 == compRegistered) && pended == 1) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || 0 < MaximumInterfaceType) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((1 <= NP && ((((NP + 2 <= SKIP1 && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && MPR3 <= 6) && !(259 == ntStatus))) || (((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && (1 < PagingReferenceCount || PagingReferenceCount <= 0)) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((NP + 2 <= SKIP1 && ntStatus + 1073741823 <= 0) && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && (1 < PagingReferenceCount || PagingReferenceCount <= 0))) [2018-11-10 12:21:32,720 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) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-10 12:21:32,720 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 < myStatus + 1073741637 || ((\old(customIrp) == 1 && ((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) [2018-11-10 12:21:32,720 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0 < myStatus + 1073741637 || ((\old(customIrp) == 1 && ((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) [2018-11-10 12:21:32,721 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((((((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3)) && (((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType) || ((((((((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((s == SKIP1 || MPR1 < SKIP1 + 2) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((6 < MPR3 || ((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0)) [2018-11-10 12:21:32,721 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((SKIP1 < NP + 2 || ((!(259 == ntStatus) && 0 == pended) && s == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 6 < MPR3) || NP < 1) || (s == NP && pended == 1)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || !(\old(s) == NP)) || !(0 == \old(pended))) || IPC < DC + 5 [2018-11-10 12:21:32,721 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) && ((((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType) || (((((1 <= NP && ((((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || (((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && (((((((((((__cil_tmp7 + 1073741802 <= 0 && returnVal2 == 259) && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || ((((((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount)) && 1 <= setEventCalled) && setEventCalled <= 1)) || 6 < MPR3) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || (((((1 <= NP && ((((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) [2018-11-10 12:21:32,721 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) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-10 12:21:32,722 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled)) && ((((((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) [2018-11-10 12:21:32,722 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 0 < myStatus + 1073741637) || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType)) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0)) [2018-11-10 12:21:32,722 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 0 < myStatus + 1073741637) || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType)) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0)) [2018-11-10 12:21:32,722 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)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && 0 == status) && PagingReferenceCount <= 0) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 0 <= PagingReferenceCount) && MPR3 <= 6) && 6 <= MPR3)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-10 12:21:32,728 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) [2018-11-10 12:21:32,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (0 <= InterfaceType && ((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (0 <= InterfaceType && ((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-10 12:21:32,729 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 == myStatus) && 0 <= PagingReferenceCount) && s <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0) || !(\old(myStatus) == 0)) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 <= PagingReferenceCount) && s <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 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))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-10 12:21:32,737 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))) || 0 <= status) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-11-10 12:21:32,737 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) [2018-11-10 12:21:32,738 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\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)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-10 12:21:32,746 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) [2018-11-10 12:21:32,746 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 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) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-10 12:21:32,746 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((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) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((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)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-10 12:21:32,764 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= s) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 0 < PagingReferenceCount)) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= s) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-10 12:21:32,765 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((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) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((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)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) [2018-11-10 12:21:32,766 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-10 12:21:32,791 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-10 12:21:32,791 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == pended && 1 <= s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount) && s <= 1) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-10 12:21:32,791 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == pended && 1 <= s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount) && s <= 1) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-10 12:21:32,792 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-10 12:21:32,792 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || (((0 == pended && \old(s) == s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-11-10 12:21:32,904 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fd8da68f-eb59-400b-801b-229a485ced26/bin-2019/uautomizer/witness.graphml [2018-11-10 12:21:32,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:21:32,905 INFO L168 Benchmark]: Toolchain (without parser) took 42166.20 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 988.3 MB). Free memory was 957.6 MB in the beginning and 843.0 MB in the end (delta: 114.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 12:21:32,905 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:21:32,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.73 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 922.7 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:21:32,905 INFO L168 Benchmark]: Boogie Preprocessor took 96.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 922.7 MB in the beginning and 1.1 GB in the end (delta: -211.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:21:32,906 INFO L168 Benchmark]: RCFGBuilder took 844.12 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: 122.8 MB). Peak memory consumption was 122.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:21:32,906 INFO L168 Benchmark]: TraceAbstraction took 40625.47 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 847.2 MB). Free memory was 1.0 GB in the beginning and 865.4 MB in the end (delta: 145.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-11-10 12:21:32,906 INFO L168 Benchmark]: Witness Printer took 246.97 ms. Allocated memory is still 2.0 GB. Free memory was 865.4 MB in the beginning and 843.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:21:32,907 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.73 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 922.7 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 922.7 MB in the beginning and 1.1 GB in the end (delta: -211.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 844.12 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: 122.8 MB). Peak memory consumption was 122.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40625.47 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 847.2 MB). Free memory was 1.0 GB in the beginning and 865.4 MB in the end (delta: 145.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 246.97 ms. Allocated memory is still 2.0 GB. Free memory was 865.4 MB in the beginning and 843.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1626]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 == myStatus) && 0 <= PagingReferenceCount) && s <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0) || !(\old(myStatus) == 0)) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 <= PagingReferenceCount) && s <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && PagingReferenceCount <= 0) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 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))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1320]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (0 <= InterfaceType && ((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (0 <= InterfaceType && ((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 729]: 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) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 938]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && s == \old(s)) && 0 == customIrp) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) && 6 <= MPR3)) - InvariantResult [Line: 917]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 797]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || (((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1)) || (((1 <= NP && SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1 && (((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2))) && MPR3 <= 6) && !(259 == status))) || ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) && 0 == status)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((SKIP1 + 2 <= MPR1 && NP + 2 <= SKIP1 && (((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2))) && status + 1073741536 <= 0)) || (status == lowerDriverReturn && (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && compRegistered <= 0) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: (((((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 0 < myStatus + 1073741637) || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType)) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0)) - InvariantResult [Line: 851]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: ((((((((0 < myStatus + 1073741637 || ((\old(customIrp) == 1 && ((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || (((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || (((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus))) - InvariantResult [Line: 1347]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == pended && 1 <= s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount) && s <= 1) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 1131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1389]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || (((0 == pended && \old(s) == s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\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)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 739]: 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)) || (((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && 0 == status) && PagingReferenceCount <= 0) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 0 <= PagingReferenceCount) && MPR3 <= 6) && 6 <= MPR3)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: (((((((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled)) && ((((((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled))) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= s) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 0 < PagingReferenceCount)) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && \old(s) == s) && SKIP1 + 2 <= MPR1) && 1 <= s) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 872]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: ((((((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((((((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3)) && (((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType) || ((((((((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && MPR1 == s) && DC + 2 <= SKIP2) && NP <= 1) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && MPR3 <= 6) && 1 <= setEventCalled) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((s == SKIP1 || MPR1 < SKIP1 + 2) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((6 < MPR3 || ((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0)) - InvariantResult [Line: 746]: 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))) || 0 <= status) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 221]: Loop Invariant Derived loop invariant: (((((((((((((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) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((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)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) && ((((0 < myStatus + 1073741637 || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType) || (((((1 <= NP && ((((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || (((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && (((((((((((__cil_tmp7 + 1073741802 <= 0 && returnVal2 == 259) && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || ((((((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount)) && 1 <= setEventCalled) && setEventCalled <= 1)) || 6 < MPR3) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && returnVal2 == 259) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || (((((1 <= NP && ((((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount) || (((((((((((((NP + 2 <= SKIP1 && __cil_tmp7 + 1073741802 <= 0) && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 5 <= MPR3) && MPR1 == s) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && NP == \old(s)) && 0 < PagingReferenceCount))) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) - InvariantResult [Line: 1152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 787]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || (((((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1) && IPC == s) && compRegistered <= 0)) || (SKIP2 == s && NP + 2 <= SKIP1 && ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0) || ((((NP + 5 <= MPR3 && DC + 5 <= IPC) && DC + 2 <= SKIP2) && pended == 1) && compRegistered <= 0)))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || (status == lowerDriverReturn && (((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || ((((((status == lowerDriverReturn && NP + 5 <= MPR3) && DC + 5 <= IPC) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 915]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1315]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || ((DC == s && 0 == pended) && 0 == status)) || (status == lowerDriverReturn && ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || 0 < \old(PagingReferenceCount)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 936]: 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(DC))) || \old(PagingReferenceCount) < 0) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 895]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 779]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || \old(PagingReferenceCount) < 0) || ((((((NP + 2 <= SKIP1 && NP + 5 <= MPR3) && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((((NP + 5 <= MPR3 && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && 0 == status) && compRegistered <= 0)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || 0 < \old(PagingReferenceCount)) || (status == lowerDriverReturn && ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1400]: Loop Invariant Derived loop invariant: (((((((((((((SKIP1 < NP + 2 || ((!(259 == ntStatus) && 0 == pended) && s == NP)) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 6 < MPR3) || NP < 1) || (s == NP && pended == 1)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || !(\old(s) == NP)) || !(0 == \old(pended))) || IPC < DC + 5 - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: (((((MPR1 < SKIP1 + 2 || s == SKIP1) || (((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1) || 0 < myStatus + 1073741637) || (6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || 0 < MaximumInterfaceType)) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((6 < MPR3 || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || ((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((__cil_tmp7 + 1073741802 <= 0 && 1 <= setEventCalled) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || (((((((MPR1 < SKIP1 + 2 || ((!(0 == pended) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || MPR3 < 6) || !(customIrp == 0)) - InvariantResult [Line: 849]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1089]: Loop Invariant Derived loop invariant: ((((((((0 < myStatus + 1073741637 || ((\old(customIrp) == 1 && ((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(s) == s) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((((((((((6 < MPR3 || NP < 1) || !(myStatus == 0)) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((((((6 < MPR3 || NP < 1) || SKIP1 < NP + 2 || (!(0 == pended) || compRegistered < 1) || IPC < DC + 5) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || MPR3 < \old(s)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || \old(s) < MPR3) || 1 < \old(setEventCalled)) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp))) && (((((((((((((((((6 < MPR3 || !(myStatus == 0)) || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || 1 < PagingReferenceCount) || ((((((((((((((((DC + 5 <= IPC && 0 == pended) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || PagingReferenceCount <= 0) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: ((((((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus) && 0 < PagingReferenceCount) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 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) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 1133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((((((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) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((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)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) - InvariantResult [Line: 1329]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == pended && 1 <= s) && PagingReferenceCount <= 0) && 0 <= PagingReferenceCount) && s <= 1) || SKIP1 < NP + 2) || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((((((((DC == s && 0 == compRegistered) && pended == 1) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) && 0 < PagingReferenceCount)) || 0 < MaximumInterfaceType) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((1 <= NP && ((((NP + 2 <= SKIP1 && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && MPR3 <= 6) && !(259 == ntStatus))) || (((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && (1 < PagingReferenceCount || PagingReferenceCount <= 0)) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((NP + 2 <= SKIP1 && ntStatus + 1073741823 <= 0) && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && (1 < PagingReferenceCount || PagingReferenceCount <= 0))) && ((((((((((((DC == s && 0 == compRegistered) && pended == 1) || ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && PagingReferenceCount <= 1) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && lowerDriverReturn == ntStatus) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) && 0 < PagingReferenceCount)) || !(\old(myStatus) == 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || 0 < MaximumInterfaceType) || ((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && pended == 1)) || (((1 <= NP && ((((NP + 2 <= SKIP1 && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && 0 < PagingReferenceCount) && MPR3 <= 6) && !(259 == ntStatus))) || (((((((((((((((NP + 2 <= SKIP1 && 1 <= NP) && DC + 5 <= IPC) && 0 == pended) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == customIrp) && (1 < PagingReferenceCount || PagingReferenceCount <= 0)) && lowerDriverReturn == ntStatus) && DC + 2 <= SKIP2) && NP <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && !(\old(s) == MPR3)) && compRegistered <= 0) && 6 <= MPR3)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || (((((NP + 2 <= SKIP1 && ntStatus + 1073741823 <= 0) && (((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP == \old(s)) && (1 < PagingReferenceCount || PagingReferenceCount <= 0))) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1375]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 0 < \old(PagingReferenceCount)) || MPR3 < 6) || 1 < NP) || \old(PagingReferenceCount) < 0) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) && ((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || 1 < PagingReferenceCount) || PagingReferenceCount <= 0) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((PagingReferenceCount <= 1 && SKIP1 + 2 <= MPR1) && 1 <= s) && DC + 2 <= SKIP2) && ((((0 == pended && DC + 5 <= IPC) && \old(s) == s) && 1 <= compRegistered) && NP == \old(s)) && s + 2 <= SKIP1) && s <= 1) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(259 == ntStatus)) && MaximumInterfaceType <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 419 locations, 1 error locations. SAFE Result, 40.5s OverallTime, 66 OverallIterations, 2 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 21.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 26883 SDtfs, 12654 SDslu, 81534 SDs, 0 SdLazy, 11137 SolverSat, 2088 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1082 GetRequests, 629 SyntacticMatches, 17 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1109occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 66 MinimizatonAttempts, 2268 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 142 LocationsWithAnnotation, 2469 PreInvPairs, 2839 NumberOfFragments, 24013 HoareAnnotationTreeSize, 2469 FomulaSimplifications, 528625 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 142 FomulaSimplificationsInter, 489004 FormulaSimplificationTreeSizeReductionInter, 19.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 5246 NumberOfCodeBlocks, 5246 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 5177 ConstructedInterpolants, 0 QuantifiedInterpolants, 841714 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3756 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 69 InterpolantComputations, 66 PerfectInterpolantSequences, 349/358 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...